Heurística de asignación en tiempo real de vehículos a tareas de acarreo intermodal Heuristic of real-time assignment of intermodal drayage task
暂无分享,去创建一个
The scheduling of transportation systems has traditionally been done once a day. At beginning of a working day, the planner establishes which tasks will be carried out by each vehicle. Then, traffic jam, breakdown and any unexpected problem will cause delays on our timetable. In this paper, we propose to use real-time vehicle position knowledge to solve this problem. So, the planner is permanently enabled to reallocate tasks as the problem conditions change. As both drayage problem is a NP-Hard problem and a high-speed procedure is required, exact methods are not computationally feasible. So, a heuristic algorithm has been implemented to perform the problem described.
[1] Gerrit K. Janssens,et al. A local search heuristic for the pre- and end-haulage of intermodal container terminals , 2009, Comput. Oper. Res..
[2] Luis Gerardo Onieva Giménez,et al. Modelo de ayuda a la decisión en transporte intermodal , 2007 .
[3] E K Morlok,et al. REDESIGNING RAIL-TRUCK INTERMODAL DRAYAGE OPERATIONS FOR ENHANCED SERVICE AND COST PERFORMANCE , 1994 .