Skip to main content
SpringerLink
Log in

Multi-objective covering salesman problem: a decomposition approach using grey wolf optimization

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

In this study, the basic grey wolf optimization (GWO) algorithm is modified along with K-bit exchange, K-opt operation, and integrated with the structure of multi-objective evolutionary algorithm with decomposition approach (MOEA/D) to solve multi-objective covering salesman problem(MOCSP). The algorithm is named a “multi-objective evolutionary algorithm with decomposition using Grey Wolf optimization (MOEA/D-GWO).” The K-opt operation with \(K=3\) and \(K=4\) is used to generate the initial solution set. The GWO algorithm is modified with a set of newly introduced perturbation rules. A two-stage updating mechanism has been introduced to improve the quality of a potential solution. The first sage of the process is done by the modified GWO algorithm, and in the second stage, a perturbation technique using K-bits exchange operation is applied. The MOEA/D-GWO algorithm is a two-phase algorithm where in the first phase, the clustering/grouping of cities is done, and in the next phase one city from each cluster/group is selected to search pareto-optimal Hamiltonian cycles in such a way that each cycle maintains the pre-define covering distance. Here, for the first time a heuristic approach is proposed for MOCSP. Different sizes of standard benchmark MOCSP test instances are used to test the performance of the MOEA/D-GWO algorithm. The instances are generated from TSPLIB. Different traditional multi-objective optimization algorithms, like NSGA-II, SPEA2, MOEA/D, MR-ABCWCD, SMPSO, SR4-MOEA/D for MOOP, have been modified according to MOCSP and implemented to compare the efficiency of the proposed approach. Nine standard well-known performance metrics/indicators have been used to analyse the performance of the MOEA/D-GWO algorithm for MOCSP. Different sizes bi-objective instances are generated from TSPLIB, for the illustration and testing the performance of the algorithm. Detailed problem generation approach is also discussed. From all the numerical studies, it is concluded that the proposed algorithm is efficient enough to deal with the MOCSPs.

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
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30
Fig. 31
Fig. 32

Similar content being viewed by others

References

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

    Article  Google Scholar 

  2. Arkin EM, Hassin R (1994) Approximation algorithms for the geometric covering salesman problem. Discret Appl Math 55(3):197–218

    Article  MathSciNet  MATH  Google Scholar 

  3. Audet C, Bigeon J, Cartier D, Le Digabel S, and Salomon L (2020) Performance indicators in multi-objective optimization. Eur J Oper Res

  4. Coello CAC, Cortes NC (2005) Solving multiobjective optimization problems using an artificial immune system. Genet Program Evolvable Mach 6(2):163–190

    Article  Google Scholar 

  5. Current JR, Schilling DA (1989) The covering salesman problem. Transp Sci 23(3):208–213

    Article  MathSciNet  MATH  Google Scholar 

  6. 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  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol 16. John Wiley & Sons, London

    MATH  Google Scholar 

  9. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  10. Emary E, Yamany W, Hassanien AE, Snasel V (2015) Multi-objective gray-wolf optimization for attribute reduction. Procedia Comput Sci 65:623–632

    Article  Google Scholar 

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

  12. Gendreau M, Laporte G, Semet F (1997) The covering tour problem. Oper Res 45(4):568–576

    Article  MathSciNet  MATH  Google Scholar 

  13. Golden B, Naji-Azimi Z, Raghavan S, Salari M, Toth P (2012) The generalized covering salesman problem. INFORMS J Comput 24(4):534–553

    Article  MathSciNet  MATH  Google Scholar 

  14. 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

  15. Gulczynski DJ, Heath JW, Price CC (2006) The close enough traveling salesman problem: a discussion of several heuristics. In: Perspectives in operations research, pp 271–283

  16. Hachicha M, Hodgson MJ, Laporte G, Semet F (2000) Heuristics for the multi-vehicle covering tour problem. Comput Oper Res 27(1):29–42

    Article  MATH  Google Scholar 

  17. Helsgaun K (2006) An effective implementation of K-opt moves for the Lin-Kernighan TSP. In: Roskilde University, 2007. Case

  18. 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–7

  19. Huang W, Zhang Y, Li L (2019) Survey on multi-objective evolutionary algorithms. J Phys Conf Ser 1288:012057

    Article  Google Scholar 

  20. Kaisa M (1999) Nonlinear multiobjective optimization, vol 12. Springer US

    MATH  Google Scholar 

  21. Khadanga RK, Kumar A, Panda S (2022) A modified grey wolf optimization with cuckoo search algorithm for load frequency controller design of hybrid power system. Appl Soft Comput 124:109011

    Article  Google Scholar 

  22. 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 

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

    Article  Google Scholar 

  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, Berlin, pp 103–119

  25. Khan I, Pal S, Maiti MK (2018) A modified particle swarm optimization algorithm for solving traveling salesman problem with imprecise cost matrix. In: 2018 4th International conference on recent advances in information technology (RAIT). IEEE, pp 1–8

  26. Khan I, Pal S, Maiti MK (2019) A hybrid PSO-GA algorithm for traveling salesman problems in different environments. Int J Uncertain Fuzziness Knowl Based Syst 27(05):693–717

    Article  Google Scholar 

  27. Khan I, Maiti MK, Basuli K (2020) Multi-objective traveling salesman problem: an ABC approach. Appl Intell

  28. Khan I, Maiti MK, Basuli K (2022) Multi-objective generalized traveling salesman problem: a decomposition approach. Appl Intell

  29. 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

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

    Article  Google Scholar 

  31. Labb M, Laporte G, Martın IR, Gonzalez JJS (2004) The ring star problem: polyhedral analysis and exact algorithm. Netw Int J 43(3):177–189

    MathSciNet  MATH  Google Scholar 

  32. Labb M, Laporte G, Martın IR, González JJS (2005) Locating median cycles in networks. Eur J Oper Res 160(2):457–470

    Article  MathSciNet  MATH  Google Scholar 

  33. 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, Berlin, pp 457–470

  34. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498–516

    Article  MathSciNet  MATH  Google Scholar 

  35. Liu Q, Li X, Liu H, Guo Z (2020) Multi-objective metaheuristics for discrete optimization problems: a review of the state-of-the-art. Appl Soft Comput 106382

  36. 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 

  37. Michalewicz Z (2013) Genetic algorithms+ data structures= evolution programs. Springer, Berlin

    MATH  Google Scholar 

  38. Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61

    Article  Google Scholar 

  39. Mnif M, Bouamama S (2017) Firework algorithm for multi-objective optimization of a multimodal transportation network problem. Procedia Comput Sci 112:1670–1682

    Article  Google Scholar 

  40. Mohamed AAA, El-Gaafary AA, Mohamed YS, Hemeida AM (2016) Multi-objective modified grey wolf optimizer for optimal power flow. In: 2016 Eighteenth international middle east power systems conference (MEPCON). IEEE, pp 982–990

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

    Article  MATH  Google Scholar 

  42. Salari M, Naji-Azimi Z (2012) An integer programming-based local search for the covering salesman problem. Comput Oper Res 39(11):2594–2602

    Article  MathSciNet  MATH  Google Scholar 

  43. Salari M, Reihaneh M, Sabbagh MS (2015) Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem. Comput Ind Eng 83:244–251

    Article  Google Scholar 

  44. Sayın S (2000) Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math Program 87(3):543–560

    Article  MathSciNet  MATH  Google Scholar 

  45. Schott JR (1995) Fault tolerant design using single and multicriteria genetic algorithm optimization. PhD thesis, Massachusetts Institute of Technology

  46. Shuttleworth R, Golden BL, Smith S, Wasil E (2008) Advances in meter reading: heuristic solution of the close enough traveling salesman problem over a street network. In: The vehicle routing problem: latest advances and new challenges. Springer, Berlin, pp 487–501

  47. Sopto DS, Ayon SI, Akhand M, Siddique N (2018) Modified grey wolf optimization to solve traveling salesman problem. In: 2018 International conference on innovation in engineering and technology (ICIET). IEEE, pp 1–4

  48. Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221–248

    Article  Google Scholar 

  49. Trivedi V, Varshney P, Ramteke M (2020) A simplified multi-objective particle swarm optimization algorithm. Swarm Intell 14:83–116

    Article  Google Scholar 

  50. Van Veldhuizen DA (1999) Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Technical report, AIR FORCE INST OF TECH WRIGHT-PATTERSONAFB OH SCHOOL OF ENGINEERING

  51. 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

  52. Yang C, Liu K, Jiao X, Wang X, Chen Ruihu, You Sixiong (2022) An adaptive firework algorithm optimization-based intelligent energy management strategy for plug-in hybrid electric vehicles. Energy 239:0360–5442

    Article  Google Scholar 

  53. Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731

    Article  Google Scholar 

  54. Zhang Z, Yang J (2022) A discrete cuckoo search algorithm for traveling salesman problem and its application in cutting path optimization. Comput Ind Eng 169:108157

    Article  Google Scholar 

  55. Zhu Z, Zhou X (2020) An efficient evolutionary grey wolf optimizer for multi-objective flexible job shop scheduling problem with hierarchical job precedence constraints. Comput Ind Eng 140:106280

    Article  Google Scholar 

  56. Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: methods and applications, vol 63

  57. Zitzler E, Thiele L (1998) Multiobjective optimization using evolutionary algorithms-a comparative case study. In: International conference on parallel problem solving from nature. Springer, Berlin, pp 292–301

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Indadul Khan

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

    Krishnendu Basuli

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

    Manas Kumar Maiti

Authors
  1. Indadul Khan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krishnendu Basuli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manas Kumar Maiti
    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

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khan, I., Basuli, K. & Maiti, M.K. Multi-objective covering salesman problem: a decomposition approach using grey wolf optimization. Knowl Inf Syst 65, 281–339 (2023). https://doi.org/10.1007/s10115-022-01752-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-022-01752-y

Keywords

Search

Navigation