Article ID: | iaor201527523 |
Volume: | 88 |
Issue: | 4 |
Start Page Number: | 326 |
End Page Number: | 340 |
Publication Date: | Oct 2015 |
Journal: | Computers & Industrial Engineering |
Authors: | Novaes Antonio G N, Bez Edson T, Burin Paulo J, Arago Dmontier P |
Keywords: | production: JIT, combinatorial optimization, networks: flow |
Dynamic vehicle routing problems have received increasing attention in the literature due to the rapid IT evolution as well as advances in computing and modelling techniques. In areas subject to critical and often unpredictable traffic congestions, logistics operators often allocate excessive number of collecting tasks to their vehicles, generating unperformed activities due to OEM JIT time constraints and thus violating contractual obligations assumed with their clients. In this paper, a dynamic OEM picking‐up (milk‐run) routing problem is analysed, in which tasks that likely will exceed the time limit in a route are assigned to supplementary vehicles, thus forming auxiliary dynamic routes formed with the transferred tasks originated from the regular trucks. To solve the problem, a genetic algorithm model was developed in association with a simulation program intended to define some relevant probabilistic parameters. The results have shown that the dynamic formulation considerably improves the service level when compared with the static version.