| 1 |
Dantzig GB and Ramser JH (1959). The truck dispatching problem. Manage Sci 6: 80-91.
DOI
ScienceOn
|
| 2 |
Toth P and Vigo D (1997). An exact algorithm for the vehicle routing problem with backhauls. Transport Sci 31: 372-385.
DOI
ScienceOn
|
| 3 |
Mingozzi A, Giorgi S and Baldacci R (1999). An exact method for the vehicle routing problem with backhauls. Transport Sci 33:315-329.
DOI
|
| 4 |
Duhamel C, Potvin J-Y and Rousseau J-M (1997). A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transport Sci 31:49-59.
DOI
ScienceOn
|
| 5 |
Toth P and Vigo D (1999). A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. Eur J Oper Res 113:528-543.
DOI
ScienceOn
|
| 6 |
Brandão J (2006). A new tabu search algorithm for the vehicle routing problem with backhauls. Eur J Oper Res 173:540-555.
DOI
ScienceOn
|
| 7 |
Min H (1989). The multiple the vehicle routing problem with simultaneous delivery and pick-up points. Transport Res Part A 5:377-386.
DOI
ScienceOn
|
| 8 |
Dethloff J (2001). Vehicle routing and reverse logistics:the vehicle routing problem with simultaneous delivery and pick-up. Oper Res Spektrum 23:79-96.
DOI
|
| 9 |
Dethloff J (2002). Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pickup applied to the vehicle routing problem with backhauls. J Oper Res Soc 53:115-118.
DOI
ScienceOn
|
| 10 |
Nagy G and Salhi S (2005). Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur J Opl Res 162:126-141.
DOI
ScienceOn
|
| 11 |
Salhi S, Sari M, Saidi D and Touati N (1992). Adaptation of some vehicle fleet mix heuristics. Omega 20, 653-660.
DOI
ScienceOn
|
| 12 |
Chen JF and Wu TH (2006). Vehicle routing problem with simultaneous deliveries and pickups. J Opl Res Soc 57:579 - 587.
DOI
ScienceOn
|
| 13 |
Lin S and Kernighan B (1973). An effective heuristic algorithm for the traveling salesman problem. Opns Res 21: 498-516.
DOI
ScienceOn
|
| 14 |
Augerat P (1995). Approche polyèdrale du problème de tournées de véhicules. PhD thesis, Institut National Polytechnique de Grenoble-Inpg. http://www.branchandcut.org/VRP/data/, accessed 1 April 2009.
|
| 15 |
Mosheiov G (1994). The travelling salesman problem with pick-up and delivery. Eur J Oper Res 79:299-310.
DOI
ScienceOn
|
| 16 |
Clarke G and Wright J (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568-581.
DOI
ScienceOn
|
| 17 |
Deif I and Bodin L (1984). Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling. In: Kidder A (ed). Proceedings of the Babson conference on software uses in transportation and logistic management, Babson Park, FL, USA, pp 75-96.
|
| 18 |
Goetschalckx M and Jacobs-Blecha C (1989). The vehicle routing problem with backhauls. Eur J Oper Res 42:39-51.
DOI
ScienceOn
|
| 19 |
Thangiah SR, Potvin J-Y and Sun T (1996). Heuristicapproaches to vehicle routing with backhauls and time windows. Comput Oper Res 23:1043-1057.
DOI
ScienceOn
|
| 20 |
Angelelli E and Mansini R (2002). The vehicle routing problem with time windows and simultaneous pick-up and delivery. In: Klose A, Speranza MG, Van Wassenhove LN (Eds). Quantitative Approaches to Distribution Logistics and Supply Chain Management, Springer-Verlag, Berlin, pp. 249-267.
|
| 21 |
Tang FA and Galvao RD (2002). Vehicle routing problems with simultaneous pick-up and delivery service. Opsearch 39:19-33.
DOI
|
| 22 |
Tang FA and Galvão RD (2006). A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comp Opns Res 33:595-619.
DOI
ScienceOn
|
| 23 |
Nagy G and Salhi S (1999). A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J Opl Res Soc 50: 1034-1042.
DOI
ScienceOn
|
| 24 |
Nagy G and Salhi S (1998). The many-to-many location-routing problem. TOP 6:261-275.
DOI
|
webmaster
