A simulated annealing heuristic for the open location-routing problem

Computers and Operations Research

Volumn 62, Issue , 2015, Pages 184-196

  Yu, Vincent F ^a   Lin, Shin Yu ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Capacitated location routing problem; Open location routing problem; Simulated annealing; Third party logistics

Indexed keywords

AIRSHIPS; BENCHMARKING; COSTS; OUTSOURCING;

CAPACITATED LOCATION; COMPUTATIONAL RESULTS; DISTRIBUTION CENTERS; FACILITY OPERATIONS; FIXED COST; LOCATION ROUTING PROBLEM; THIRD PARTY LOGISTICS;

SIMULATED ANNEALING;

EID: 84937969260     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2014.10.009     Document Type: Article

References (24)

1. F Li, B. Golden, and E. Wasil The open vehicle routing problem: Algorithms, large-scale test problems, and computational results Comput Oper Res 34 10 2007 2918 2930
2. J. Brandao A tabu search algorithm for the open vehicle routing problem Eur J Oper Res 157 3 2004 552 564
3. V.F. Yu, S-W Lin, W. Lee, and C.-J. Ting A simulated annealing heuristic for the capacitated location routing problem Comput Ind Eng 58 2 2010 288 299
4. D. Tuzun, and L.I. Burke A two-phase tabu search approach to the location routing problem Eur J Oper Res 116 1 1999 87 99
5. C. Prins, C. Prodhon, and R. Wolfler Calvo Solving the capacitated location-routing problem by a grasp complemented by a learning process and a path relinking 4OR 4 3 2006 221 238
6. S. Barreto, C. Ferreira, J. Paixão, and B.S. Santos Using clustering analysis in a capacitated location-routing problem Eur JOper Res 179 3 2007 968 977
7. C. Prins, C. Prodhon, A. Ruiz, P. Soriano, and R. Wolfler Calvo Solving the capacitated location-routing problem by a co-operative lagrangean relaxation-granular tabu search heuristic Transp Sci 41 4 2007 470 483
8. H. Derbel, B. Jarboui, S. Hanafi, and H. Chabchoub Genetic algorithm with iterated local search for solving a location-routing problem Expert Syst Appl 36 3 2012 2865 2871
9. C. Duhamel, P. Lacomme, C. Prins, and C. Prodhon A GRASP×ELS approach for the capacitated location-routing problem Comput Oper Res 37 11 2010 1912 1923
10. C.-J. Ting, and C.-H. Chen A multiple ant colony optimization algorithm for the capacitated location routing problem Int J Prod Econ 141 1 2013 34 44
11. R.B. Lopes, C. Ferreira, B.S. Santos, and S. Barreto A taxonomical analysis, current methods and objectives on location-routing problems Int Trans Oper Res 20 6 2013 795 822
12. D. Sariklis, and S. Powell A heuristic method for the open vehicle routing problem J Oper Res Soc 51 5 2000 564 573
13. C.D. Tarantilis, G. Ioannou, C.T. Kiranoudis, and G.P. Prastacos A threshold accepting approach to the open vehicle routing problem RAIRO - Oper Res 38 4 2004 345 360
14. Z. Fu, R. Eglese, and Lyo Li A new tabu search heuristic for the open vehicle routing problem J Oper Res Soc 56 3 2005 267 274
15. K. Fleszar, I.H. Osman, and K.S. Hindi A variable neighbourhood search algorithm for the open vehicle routing problem Eur J Oper Res 195 3 2009 803 809
16. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller Equations of state calculations by fast computing machines J Chem Phys 21 6 1953 1087 1092
17. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi Optimization by simulated annealing Science 220 4598 1983 671 680
18. S. Lin, and B.W. Kernighan An effective heuristic algorithm for the traveling salesman problem Oper Res 21 1973 498 519
19. K. Helsgaun An effective implementation of the lin-kernighan traveling salesman heuristic Eur J Oper Res 126 1 2000 106 130
20. S.S. Barreto Análise e modelização de problemas de localização-distribuição [analysis and modelling of location-routing problems] campus universit' ario de Santiago (Ph.D. thesis) 2004 University of Aveiro Aveiro, Portugal
21. C. Prins, C. Prodhon, and R. Wolfler Calvo Nouveaux algorithmes pour le problème de localisation et routage sous contraintes de capacité. MOSIM' 04 2 2004 Lavoisier, Ecole des Mines de Nantes France 1115 1122
22. L. Bouhafs, A. Hajjam, and A. Koukam A combination of simulated annealing and ant colony system for the capacitated location-routing problem M.G. Negoita, Knowledge-Based Intelligent Information and Engineering Systems. Lecture Notes in Computer Science 2006 Springer Berlin Heidelberg 409 416
23. C. Prins, C. Prodhon, and R. Wolfler Calvo A memetic algorithm with population management (ma|pm) for the capacitated location-routing problem J. Gottlieb, G.R. Raidl, Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science 2006 Springer Berlin Heidelberg 183 194
24. Y. Marinakis, and M. Marinaki A particle swarm optimization algorithm with path relinking for the location routing problem J Math Model Algorithms 7 1 2008 59 78