Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen

Pesquisa Operacional

Vanessa De Oliveira Ferreira¹  Vitória Pureza¹ 

[1] ,Universidade Federal de São CarlosSão Carlos SP ,Brasil

关键词: Vehicle routing;    multiple deliverymen;    heuristics;    commercial routing systems;   

DOI  :  10.1590/S0101-74382012005000016

来源: SciELO

【 摘 要 】

In this work we consider a variant of the vehicle routing problem that allows the assignment of multiple deliverymen to one or more routes. A practical motivation for this variant arises, for example, in the distribution of beverages in highly dense urban areas, characterized by the difficulty in serving daily requests within regular working day hours with a single deliveryman per vehicle. We present a mathematical model and a savings algorithm in order to generate low cost routes that maximize the number of requests served in compliance with the maximum route time. The impact of the extra deliverymen on the solutions provided by the proposed heuristic is assessed by means of sets of generated examples based on classical instances of literature. It is also presented the results obtained by an adaptation of a tabu search approach from the literature.

【 授权许可】

CC BY   
 All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License