Open vehicle routing problem with driver nodes and time deadlines

Journal of the Operational Research Society

Volumn 58, Issue 9, 2007, Pages 1223-1234

  Aksen, D ^a   Ozyurt Z ^a   Aras, N ^b  

^a KOÇ UNIVERSITY   (Turkey)

^b BOGAZICI UNIVERSITY   (Turkey)

Author keywords

Heuristics; Open vehicle routing; Tabu search; Time deadlines; Vehicle routing

Indexed keywords

CONSTRAINED OPTIMIZATION; HEURISTIC METHODS; OPERATIONS RESEARCH; PROBLEM SOLVING; TABU SEARCH;

COMPUTATION TIME; SOLUTION QUALITY; TIME DEADLINES;

VEHICLE ROUTING;

EID: 34547817599     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602249     Document Type: Article

References (19)

1. Bodin L, Golden B, Assad A and Ball M (1983). Routing and scheduling of vehicles and crews: the state of the art. Comput Opns Res W. 63-211.
2. Brandão J (2004). A tabu search heuristic algorithm for open vehicle routing problem. Eur J Opl Res 157: 552-564.
3. Clarke G and Wright JW (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568-581.
4. Desrochers M and Laporte G (1991). Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Opns Res Lett 10: 27-36.
5. Fu Z, Eglese R and Li LYO (2005). A new tabu search heuristic for the open vehicle routing problem. J Opl Res Soc 56: 267-274.
6. Fu Z, Eglese R and Li LYO (2006). Corrigendum to the paper 'A new tabu search heuristic for the open vehicle routing problem'. J Opl Res Soc 57: 1017-1018.
7. Kara I, Laporte G and Bektas T (2004). A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur J Opl Res 158: 793-795.
8. Letchford AN, Lysgaard J and Eglese RW (2006). A branch-and-cut algorithm for the capacitated open vehicle routing problem. Working paper. Available online.
9. Li L and Fu Z (2002). The school bus routing problem: A case study. J Opl Res Soc 53: 552-558.
10. Li F, Golden B and Wasil E (2006). The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput Opl Res, to appear, available online doi:10.1016/j.cor.2005.11.018.
11. Pisinger D and Ropke S (2006). A general heuristic for vehicle routing problems. Comput Opl Res, to appear, available online doi:10.1016/j.cor.2005.09.012.
12. Reinelt G (1991). The Traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag: Berlin.
13. Rochat Y and Taillard ED (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147-167.
14. Sariklis D and Powell S (2000). A heuristic method for the open vehicle routing problem. J Opl Res Soc 51: 564-573.
15. Schrage L (1981). Formulation and structure of more complex/realistic routing and scheduling problems. Networks 11: 229-232.
16. Tarantilis CD and Kiranoudis CT (2002). Distribution of fresh meat. J Food Eng 51: 85-91.
17. Tarantilis CD, Diakoulaki D and Kiranoudis CT (2004). Combination of geographical information system and efficient routing algorithms for real life distribution operations. Eur J Opl Res 152: 437-453.
18. Tarantilis CD, Ioannou G, Kiranoudis CT and Prastacos GP (2005). Solving the open vehicle routing problem via a single parameter meta-heuristic algorithm. J Opl Res Soc 56: 588-596.
19. Van Breedam A (1994). An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related, and time-related constraints. PhD thesis, University of Antwerp.