Open vehicle routing problem based on kernel route tabu search algorithm

Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS

Volumn 13, Issue 4, 2007, Pages 827-832

  Zhong, Shi Quan ^a   Du, Gang ^a  

^a TIANJIN UNIVERSITY   (China)

Author keywords

Capacity constraint; Kernel route; Open vehicle routing problem; Tabu search algorithm

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MATHEMATICAL MODELS; OPTIMIZATION; TABU SEARCH;

CAPACITY CONSTRAINT; DISTANCE CONSTRAINT; KERNEL ROUTE; NEIGHBORHOOD OPERATION; OPEN VEHICLE ROUTING PROBLEM; TABU SEARCH ALGORITHM;

VEHICLE ROUTING;

EID: 34249995135     PISSN: 10065911     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. SARIKLIS D, POWELL S. A heuristic method for the open vehicle routing problem [J]. Journal of the Operational Research Society, 2000, 51(5): 564-573.
2. TARANTILIS C D, KIRANOUDIS C T. Distribution of fresh meat [J]. Journal of Food Engineering, 2002, 51(1): 85-91.
3. BRANDAO J. A tabu search heuristic algorithm for open vehicle routing problem [J]. European Journal of Operational Research, 2004, 157(3): 552-564.
4. TARANTILIS C D, IOANNOU G, KIRANOUDIS C T, et al. Solving the open vehicle routing problem via single parameter meta-heuristic algorithm [J]. Journal of the Operational Research Society, 2005, 56(5): 588-596.
5. FU Z, EGLESE R, LI LYO. A new tabu search heuristic for the open vehicle routing problem [J]. Journal of the Operational Research Society, 2005, 56(3): 267-274.
6. MICHEL G, ALAIN H, GILBERT L. New insertion and post-optimization procedures for the traveling salesman problem [J]. Operations Research, 1992, 40(6): 1086-1093.
7. AUGERAT J M, BELENGUER E, BENAVERNT A, et al. Computational results with a branch and cut code for the capacitated vehicle routing problem [R]//Research Report 949-M. Grenoble, France: Joseph Fourier University, 1995.
8. EILON S, WATSON G, CHRISTOFIDES N. Vehicle scheduling [M]//Distribution Management: Mathematical Modeling and Practical Analysis. London, UK: Griffin, 1971: 180-223.
9. LIN S, KERNIGHAN B W. An effective heuristic algorithm for the traveling salesman problem [J]. Operations Research, 1973, 21(2):498-516.