Abstract
The multi-objective traveling salesman problem (MOTSP) is an essential and challenging topic in the domains of engineering and optimization problems. In this paper we propose new variant of multi-objective chemical reaction optimization (MOCRO) called Enhanced MOCRO (EMOCRO) for solving MOTSP. The key idea of the proposed variant is the use of the dominance strategy and chemical reaction concepts. Compared to MOCRO, EMOCRO has a reduced number of parameters and a simplified general scheme. In order to give the quality of the algorithm, several MOTSP instances taken from the TSP library are used. The proposed approach is statistically compared with MOCRO and NSGA2. Results indicate that the EMOCRO outperformed other approaches in most of the test instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lust, T., Teghem J.: The multiobjective traveling salesman problem: a survey and new approach. In: Nature Inspired Computing. vol. 272, pp. 119–137. Springer, Berlin (2010)
Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. John Wiley and Sons Ltd. (2001)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2002)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Technical report (2001)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, USA (1989)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Lam, A., Li, V.: Chemical-reaction-inspired meta-heuristic for optimization. IEEE Trans. Evol. Comput. 14, 381–399 (2010)
Fisher, R., Richter, K.: Solving a multiobjective traveling salesman problem by dynamic programming. Mathematische operations for schung und statistik, Series Optimization 13, 247–252 (1982)
Paquete, L., Stutzle, T.: Design and analysis of stochastic local search for the multiobjective traveling salesman problem. Comput. Oper. Res. 36, 2619–2631 (2009)
Hansen, M.P.: Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP. J. Heuristics 6, 419–431 (2000)
Bouzoubia, S., Layeb, A., Chikhi, S.: A multi-objective chemical reaction optimisation algorithm for multi-objective travelling salesman problem. Int. J. Innovative Comput. Appl. 6, 87–101 (2014)
Gao, F., Zhou, A., Zhang, G.: An estimation of distribution algorithm based on decomposition for the multi-objective TSP. In: International Conference on Natural Computation (ICNC 2012), pp. 817–821 (2012)
Zhang, Q., Li, H.: MOEA/D: a multi-objective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007)
Ke, L., Zhang, Q., Battiti, R.: MOEA/D-ACO: a multiobjective evolutionary algorithm using decomposition and ant colony. IEEE Trans. Cybern. 43(6), 1845–1859 (2013)
Iredi, S., Merkle, D., Middendorf, M.: Bi-criterion optimization with multi colony ant algorithms. Evolutionary Multi-criterion Optimization, pp. 359-372. Springer (2001)
He, J.: Solving the multiobjective multiple traveling salesmen problem using membrane algorithm. Bio-inspired Computing, Theories and Applications, Communications in Computer and Information Science, vol. 472, pp. 171–175 (2014)
Xu, J., Lam, A.Y.S., Li, V.O.K.: Chemical reaction optimization for the grid scheduling problem. In: Proceedings of the IEEE ICC, pp. 1–5 (2010)
Sun, J., Wang, Y., Li, J., Gao, K.: Hybrid algorithm based on chemical reaction optimization and lin-kernighan local search for the traveling salesman problem. In: Seventh International Conference on Natural Computation, pp. 1518–1521 (2011)
Truong, T.K., Li, K., Xua, Y.: Chemical reaction optimization with greedy strategy for the 0–1 knapsack problem. Appl. Soft Comput. 13, 1774–1780 (2013)
Li, J.Q., Pan, Q.K.: Chemical reaction optimization for flexible job-shop scheduling problems with maintenance activity. Appl. Soft Comput. 12, 2896–2912 (2012)
Reinelt, G.: TSPLIB a traveling salesman problem library. ORSA J. Comput. 3, 376–384 (1991)
Zitzler, E.: Evolutionary algorithms for multi-objective optimization: methods and applications. Ph.D. thesis, Swiss Federal Institute of Technology, Zurich (1999)
Deb, K., Agrawal, S., Pratab, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithms for multi-objective optimization. Technical report, Institute of technology, Kanpur India (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Bouzoubia, S., Layeb, A., Chikhi, S. (2016). Enhanced Chemical Reaction Optimization for Multi-objective Traveling Salesman Problem. In: Chikhi, S., Amine, A., Chaoui, A., Kholladi, M., Saidouni, D. (eds) Modelling and Implementation of Complex Systems. Lecture Notes in Networks and Systems, vol 1. Springer, Cham. https://doi.org/10.1007/978-3-319-33410-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-33410-3_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33409-7
Online ISBN: 978-3-319-33410-3
eBook Packages: EngineeringEngineering (R0)