A Heuristic Algorithm for Single Veichle Route Problem with Multi Time Windows

Peng Gao

doi:10.4028/www.scientific.net/AMR.468-471.461

Paper Titles

Analysis of Combination Mode about Vibration Mixer in Concrete Mixing Mechanics
p.443

Design and Analysis of Cards-Flipping Algorithm
p.448

Buildings on the Slope Considering Effects of Uneven Settlement of many Piles on the Structure Research
p.452

A Modified Finite Element Model for Electromagnetic Tube Compression Process
p.456

A Heuristic Algorithm for Single Veichle Route Problem with Multi Time Windows
p.461

Design and Development of a Test Platform for Performance of Variable Speed Control Switches in Power Tools
p.467

A Study on Dynamic Adjustment Behavior of Asset-Liability Ratio of Manufacturing Listed Companies in China
p.471

AL7N01 Butt Joint Welding Residual Stress Measurement by Ultrasonic Method
p.476

Agent-Based Simulation of Forest Firefighting
p.480

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 468-471A Heuristic Algorithm for Single Veichle Route...

A Heuristic Algorithm for Single Veichle Route Problem with Multi Time Windows

Abstract:

Veichle route problem with multi time windows is ani mportant issue in the manufacture and combinanl optimal problem, and has wide uses in the real life. Upto the problem in the real life, this paper build the mathmatic model, and analysis the complexity of the model. A heuristic algorithm is proposed based on the model, examples and test data is descripted to prove the vality and effective of the algorithm.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 468-471)

Pages:

461-466

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.468-471.461

Citation:

Cite this paper

Online since:

February 2012

Authors:

Peng Gao

Keywords:

Heuristic Algorithm , Single Veichle Route Problem, Time Windows

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Lau H C, Liang Z. Pickup and delivery with time windows: algorithms and test case generation [OB/OL].www.comp.nus.edu.sg/~lauhc/ICTAI2001.pdf

Google Scholar

[2] Solomon M M. Algorithms for the vehicle routing and scheduling problems with time window constraints [J].Operations Research. 1987, 41: 469–488.

DOI: 10.1287/opre.35.2.254

Google Scholar

[3] Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows, European Journal of Operational Research 54,1991,7-22

DOI: 10.1016/0377-2217(91)90319-q

Google Scholar

[4] Nabila Azi，Michel Gendreau，Jean-Yves Potvin. An Exact Algorithm for a Vehicle Routing Problem with Time Windows and Multiple Use of Vehicles[OB/OL].

DOI: 10.1016/j.ejor.2009.06.034

Google Scholar

[5] Azi N., Gendreau M., Potvin J.-Y. An Exact Algorithm for a Single Vehicle Routing Problem with TimeWindows and Multiple Routes[J]. European Journal of Operational Research. 2007, 178: 755– 766.

DOI: 10.1016/j.ejor.2006.02.019

Google Scholar

[6] Feillet D., Dejax P., Gendreau M., Gueguen C. An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to Some Vehicle Routing Problems[J]. Networks. 2004, 44: 216–229.

DOI: 10.1002/net.20033

Google Scholar

[7] Stefan Ropke. Branch-and-Cut-and-Price for the Pickup and Delivery Problem with Time Windows[OB/OL].

Google Scholar

[8] Jaw J.J., Odoni A.R., Psaraftis H.N., Wilson N.H.M., A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research B,Vol.20B,No.3,1983,243-257

DOI: 10.1016/0191-2615(86)90020-2

Google Scholar

[9] Madsen O.B.G., Ravn H.F., Rygaard J.M., A heuristic algorithm for a dial-a-ride routing and scheduling problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research 1995,60:193-208.

DOI: 10.1007/bf02031946

Google Scholar

[10] Quan Lu, Maged M. Dessouky. A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows. European Journal of Operational Research. 2006,175,672–687

DOI: 10.1016/j.ejor.2005.05.012

Google Scholar

[11] Li Ling, ChenJian, Gu Hany. Insertion Heurisitic in Multi-Vehicle Pickup and Delivery Problem with time window. Journal of Shanghai Jiaotong University.Vol 36,99-101

Google Scholar