TASTE: A two-phase heuristic to solve a routing problem with simultaneous delivery and pick-up

International Journal of Advanced Manufacturing Technology

Volumn 37, Issue 11-12, 2008, Pages 1221-1231

  Ganesh, K ^a   Narendran, T T ^b  

^a Lakshmi Machine Works Limited   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Enhanced simulated annealing; Routing; Simultaneous delivery and pick up; Two phase heuristic

Indexed keywords

ANNEALING; COMPUTER NETWORKS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; PACKAGING; PLATES (STRUCTURAL COMPONENTS); SET THEORY; SIMULATED ANNEALING; STANDARDS; TWO PHASE FLOW; VEHICLE ROUTING;

BEST SOLUTION; DATA-SETS; INITIAL SOLUTION; LIMITED CAPACITY; MATHEMATICAL PROGRAMMING MODELS; PICK-UP; REVERSE LOGISTICS (RL); ROUTING PROBLEMS; SECOND PHASE; SIMULATED ANNEALING (SA); SPRINGER (CO); TRAVELING SALESMAN; TRAVELING SALESMAN PROBLEM (TSP);

TRAVELING SALESMAN PROBLEM;

EID: 45749143876     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-1056-2     Document Type: Article

References (27)

1. Altinkemer K, Gavish B (1991) Parallel savings based heuristics for the delivery problem. Oper Res 39:456-469
2. Angelelli E, 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, Berlin Heidelberg New York, pp 249-267
3. Anily S, Mosheiov G (1994) The traveling salesman problem with delivery and backhauls. Oper Res Lett 16:11-18
4. Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum 23:79-96
5. Dethloff J (2002) Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls. J Oper Res Soc 53:115-118
6. Dhaenens-Flipo C (2000) Spatial decomposition for a multi-facility production and distribution problem. Int J Prod Econ 64:177-186
7. Gendreau M, Laporte G, Vigo D (1999) Heuristics for the traveling salesman problem with pickup and delivery. Comput Oper Res 26:699-714
8. Golden BL, Skiscim CC (1986) Using simulated annealing to solve routing and location problems. Nav Res Logist 33:261-279
9. Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671-680
10. Lenstra JK, Rinnooy Kan AHG (1976) On general routing problems. Networks 6:273-280
11. Min H (1989) The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transp Res 23:377-386
12. Mosheiov G (1994) The travelling salesman problem with pick-up and delivery. Eur J Oper Res 79:299-310
13. Nagy G, Salhi S (2005) Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur J Oper Res 162(1):126-141
14. Or I (1976) Traveling salesman type combinatorial problems and their relation to the logistics of blood banking. PhD dissertation, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, Illinois, pp 1-13
15. Reinelt G (1991) TSPLIB-a traveling salesman problem library. ORSA J Comput 3(4):376-384
16. Reveliotis SA (2000) Conflict resolution in AGV systems. IIE Trans 32:647-659
17. Salhi S, Nagy G (1999) A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J Oper Res Soc 50:1034-1042
18. Solomon MM, Desrosiers J (1988) Time window constrained routing and scheduling problem. Transp Sci 22:1-13
19. Taillard E, Badeau P, Gendreau M, Guertin F, Potvin J (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31:170-186
20. Tang FA, Galvão RD (2002) Vehicle routing problems with simultaneous pick-up and delivery service. J Oper Res Soc India (OPSEARCH) 39:19-33
21. Toth P, Vigo D (1999) A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. Eur J Oper Res 113:528-543
22. Vaidyanathan BS, Matson JO, Miller DM, Matson JE (1999) A capacitated vehicle routing problem for just-in-time delivery. IIE Trans 31:1083-1092
23. Chen X, Wan W, Xu X (1998) Modeling rolling batch planning as vehicle routing problem with time windows. Comput Oper Res 25:1127-1136
24. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21:498-516
25. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading, Massachusetts
26. Bodin LD, Golden BL, Assad A, Ball MO (1983) Routing and scheduling of vehicles and crews: the state of the art. Comput Oper Res 10:63-211
27. Gendreau M, Laporte G, Potvin JY (2002) Metaheuristics for the capacitated vehicle routing problem. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM, Philadelphia, Pennsylvania, pp 129-149