Solving a bi-objective transportation location routing problem by metaheuristic algorithms

European Journal of Operational Research

Volumn 234, Issue 1, 2014, Pages 25-36

  Martínez Salazar, Iris Abril ^a,c   Molina, Julian ^b   Ángel Bello, Francisco ^a   Gómez, Trinidad ^b   Caballero, Rafael ^b  

^a SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

^b UNIVERSITY OF MÁLAGA   (Spain)

^c UNIVERSIDAD AUTÓNOMA DE NUEVO LEÓN   (Mexico)

Author keywords

Logistics; Metaheuristics; Multiple objective programming; Transportation Location Routing Problem

Indexed keywords

COMPUTATIONAL EXPERIMENT; LOCATION ROUTING PROBLEM; MATHEMATICAL FORMULATION; META HEURISTIC ALGORITHM; META HEURISTICS; MULTIPLE OBJECTIVE PROGRAMMING; NON DOMINATED SORTING GENETIC ALGORITHM II (NSGA II); TRANSPORTATION PROBLEM;

LOGISTICS; MULTIOBJECTIVE OPTIMIZATION;

TRUCK TRANSPORTATION;

EID: 84890442328     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.09.008     Document Type: Article

References (38)

1. Albareda-Sambola, M., Díaz, J. A., & Fernández, E. (2001). Heuristic approaches for solving a class of combined location-routing problem. In 4th Metaheuristics international conference (pp. 405-410). Porto, Portugal.
2. M. Albareda-Sambola, J.A. Díaz, and E. Fernández A compact model and tight bounds for a combined location-routing problem Computer & operations research 32 2005 407 428
3. D. Ambrosino, and M.G. Scutellà Distribution network design: New problems and related models European Journal of Operational Research 165 2005 610 624
4. S. Barreto, C. Ferreira, J. Paixão, and B. Sousa Santos Using clustering analysis in a capacitated location-routing problem European Journal of Operational Research 179 2007 968 977
5. M. Boccia, T. Crainic, A. Sforza, and C. Sterle A metaheuristic for a two echelon location-routing problem P. Festa, Experimental algorithms Lecture notes in computer science Vol. 6049 2010 Springer 288 301
6. Bouhafs, L., Hajjam, A., & Koukam, A. (2006). A combination of simulated annealing and ant colony for the capacitated location-routing problem. In KES (pp. 409-416).
7. R. Caballero, M. González, F.M. Guerrero, J. Molina, and C. Paralera Solving a multiobjective location routing problem with a metaheuristic based on Tabu Search. Application to a real case in Andalusia European Journal of Operational Research 177 2007 1751 1763
8. C. Contardo, V. Hemmelmayr, and T.G. Crainic Lower and upper bounds for the two-echelon capacitated location-routing problem Computers and Operations Research 39 2012 3185 3199
9. G. Cornuejols, M.L. Fischer, and G.L. Nemheuser Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms Management Science 23 1977 789 810
10. K. Deb, S. Agrawal, A. Pratab, and T. Meyunivan A fast elitist non-dominated sorting algorithm for multi-objective optimization NSGA-II IEEE Transactions on Evolution Computation 2002 2182 2197
11. M.R. Garey, and D.S. Johnson Computers and intractability. A guide to the theory of NP-completeness 1979 W.H. Freeman and Company San Francisco
12. B. Jarboui, H. Derbel, S. Hanafi, and N. Mladenović Variable neighborhood search for location routing Computers & Operations Research 40 2013 47 57
13. R. Karp Reducibility among combinatorial problems Miller J. Thatcher, Complexity of computer computations 1972 Plenum Pres New York, USA
14. M.N. Kritikos, and G. Ioannou The balanced cargo vehicle routing problem with time windows International Journal of Production Economics 123 2010 42 51
15. S.H. Lashine, M. Fattouh, and A. Issa Location/allocation and routing decisions in supply chain network design Journal of Modelling in Management 1 2006 173 183
16. C. Lin, and R. Kwok Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data European Journal of Operational Research 175 2006 1833 1849
17. Y. Marinakis, and M. Marinaki A particle swarm optimization algorithm with path relinking for the location routing problem Journal of Mathematical Modelling and Algorithm 2008 59 78
18. N. Megiddo, and K. Supowit On the complexity of some common geometric location problems SIAM Journal on Computing 1984 182 196
19. J. Melechovský, C. Prins, and R. Wolfler Calvo A metaheuristic to solve a location-routing problem with non-linear costs Journal of Heuristics 11 2005 375 391
20. C. Miller, A. Tucker, and R. Zemlin Integer programming formulation of traveling salesman problems Journal of the ACM 7 1960 326 329
21. H. Min, V. Jayaraman, and R. Srivastava Combined location-routing problems: A synthesis and future research directions European Journal of Operational Research 108 1998 1 15
22. J. Molina, M. Laguna, R. Martí, and R. Caballero SSPMO: A scatter tabu search procedure for non-linear multiobjective optimization INFORMS Journal on Computing 19 2007 91
23. G. Nagy, and S. Salhi Location-routing: Issues, models and methods European Journal of Operational Research 177 2007 649 672
24. Y. Peng, and L.-J. Bai An integrated optimization problem in logistics and the PSO solution 2006 IEEE
25. C. Prins, C. Prodhon, A. Ruiz, P. Soriano, and R.W. Wolfler Calvo Solving the capacitated location-routing problem by a cooperative lagrangean relaxation-granular tabu search heuristic Transportation Science 41 2007 470 483
26. C. Prins, C. Prodhon, and R.W. Wolfler Calvo Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking 4OR: A Quarterly Journal of Operations Research 4 2006 221 238
27. S. Salhi, and G. Rand The effect of ignoring routes when location depots European Journal of Operational Research 1989 150 156
28. F. Samanlioglu A multi-objective mathematical model for the industrial hazardous waste location-routing problem European Journal of Operational Research 226 2 2013 332 340
29. Z.-J. Shen Integrated supply chain design models: A survey and future research directions Journal of Industrial and Management Optimization 3 2007 1 27
30. R. Srivastava, and W.C. Benton The location-routing problem: Considerations in physical distribution system Computers and Operations Research 17 5 1990 427 435
31. R.E Steuer Multiple criteria optimization: Theory, computation, and application 1986 John Wiley & Sons New York Chapter 14
32. C.J. Ting, and V. Chen A multiple ant colony optimization algorithm for the capacitated location routing problem International Journal of Production Economics 141 1 2013 34 44
33. P. Toth, and D. Vigo The vehicle routing problem Siam Monographs on Discrete Mathematics and Applications 2002
34. D. Tunzun, and L.I. Burke A two-phase tabu search approach to the location routing problem European Journal of Operational Research 116 1999 87 99
35. X. Wang, X. Sun, and Y. Fang A two-phase hybrid heuristic search approach to the location-routing problem IEEE International Conference on Systems, Man, and Cybernetics 4 2005 3338 3343
36. T.-H. Wu, C. Low, and J.-W. Bai Heuristic solutions to multi-depot location-routing problem Computers & Operations Research 29 2002 1393 1415
37. Zitzler, E., Laumanns, M., & Thiele, L. (2001). SPEA2: Improving the strength pareto evolutionary algorithm. Technical Report 103, Swiss Federal Institute of Technology (ETH), Computer Engineering and Networks Laboratory (TIK), Zurich, Switzerland.
38. E. Zitzler, and L. Thiele Multiobjective evolutionary algorithms: a comparative case study and strength pareto approach IEEE Transactions on Evolutionary Computation 1999 257 271