Skip to main content
SpringerLink
Log in

Multi-objective generalized traveling salesman problem: A decomposition approach

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Using the features of shuffle, re-generation, and 4-opt operation, a novel heuristic has been proposed based on the decomposition approach for the multi-objective generalized traveling salesman problems. A three-layer solution updating mechanism, namely, a shuffle layer, a layer for re-generation, and a layer for 4-opt operation, has been designed for the same. The shuffle and re-generation operations are specially designed to solve this problem. The shuffle operation is applied to a solution sequence (complete path/tour) to improve the corresponding objectives. The re-generation operation consists of two phases- in the first phase, the objectives are improved by interchanging a few portions of the groups/clusters sequence, and in the second phase, the same is done by replacing some cities from the corresponding groups. Finally, the solution and the corresponding groups are rearranged using the 4-opt operation for the betterment of the same. Problems with varying sizes from the generalized traveling salesman problem library are solved using the proposed approach to verify its performance and for the illustration. Some widely used performance metrics for multi-objective solution methodologies have been applied to the proposed heuristic to measure its performance. Various well-established heuristics have been modified according to this problem and are implemented to compare the efficiency of the proposed heuristic. Based on the performance metrics values of the computational outputs, a conclusion can be drawn that the proposed heuristic, named SR4-MOEA/D, is the best compared to the other heuristics implemented for the same. Also, every test instance of the proposed algorithm provides the best pareto optimal front, which is distributed over the whole true pareto front of the respective problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. AL H (1969) Record balancing problem-a dynamic programming solution of a generalized traveling salesman problem. Revue Francaise D Informatique De Recherche Operationnelle 3(NB 2):43

    Google Scholar 

  2. Ariyasingha I, Fernando T (2015) Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem. Swarm Evolution Comput 23:11–26

    Article  Google Scholar 

  3. Audet C, Bigeon J, Cartier D, Le Digabel S, Salomon L (2020) Performance indicators in multiobjective optimization. Europ J Oper Res

  4. Charnes A, Cooper WW, Ferguson RO (1955) Optimal estimation of executive compensation by linear programming. Manag Sci 1(2):138–151

    Article  MathSciNet  Google Scholar 

  5. Coello CAC, Cortés NC (2005) Solving multiobjective optimization problems using an artificial immune system. Genetic Programm Evolvable Machines 6(2):163–190

    Article  Google Scholar 

  6. Cohon J (2013) Chapter 6: Techniques for generating noninferior solutions. Multiobjective programming and planning, Courier Corporation

  7. Das I, Dennis JE (1998) Normal-boundary intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):631–657

    Article  MathSciNet  Google Scholar 

  8. Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mechan Eng 186(2-4):311–338

    Article  Google Scholar 

  9. Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol 16. Wiley, Hoboken

    MATH  Google Scholar 

  10. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evolution Comput 6(2):182–197

    Article  Google Scholar 

  11. Fischetti M, Salazar González JJ, Toth P (1997) A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper Res 45(3):378–394

    Article  MathSciNet  Google Scholar 

  12. Fonseca CM, Fleming PJ, et al. (1993) Genetic algorithms for multiobjective optimization: Formulationdiscussion and generalization. In: Icga, vol 93. Citeseer, Pennsylvania, pp 416–423

  13. Gottlieb J, Raidl GR (2006) Evolutionary Computation in Combinatorial optimization: 6th European Conference, evoCOP 2006, Budapest, Hungary, April 10-12, 2006, proceedings, vol 3906. Springer, Berlin

    Book  Google Scholar 

  14. Gutin G, Karapetyan D (2010) A memetic algorithm for the generalized traveling salesman problem. Nat Comput 9(1):47–60

    Article  MathSciNet  Google Scholar 

  15. Hajela P, Lin C. -Y. (1992) Genetic search strategies in multicriterion optimal design. Struct Optim 4(2):99–107

    Article  Google Scholar 

  16. Helsgaun K (2006) An effective implementation of K-opt moves for the Lin-Kernighan TSP heuristic. PhD thesis, Roskilde University. Department of Computer Science

  17. Horn J, Nafpliotis N, Goldberg DE (1994) A niched pareto genetic algorithm for multiobjective optimization. In: Proceedings of the first IEEE conference on evolutionary computation. IEEE world congress on computational intelligence. Ieee, pp 82–87

  18. Huang W, Zhang Y, Li L (2019) Survey on multi-objective evolutionary algorithms. Journal of physics: Conference series, 1288:012057 aug

  19. Jaszkiewicz A, Słowiński R (1999) The ’light beam search’approach–an overview of methodology applications. Eur J Oper Res 113(2):300–314

    Article  Google Scholar 

  20. Kaisa M (1999) Nonlinear Multiobjective Optimization, vol 12. Springer, US

    MATH  Google Scholar 

  21. Khan I, Maiti MK (2018) A novel hybrid algorithm for generalized traveling salesman problems in different environments. Vietnam J Comput Sci 5(1):27–43

    Article  Google Scholar 

  22. Khan I, Maiti MK (2019) A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evolution Comput 44:428–438

    Article  Google Scholar 

  23. Khan I, Maiti MK, Basuli K (2021) A random-permutation based ga for generalized traveling salesman problem in imprecise environments. Evol Intel 1–17

  24. Khan I, Maiti MK, Maiti M (2017) Coordinating particle swarm optimization, ant colony optimization and k-opt algorithm for traveling salesman problem. In: International conference on mathematics and computing. Springer, pp 103–119

  25. Khan MMK, Indadul, Kreshnendu B (2020) Multi-objective traveling salesman problem: an abc approach. Applied Intelligence

  26. Knowles J, Corne D (1999) The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimisation. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol 1. IEEE, pp 98–105

  27. Knowles JD, Corne DW (2000) Approximating the nondominated front using the pareto archived evolution strategy. Evolution Comput 8(2):149–172

    Article  Google Scholar 

  28. Korhonen PJ, Laakso J (1986) A visual interactive method for solving the multiple criteria problem. Eur J Oper Res 24(2):277–287

    Article  MathSciNet  Google Scholar 

  29. Lancia G, Dalpasso M (2019) Algorithmic strategies for a fast exploration of the tsp 4-opt neighborhood. In: Advances in optimization and decision science for society, services and enterprises. Springer, pp 457–470

  30. Laporte G, Asef-Vaziri A, Sriskandarajah C (1996) Some applications of the generalized travelling salesman problem. J Oper Res Soc 47(12):1461–1467

    Article  Google Scholar 

  31. Laporte G, Nobert Y (1983) Generalized travelling salesman problem through n sets of nodes: an integer programming approach. INFOR: Inform Syst Oper Res 21(1):61–75

    MATH  Google Scholar 

  32. Maity S, Roy A, Maiti M (2016) An imprecise multi-objective genetic algorithm for uncertain constrained multi-objective solid travelling salesman problem. Expert Syst Appl 46:196–223

    Article  Google Scholar 

  33. Pintea C, Pop P, Chira C (2006) Reinforcing ant colony system for the generalized traveling salesman problem. Proc. BIC-TA. Evolutionary Computing 245–252

  34. Reinelt G (1991) Tsplib–a traveling salesman problem library. ORSA J Comput 3(4):376–384

    Article  Google Scholar 

  35. Renaud J, Boctor FF (1998) An efficient composite heuristic for the symmetric generalized traveling salesman problem. Eur J Oper Res 108(3):571–584

    Article  Google Scholar 

  36. Saskena J (1970) Mathematical model of scheduling clients through welfare agencies. J Canadian Oper Res Soc 8:185– 200

    MathSciNet  Google Scholar 

  37. Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the first international conference on genetic algorithms and their applications. Lawrence Erlbaum Associates. Inc. Publishers, New Jersey, p 1985

  38. Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Europ J Oper Res 174(1):38–53

    Article  MathSciNet  Google Scholar 

  39. Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evolution Ccomput 2(3):221–248

    Article  Google Scholar 

  40. Srivastava S, Kumar S, Garg R, Sen P (1969) Generalized traveling salesman problem through n sets of nodes. CORS J 7(2):97

    MathSciNet  MATH  Google Scholar 

  41. van Pinxten J, Geilen M, Basten T, Waqas U, Somers L (2016) Online heuristic for the multi-objective generalized traveling salesman problem. In: 2016 Design, automation & test in europe conference & exhibition (DATE). IEEE, pp 822–825

  42. Van Veldhuizen DA, Lamont GB (2000) On measuring multiobjective evolutionary algorithm performance. In: Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No. 00TH8512), vol 1. IEEE, pp 204–211

  43. Wierzbicki AP (1980) The use of reference objectives in multiobjective optimization. In: Multiple criteria decision making theory and application. Springer, pp 468–486

  44. Wu C, Liang Y, Lee HP, Lu C (2004) Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining. Phys Rev E 70(1):016701

    Article  Google Scholar 

  45. Zhang Q, Li H, Moea D (2007) A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evolution Comput 11(6):712–731

    Article  Google Scholar 

  46. Zhao Y, Liu H-L (2013) Multi-objective particle swarm optimization algorithm based on population decomposition. In: International conference on intelligent data engineering and automated learning. Springer, pp 463–470

  47. Zhou A, Qu B-Y, Li H, Zhao S-Z, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evolution Comput 1(1):32–49

    Article  Google Scholar 

  48. Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: Methods and applications, vol 63. Citeseer, Pennsylvania

    Google Scholar 

  49. Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evolution Comput 3(4):257–271

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Chandrakona Vidyasagar Mahavidyalaya, Paschim-Medinipur, West Bengal, 721201, India

    Indadul Khan

  2. Department of Mathematics, Mahishadal Raj College, Mahishadal, Purba-Medinipur, West Bengal, 721628, India

    Manas Kumar Maiti

  3. Department of Computer Science, West Bengal State University, Barasat, Kolkata, West Bengal, 700126, India

    Krishnendu Basuli

Authors
  1. Indadul Khan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manas Kumar Maiti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Krishnendu Basuli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Indadul Khan.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khan, I., Maiti, M.K. & Basuli, K. Multi-objective generalized traveling salesman problem: A decomposition approach. Appl Intell 52, 11755–11783 (2022). https://doi.org/10.1007/s10489-021-02989-w

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-021-02989-w

Keywords

Search

Navigation