A heuristic algorithm for multicommodity vehicle routing problems : an extesion of the saving algorithm

Gwo-Hshiung Tzeng ^[1] ; Hsin-Der Chen ^[1]
1. [1] National Chiao Tung University
  
  National Chiao Tung University
  
  Taiwán
Localización: Mini and Microcomputers and their applications / Emilio Luque Fadón (ed. lit.), 1988, págs. 319-321
Idioma: inglés
Texto completo no disponible (Saber más ...)
Resumen
- Among so many heuristic algorithms for vehicle routing problems, there is one, called the saving method, which has advantages of easy computation synchronously considering many other constraints such as capacity and time window, , etc...The saving method can treat single commodity problems only. In this paper the purpouse is to extend the saving method can treat single multicommodity problems only. So this paper first described the original and the modified saving methods to the MVRP and some techniques were presented. The final were some computation results and their discussions.