Skip to main content

Advertisement

SpringerLink
Log in

The hybridization of ACO + GA and RVNS algorithm for solving the time-dependent traveling salesman problem

  • Research Paper
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

The time-dependent traveling salesman problem is a class of combinatorial optimization problems. Naturally, metaheuristic is a suitable approach to solve the problem with large sizes in short computation time. Previously, several metaheuristics have been proposed for solving the problem. These algorithms might have a strong search intensification, and their diversification mechanisms may not be sufficient. Due to the random nature, population-based algorithms improve on the chance of finding a globally. In this paper, we propose a population-based algorithm that combines an ant colony algorithm (ACO), genetic algorithm (GA), and neighborhood descent with random neighborhood ordering (RVND). In the algorithm, the ACO and GA are used to explore the promising solution areas that are yet to refined while the RVND exploits them with the hope of improving a solution. Therefore, our metaheuristic algorithm balances between exploration and exploitation. Extensive numerical experiments and comparisons with the state-of-the-art metaheuristic algorithms in the literature show that the proposed algorithm reaches better solutions in many cases.

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

Similar content being viewed by others

References

  1. Abeledo HG, Fukasawa G, Pessoa R, Uchoa A (2013) The time dependent traveling salesman problem: Polyhedra and branch-cut-and price algorithm. J Math Program Comput 5(1):27–55

    Article  Google Scholar 

  2. Ban HB (2019) An efficiency two-phase metaheuristic algorithm for the time dependent traveling salesman problem. J RAIRO 53(3):917–935

    Article  Google Scholar 

  3. Ban HB, Nguyen DN (2017) A meta-heuristic algorithm combining between Tabu and variable neighborhood search for the minimum latency problem. J Fund Inf 156(1):21–41

    MathSciNet  MATH  Google Scholar 

  4. Ban HB, Nguyen DN (2014) A parallel algorithm combines genetic algorithm and ant colony algorithm for the minimum latency problem. In: Proceedings of the SOICT, pp 39–48

  5. Benhala B, Ahaitouf A (2014) GA and ACO in hybrid approach for analog circuit performance optimization. In: Proceedings of the ICMCS, pp 1–6

  6. Balakrishnan N, Lucena A, Wong RT (1992) Scheduling examinations to reduce second-order conflicts. Comput Oper Res 19:353–361

    Article  Google Scholar 

  7. Bigras L, Gamache M, Savard G (2008) The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup time. J Discrete Optim 5:685–699

    Article  MathSciNet  Google Scholar 

  8. Dong G, Guo WW (2010) A cooperative ant colony system and genetic algorithm for TSPs. In: Proceedings of the ICSI, LNCS, pp 597–604

  9. Dongarra JJ (2013) Performance of various computers using standard linear equations software. Linpack Benchmark Report, University of Tennessee Computer Science Technical Report, CS-89-85

  10. Dorigo M, Stutzle T (2004) Ant colony optimization. Bradford Books, London

    Book  Google Scholar 

  11. Duan H, Yu X (2007) Hybrid ant colony optimization using memetic algorithm for traveling salesman problem. In: Proceedings of the ADPRL, pp 92–95

  12. Figliozzi MA (2012) The time dependent vehicle routing problem with time windows: benchmark problems, an efficient solution algorithm, and solution characteristics. J Transp Res Part E Log Transp Rev 48(3):616–636

    Article  Google Scholar 

  13. Fox K (1973) Production scheduling on parallel lines with dependencies. PhD thesis. Johns Hopkins University, Baltimore

  14. Fox K, Gavish B, Graves S (1979) The time dependent traveling salesman problem and extensions. Working paper no. 7904, Graduate School of Management, University of Rochester

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

    MATH  Google Scholar 

  16. Gouveia L, Vo S (1995) A classification of formulations for the (time-dependent) traveling salesman problem. J Eur Oper Res 83(1):69–82

    Article  Google Scholar 

  17. Hasegawa H (2004) Optimization of GROUP behavior. Jpn Ethol Soc Newsl 43:22–23

    Google Scholar 

  18. Holland JH (1995) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  19. Hashimoto H, Yagiura M, Ibaraki T (2008) An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. J Discrete Optim 5(2):434–456

    Article  MathSciNet  Google Scholar 

  20. http://www.iwr.uniheidelberg.de/groups/comopt/software/TSPLIB95

  21. http://liris.cnrs.fr/christine.solnon/TDTSP.html

  22. Johnson DS, McGeoch LA (2020) The traveling salesman problem: a case study in local optimization. In: Aarts E, Lenstra JK (eds) Local search in combinatorial optimization. Springer, Berlin, pp 215–310

    Google Scholar 

  23. Li F, Golden B, Wasil E (2005) Solving the time dependent traveling salesman problem. In: The next wave in computing, optimization, and decision technologies. Springer, Berlin, pp 163–182

  24. Lucena A (1990) Time-dependent traveling salesman problem—the deliveryman case. J Netw 20(6):753–763

    Article  MathSciNet  Google Scholar 

  25. Malandraki C, Daskin M (1992) Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. J Transp Sci 26(3):185–200

    Article  Google Scholar 

  26. Mladenovic N, Hansen P (1997) Variable neighborhood search. J Oper Res 24(11–24):1097–1100

    MathSciNet  MATH  Google Scholar 

  27. Mladenovic N, Urosevi D, Hanafi S (2012) Variable neighborhood search for the travelling deliveryman problem. J 4OR 11:1–17

    MathSciNet  Google Scholar 

  28. Osaba E, Onieva E, Carballedo R, Diaz F, Perallos A (2013) An adaptive multi-crossover population algorithm for solving routing problems. In: Proceedings of the NICSO, studies in computational intelligence, vol 512, pp 113–125

  29. Otman A, Jaafar A (2011) A comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem. J Comput Appl 31(11):49–57

    Google Scholar 

  30. Picard JC, Queyranne M (1978) The time-dependent traveling salesman problem and its application to the tardiness problem in one machine scheduling. J Oper Rese 26:86–110

    Article  MathSciNet  Google Scholar 

  31. RazaliJohn NM, Geraghty GJ (2011) Genetic algorithm performance with different selection strategies in solving TSP. In: Conference ICCIIS’11, pp 1134–1139

  32. Ruland K (1995) Polyhedral solution to the pickup and delivery problem. PhD thesis, Washington University, Saint Louis

  33. Shang G, Xinzi J, Kezong T (2007) Hybrid algorithm combining ant colony optimization algorithm with genetic algorithm. In: Proceedings of the Chinese control, pp 701–704

  34. Salehipour A, Sorensen K, Goos P, Braysy O (2011) Efficient GRASP+VND and GRASP+VNS meta-heuristics for the traveling repairman problem. J Oper Res 9(2):189–209

    Article  Google Scholar 

  35. Simchi-Levi D, Berman O (1991) Minimizing the total flow time of n jobs on a network. IEEE Trans 23:236–244

    Article  Google Scholar 

  36. Soylu E, Uysal A (2017) A hybrid genetic-ant colony algorithm for travelling salesman problem. J IJESA 1(3):85–90

    Google Scholar 

  37. Testa L, Esterline A, Dozier G (1999) Evolving efficient theme park tours. J CIT 7(1):77–92

    Google Scholar 

  38. Vander Wiel RJ, Sahinidis NV (1995) Heuristics bounds and test problem generation for the time-dependent traveling salesman problem. J Transp Sci 29:167–183

    Article  Google Scholar 

  39. Wiel RV, Sahinidis N (1996) An exact solution approach for the time-dependent traveling salesman problem. J NRL 43:797–820

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This research is funded by Hanoi University of Science and Technology (HUST) under Grant No. T2020-PC-008.

Author information

Authors and Affiliations

  1. School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam

    Ha-Bang Ban

Authors
  1. Ha-Bang Ban
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ha-Bang Ban.

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

Ban, HB. The hybridization of ACO + GA and RVNS algorithm for solving the time-dependent traveling salesman problem. Evol. Intel. 15, 309–328 (2022). https://doi.org/10.1007/s12065-020-00510-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-020-00510-9

Keywords

Search

Navigation