A pareto-based particle swarm optimization algorithm for multi-objective location routing problem

International Journal of Industrial Engineering : Theory Applications and Practice

Volumn 22, Issue 3, 2015, Pages 314-329

  Liu, Jie ^a   Kachitvichyanukul, Voratas ^a  

^a ASIAN INSTITUTE OF TECHNOLOGY   (Thailand)

Author keywords

Location routing problem; Movement strategies; Multiple objectives; Non dominated solution; Pareto front; Particle swarm optimization

Indexed keywords

DECODING; LOCATION; PARTICLE SWARM OPTIMIZATION (PSO); ROUTING ALGORITHMS;

LOCATION ROUTING PROBLEM; MOVEMENT STRATEGIES; MULTIPLE-OBJECTIVES; NONDOMINATED SOLUTIONS; PARETO FRONT;

MULTIOBJECTIVE OPTIMIZATION;

EID: 84957027691     PISSN: 10724761     EISSN: 1943670X     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. Abounacer, R., Rekik, M. and Renaud, J. (2012). An Exact Solution Approach for Multi-objective Location-transportation Problem for Disaster Response. Computers & Operations Research, 41:83-93.
2. Bruns, A. D. (1998). Zweistufige Standortplanung unter Berücksichtigung von Tourenplanungsaspekten: primale Heuristiken und lokale Suchverfahren. PhD Thesis. Sankt Gallen University, St. Gallen, Switzerland.
3. Caballero, R., González, Guerrero, F. M., Molina, J. and Paralera, C. (2007). 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(3):1751-1763.
4. Chankong, V., Haimes, Y., Thadathil, J. and Zionts, S. (1985). Multiple Criteria Optimization; A State of the Art Review. Lecture Notes in Economics and Mathematical Systems, 242:36-90.
5. Cornuejols, G., Fisher, M. L. and Nemhauser, G. L. (1977). Location of bank accounts to optimization: An analytic study of exact and approximate algorithms. Management Science, 23(8):789-810.
6. Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182-197.
7. Fonseca, C. and Fleming, P. J. (1993). Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion, Generalization, Proceedings of the fifth International Conference on Genetic Algorithms, San Mateo, CA.
8. Horn, J., Nafpliotis, N. and Goldberg, D. E. (1994). A Niched Pareto Genetic Algorithm for Multiobjective Optimization, Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, Piscataway, NJ.
9. Jacobsen, S. K. and Madsen, O. B. G. (1980). A comparative study of heuristics for a two-level routing-location problem. European Journal of Operational Research, 5(6):378-387.
10. Laporte, G. and Nobert, Y. (1981). An exact algorithm for minimizing routing and operating costs in depot location. European Journal of Operational Research, 6(2):224-226.
11. Lin, C. K. Y. and Kwok, R. C. W. (2006). 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(3):1833-1849.
12. Liu, J. and Kachitvichyanukul, V. (2014). A particle swarm optimisation algorithm for the capacitated location-routing problem. International Journal of Operational Research, article in press.
13. Liu, J. (2014). Particle Swarm Optimization for Location Routing Problems. PhD Dissertation. School of Engineering, Asian Institute of Technology, Thailand.
14. Min, H., Jayaraman, V. and Srivastava, R. (1998). Combined location-routing problems: a synthesis and future research directions. European Journal of Operational Research, 108(1):1-15.
15. Moghaddam, R. T., Makui, A. and Mazloomi, Z. (2010). A new integrated mathematical model for a bi-objective multi-depot location-routing problem solved by a multi-objective scatter search algorithm. Journal of Manufacturing Systems, 29(2-3):111-119.
16. Nagy, G. and Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2):649-672.
17. Nasab, N. G., Jabalameli, M. S., Aryanezhad, M. B. and Makui, A. (2013). Modeling and solving the bi-objective capacitated location-routing problem with probabilistic travel times. The International Journal of Advanced Manufacturing Technology, 67(9-12):2007-2019.
18. Ngatchou, P., Zarei, A. and El-Sharkawi, M. A. (2005). Pareto Multi Objective Optimization, Intelligent Systems Application to Power Systems, Proceedings of the 13th International Conference on Digital Object Identifier, Arlington, VA.
19. Nguyen, S. and Kachitvichyanukul, V. (2010). Movement Strategies for Multi-Objective Particle Swarm Optimization. International Journal of Applied Metaheuristic Computing, 1(3):59-79.
20. Nguyen, S., Ai, T. J. and Kachitvichyanukul, V. (2010). User's Manual: Object Library for Evolutionary Techniques (ET-Lib). Version 1.0, Asian Institute of Technology, THAILAND.
21. Pongchairerks, P. and Kachitvichyanukul, V. (2009). Particle Swarm Optimization Algorithm with Multiple Social Learning Structures. International Journal of Operational Research, 6(2):176-194.
22. Prins, C., Prodhon, C. and Calvo, R. W. (2006a). Solving the Capacitated Location-Routing Problem by a GRASP complemented by a learning process and a path relinking. A Quarterly Journal of Operations Research, 4(3):221-238.
23. Prins, C., Prodhon, C. and Calvo, R. W. (2006b). A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem. Lecture notes in Computer Science, 3906:183-194.
24. Prodhon, C. (2010). Classical instances for LRP. From http://prodhonc.free.fr/Instances/instances-us.htm, (last updated 25 February, 2010).
25. Rath, S. and Gutjahr, W. J. (2011). A math-heuristic for the warehouse location-routing problem in disaster relief. Computers & Operations Research, 22:1-15.
26. Schaffer, J. D. (1985). Multiple objective optimization with vector evaluated genetic algorithms, Proceedings of 1st International Conference on Genetic Algorithms.
27. Wisittipanich, W. and Kachitvichyanukul, V. (2013). An Efficient PSO Algorithm for Finding Pareto-Frontier in Multi-Objective Job Shop Scheduling Problems. Industrial Engineering & Management Systems, 12(2):151-160.
28. Wisittipanich, W. and Kachitvichyanukul, V. (2014). Mutation Strategies toward Pareto Front for Multi-objective Differential Evolution Algorithm. International Journal of Operational Research, 19(3):315-337.
29. Zitzler, E. and Thiele. L. (1999). Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. Transactions on Evolutionary computation, 3(4):257-271.