A Continuous Time Model of Multi-vehicle Routing Problems: A Column Generation Approach

Matsushita, Susumu; Nishi, Tatsushi; Morikawa, Masa Aki; Hisano, Takeshi

doi:10.1109/smc.2013.74

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nishi et al (2011) developed a bilevel decomposition algorithm for solving the simultaneous production scheduling and conflict-free routing problem for AGVs. Matsushita et al (2013) studied the DCFRP taking into account vehicle acceleration and deceleration. Umar et al (2015) proposed a hybrid genetic algorithm for the DCFRP to minimise makespan, AGV travel time and penalty cost due to job tardiness and delays incurred by conflict avoidance.…”

Section: Dispatch and Conflict-free Routing Problemsmentioning

confidence: 99%

Dispatch and conflict-free routing of capacitated vehicles with storage stack allocation

Thanos

Wauters

Berghe

2019

Journal of the Operational Research Society

View full text Add to dashboard Cite

Congested traffic networks impose great difficulties upon scheduling material transportation in industrial settings. Dispatching decisions become complex when, in addition to conflict-free routes, storage location must also be considered. The present paper integrates the dispatch and conflict-free routing of capacitated vehicles with the storage allocation problem and proposes a heuristic approach for minimising the total completion time of box pickup, delivery and relocation requests in a warehouse environment. The developed formulation models a warehouse setting in which boxes are stored in stacks and considers different forward and reverse speeds for the vehicles, real-world movement restrictions and a LIFO loading policy. The proposed approach is evaluated using two different metaheuristics and the results are compared against existing schedules prepared by an industry partner. Experimental results demonstrate the effectiveness of the proposed method for large-scale instances and highlight how improved storage allocation decisions can reduce service times.

show abstract

Section: Dispatch and Conflict-free Routing Problemsmentioning

confidence: 99%