Research on Multiple Depots Open-path VRPTW Based on the Whole Vehicle Delivery and Its Implementation

WEI Bai-xin; SHI Hai-bo

Volume 34 Issue 3

Jun. 2005

Turn off MathJax

Article Contents

Abstract

References

INFORMATION AND CONTROL > 2005 > 34(3): 350-355.

WEI Bai-xin, SHI Hai-bo. Research on Multiple Depots Open-path VRPTW Based on the Whole Vehicle Delivery and Its Implementation[J]. INFORMATION AND CONTROL, 2005, 34(3): 350-355.

Citation:

WEI Bai-xin, SHI Hai-bo. Research on Multiple Depots Open-path VRPTW Based on the Whole Vehicle Delivery and Its Implementation[J]. INFORMATION AND CONTROL, 2005, 34(3): 350-355.

Citation:

WEI Bai-xin, SHI Hai-bo. Research on Multiple Depots Open-path VRPTW Based on the Whole Vehicle Delivery and Its Implementation[J]. INFORMATION AND CONTROL, 2005, 34(3): 350-355.

Research on Multiple Depots Open-path VRPTW Based on the Whole Vehicle Delivery and Its Implementation

WEI Bai-xin^1,2,
SHI Hai-bo¹

1.
Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China
2.
Graduate School of the Chinese Academy of Sciences, Beijing 100039, China

More Information

Received Date: February 03, 2005
Published Date: June 19, 2005

Graphical Abstract

Abstract

Abstract

A more complicated mathematical model based on practical details for open-path multiple depot capacitated vehicle routing problem with time window (MDCVRPTW) is presented against whole vehicle sale logistics. To achieve the rapid global optimization, an improved genetic algorithm (IGA) whi ch generates partial solutions and evaluates the fully expanded solutions and merge crossover operator MX1 are first introduced into the solution of MDCVRPTW. Besides, a mixed open-path delivery method is proposed to improve full load ratio and reduce empty return load ratio. Computer simulation shows the feasiblity of the proposed algorithm.

FullText(HTML)

References (10)

References

[1]	Kraj ar S. Algorithms for Interactive Optimal Planning of Distribution Networks [D]. Ann Arbor: University of Aagre Press,1988.
[2]	Filipec M, Skrlec D, Krajcar S. Darwin meets computers: new approach to multiple depot capacitatod vehicle routing problem [A]. Proceedings of of the International Conference on Systems,Man and.Cybemetics [C]. Orlando, USA: Pergamon Press,1997. 421～426.
[3]	Filipec M, Skrlec D, Krajcar S. Genetic algorithm approach for multiple depot capacitated vehicle routing problem solving with heuristic improvements built-in [J]. International Journal of Modeling and Simulation, 2000,20(4):320～328.
[4]	Skok M, Skrlec D, Krajcar S. The genetic algorithm method for multiple depot capacitatod vehicle routing problem solving [A]. The Fourth International Conference on Knowledge-based Intelligent Engineering Systems & Allied Technologies [C]. Brighton,UK:UK Press,2000. 520～526.
[5]	李军,郭耀煌.物流配送车辆优化调度理论与方法[M] 北京:中国物资出版社,2001.
[6]	Powell M J D. Variable metric methods for constrained optimization [J]. Mathematical Programming; the State of the Art, 1983,29(29):288～311.
[7]	Sulhil J L, Xiang Y Y, Yuan Z Y. Multiple vehicle routing with time windows using genetic algorithms [A]. IEEE Congress on Evolutionary Computation [C]. Pisoataway, NJ, USA: IEEE,1999.1804～1808.
[8]	Syswerda G. Schedule Optimization Using Genetic Algorithms [Z]. New York: Van Nostrand Reinhold, 1991. 332～349.
[9]	Whitley D. The genitor algorithm AND selection pressure: why ank-based allocation of reproductive trials is best [A]. Proceedings of the Third International Conference on Genetic Algorithmsand Their Application [C]. Morgan, USA: Morgan KaufmannPublishers, 1989. 116～121.
[10]	Haghaui A L, Jung S A. Dynamic vehicle routing problem withtime-dependent travel times [J]. Computers & Operations Research, 2004,31(4):653～681.