Skip to main content

Advertisement

SpringerLink
Log in

A two-phase ant colony optimization based approach for single depot multiple travelling salesman problem in Type-2 fuzzy environment

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

In this paper, a two-phase ant colony optimization (ACO) based approach has been presented to solve a single depot multiple travelling salesmen problem (mTSP) in Type-2 Gaussian fuzzy environment. In the single depot mTSP, a set of nodes and a set of salesmen are present, and each of the cities must be visited exactly once by the salesmen such that all of them start and finish at a depot. In this paper, a two-phase algorithm has been devised with ACO algorithm and some features of genetic algorithm (GA) to solve the projected problem. The devised algorithm is working appropriately with single depot mTSP. Here, in the first phase, the ACO algorithm is used for creating complete paths, and after that in the second phase, the GA features are used for optimizing the paths of multiple travellers. Moreover, the travelling cost is considered as Type-2 Gaussian fuzzy in nature and is reduced to its approximate crisp value using the reduction method of critical values. Some benchmark instances from TSPLIB have been used for performance analysis of the proposed algorithm. Computated results show that the devised algorithm is a competitive one for solving mTSP. Computational results with different datasets have been presented and some sensitivity analysis has also been done for fuzzy instances.

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

Similar content being viewed by others

References

  • Alinaghian M, Tirkolaee EB, Dezaki ZK, Hejazi SR, Ding W (2021) An augmented tabu search algorithm for the green inventory-routing problem with time windows. Swarm Evol Comput 60:100802

    Article  Google Scholar 

  • Angel RD, Caudle WL, Noonan R, Whinston A (1972) Computer-assisted school bus scheduling. Manag Sci 18(6):B-279-B-88

    Article  Google Scholar 

  • Ann S, Kim Y, Ahn J (2015) Area allocation algorithm for multiple UAVS area coverage based on clustering and graph method. IFAC Pap OnLine 48(9):204–209

    Article  Google Scholar 

  • Baltz A, Ouali M. El., Jager G, Sauerland V, Srivastav A (2015) Exact and heuristic algorithms for the travelling salesman problem with multiple time windows and hotel selection. J Oper Res Soc 66:615–626

    Article  Google Scholar 

  • Bektas T (2006) The multiple travelling salesman problem: an overview of formulations and solution procedures. Omega 34:209–219

    Article  Google Scholar 

  • Bock S (2020) Optimally solving a versatile Travelling salesman problem on tree networks with soft due dates and multiple congestion scenarios. Eur J Oper Res 283(3):863–882

    Article  MATH  Google Scholar 

  • Bock S, Klamroth K (2019) Combining traveling salesman and travelling repairman problems: A multi-objective approach based on multiple scenarios. Comput Oper Res 112:104766

    Article  MATH  Google Scholar 

  • Camci F (2014) The travelling maintainer problem: Integration of condition-based maintenance with the travelling salesman problem. J the Oper Res Soc 65:1423–1436

    Article  Google Scholar 

  • Changdar C, Mahapatra GS, Pal RK (2014) An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness. Swarm Evol Comput 15:27–37

    Article  Google Scholar 

  • Chentsov A, Khachay M, Khachay D (2016) Linear time algorithm for precedence constrained asymmetric generalized travelling salesman problem. IFAC Pap OnLine 49(12):651–655

    Article  Google Scholar 

  • Colorni A, Dorigo M, Maniezzo V, Trubian M (1994) Ant system for job-shop scheduling. Belg J Oper Res Stat Comput Sci 34:39–53

    MATH  Google Scholar 

  • Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. In: Proceedings of the first European conference on artificial life, Paris, France, pp 134–142

  • Das S, Ahmed N (2001) A travelling salesman problem (TSP) with multiple job facilties. OPSEARCH 38:394–406

    Article  MATH  Google Scholar 

  • Dorigo M, Gambardella LM (1997) Ant colonies for the travelling salesman problem. Bio Systems 43(2):73–81

    Article  Google Scholar 

  • Dorigo M, Gambardella LM (1997) Ant colony system: A cooperative learning approach to the travelling salesman problem. IEEE Trans on Evol Comput 1(1):53–66

    Article  Google Scholar 

  • Dorigo M, Maniezzo V, Colorni A (1996) Ant system: Optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26(1):29–41

    Article  Google Scholar 

  • Dubois D, Prade H (1979) Operations in a fuzzy-valued logic. Informat Contr 43(2):224–240

  • Engelbrech AP (2005) Fundamentals of computational swarm intelligence. Wiley, Hoboken

    Google Scholar 

  • Feng HM, Liao KL (2014) Hybrid evolutionary fuzzy learning scheme in the applications of travelling salesman problems. Inf Sci 27020:204–225

    Article  MATH  Google Scholar 

  • Gerhard R (1994) The travelling salesman: computational solutions for TSP applications. Lect Notes Comput Sci 840:1–223

    Google Scholar 

  • Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Boston

    MATH  Google Scholar 

  • Haq E, Hussain E (2019) Development a new crossover scheme for traveling salesman problem by aid of genetic algorithm. Int J Intell Syst Appl 12:46–52

    Google Scholar 

  • Haque TS, Chakraborty A, Mondal SP, Alam S (2020) Approach to solve multi-criteria group decision-making problems by exponential operational law in generalised spherical fuzzy environment. Trans Intell Technol 5(2):106–114

    Article  Google Scholar 

  • Hatamlou A (2017) Solving travelling salesman problem using heart algorithm. Int J Appl Evol Comput 8(4):32–42

    Article  Google Scholar 

  • Holland JH (1975) Adaptation in natural and artificial systems. MIT, Cambridge

    Google Scholar 

  • Hosseini R, Rezvanian A (2020) AntLP: Ant-based label propagation algorithm for community detection in social networks. CAAI Trans Intell Technol 5(1):34–41

    Article  Google Scholar 

  • Hurrion R (1980) Visual interactive (computer) solutions for the travelling salesman problem. J Oper Res Soc 31:537–539

    Article  MATH  Google Scholar 

  • Jiang C, Wan Z, Peng Z (2020) A new efficient hybrid algorithm for large scale multiple traveling salesman problems. Expert Syst Appl 139:112867

    Article  Google Scholar 

  • Kiraly A, Christidou M, Chovan T, Karlopoulos E, Abonyi J (2016) Minimization of off-grade production in multi-site multi-product plants by solving multiple travelling salesman problem. J Clean Product 111(Part A):253–261

    Article  Google Scholar 

  • Kundu P, Kar S, Maiti M (2014) Fixed charge transportation problem with type-2 fuzzy variables. Inf Sci 255:170–186

    Article  MATH  Google Scholar 

  • Larrañaga P, Kuijpers CMH, Murga RH, Inza I, Dizdarevic S (1999) Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif Intell Rev 13:129–170

    Article  Google Scholar 

  • Liu B (2002) Theory and practice of uncertain programming. Physica-Verlag, Heidelberg

    Book  MATH  Google Scholar 

  • Majid YK, Farzad D, Farhad R (2013) Modification of the ant colony optimization for solving the multiple travelling salesman problem. Roman J Inf Sci Technol 16(1):65–80

    Google Scholar 

  • Malmborg CJ (1996) A genetic algorithm for service level based vehicle scheduling. Eur J Oper Res 93(1):121–134

    Article  MATH  Google Scholar 

  • Markevich EA, Trushechkin AS (2019) Quantum branch-and-bound algorithm and its application to the travelling salesman problem. J Math Sci 241:168–184

    Article  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  • Miller DL, Pekny JF (1991) Exact solution of large asymmetric travelling salesman problems. Science 251:754–761

    Article  Google Scholar 

  • Murray CC, Raj R (2020) The multiple flying sidekicks travelling salesman problem: parcel delivery with multiple drones. Transp Res Part C Emerg Technol 110:368–398

    Article  Google Scholar 

  • Nguyen K-H, Ock C-Y (2013) Word sense disambiguation as a traveling salesman problem. Artif Intell Rev 40:405–427

    Article  Google Scholar 

  • Pereira AH, Urrutia S (2018) Formulations and algorithms for the pickup and delivery travelling salesman problem with multiple stacks. Comput Oper Res 93:1–14

    Article  MATH  Google Scholar 

  • Prakasam A, Savarimuthu N (2016) Metaheuristic algorithms and probabilistic behaviour: a comprehensive analysis of Ant Colony Optimization and its variants. Artif Intell Rev 45:97–130

    Article  Google Scholar 

  • Qin R, Liu YK, Liu ZQ (2011) Methods of critical value reduction for type-2 fuzzy variables and their applications. J Comput Appl Math 235:1454–1481

    Article  MATH  Google Scholar 

  • Shi Y, Boudouh T, Grunder O (2017) A hybrid genetic algorithm for a home health care routing problem with time window and fuzzy demand. Expert Syst Appl 7215:160–176

    Article  Google Scholar 

  • Srikakulapu R, Vinatha U (2018) Optimized design of collector topology for offshore wind farm based on ant colony optimization with multiple travelling salesman problem. J Mod Power Syst Clean Energy 6:1181–1192

    Article  Google Scholar 

  • Tang L, Liu J, Rong A, Yang Z (2000) A multiple travelling salesman problem model for hot rolling scheduling in Shanghai Baoshan iron & steel complex. Eur J Oper Res 124(2):267–282

    Article  MATH  Google Scholar 

  • Tsai PF (2006) Tight flow-based formulations for the asymmetric travelling salesman problem and their applications to some scheduling problems. PhD dissertation, Virginia Polytechnic Institute and State University. Blacksburg

  • Tirkolaee EB, Alinaghian M, Hosseinabadi AAR, Sasi MB, Sangaiah AK (2019) An improved ant colony optimization for the multi-trip capacitated arc routing problem. Comput Electr Eng 77:457–470

    Article  Google Scholar 

  • Trigui S, Cheikhrouhou O, Koubaa A, Baroudi U, Youssef H (2017) FL-MTSP: a fuzzy logic approach to solve the multi-objective multiple travelling salesman problem for multirobot systems. Soft Comput 21:7351–7362

  • Wang Y, Chen Y, Lin Y (2017) Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple travelling salesman problem. Comput Ind Eng 106:105–122

    Article  Google Scholar 

  • Xu X, Yuan H, Liptrott M, Trovati M (2018) Two phase heuristic algorithm for the multiple-travelling salesman problem. Soft Comput 22:6567–6581

    Article  Google Scholar 

  • Zadeh LA (1965) Fuzzy sets. Inf Control 8(3):338–353

    Article  MATH  Google Scholar 

  • Zimmermann HJ (1996) Fuzzy set theory and its applications, 4th edn. Van Nostrand Reinhold, New York

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Belda College, Belda, Paschim Medinipur, West Bengal, 721424, India

    Chiranjit Changdar

  2. Department of Computer Science and Engineering, Shri JJT University, Jhunjhunu, Rajasthan, 333010, India

    Moumita Mondal

  3. Department of Mathematics, Government General Degree College, Dantan-II, Kashmuli, Paschim Medinipur, West Bengal, 721445, India

    Pravash Kumar Giri

  4. Department of Computer Science, Vidyasagar University, Midnapore, West Bengal, 721102, India

    Utpal Nandi

  5. Department of Computer Science and Engineering, University of Calcutta, Kolkata, West Bengal, 700106, India

    Rajat Kumar Pal

Authors
  1. Chiranjit Changdar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Moumita Mondal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pravash Kumar Giri
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Utpal Nandi
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Rajat Kumar Pal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chiranjit Changdar.

Ethics declarations

Conflict of interest

The authors have no potential conflict of interest.

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

Changdar, C., Mondal, M., Giri, P.K. et al. A two-phase ant colony optimization based approach for single depot multiple travelling salesman problem in Type-2 fuzzy environment. Artif Intell Rev 56, 965–993 (2023). https://doi.org/10.1007/s10462-022-10190-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-022-10190-9

Keywords

Search

Navigation