Skip to main content

Advertisement

SpringerLink
Log in

Evolutionary algorithms for solving multi-objective travelling salesman problem

  • Published:
Flexible Services and Manufacturing Journal Aims and scope Submit manuscript

Abstract

This paper studies the application of evolutionary algorithms for bi-objective travelling salesman problem. Two evolutionary algorithms, including estimation of distribution algorithm (EDA) and genetic algorithm (GA), are considered. The solution to this problem is a set of trade-off alternatives. The problem is solved by optimizing the order of the cities so as to simultaneously minimize the two objectives of travelling distance and travelling cost incurred by the travelling salesman. In this paper, binary-representation-based evolutionary algorithms are replaced with an integer-representation. Three existing EDAs are altered to use this integer-representation, namely restricted Boltzmann machine (RBM), univariate marginal distribution algorithm (UMDA), and population-based incremental learning (PBIL). Each city is associated with a representative integer, and the probability of any of this representative integer to be located in any position of the chromosome is constructed through the modeling approach of the EDAs. New sequences of cities are obtained by sampling from the probabilistic model. A refinement operator and a local search operator are proposed in this piece of work. The EDAs are subsequently hybridized with GA in order to complement the limitations of both algorithms. The effect that each of these operators has on the quality of the solutions are investigated. Empirical results show that the hybrid algorithms are capable of finding a set of good trade-off solutions.

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

Similar content being viewed by others

References

  • Aarts EHL, Korst JHM (1989) Boltzmann machines for travelling salesman problems. Eur J Oper Res 39(1):79–95

    Article  MathSciNet  MATH  Google Scholar 

  • Arel I, Rose DC, Karnowski TP (2010) Deep machine learning–a new frontier in artificial intelligence research. IEEE Comput Intell Mag 5(4):13–18

    Article  Google Scholar 

  • Bagchi TP, Gupta JND, Sriskandarajah C (2006) A review of TSP based approaches for flowshop scheduling. Eur J Oper Res 169(3):816–854

    Article  MathSciNet  MATH  Google Scholar 

  • Baluja S (1994) Population-based incremental learning. A method for integrating genetic search based function optimization and competitive learning. Technical Report: CS-94-163

  • Blazewicz J, Kasprzak M, Kuroczycki W (2002) Hybrid genetic algorithm for DNA sequencing with errors. J Heuristics 8(5):495–502

    Article  MATH  Google Scholar 

  • Bosman PAN, Thierens D (2002) Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithms. Int J Approx Reason 31(3):259–289

    Article  MathSciNet  MATH  Google Scholar 

  • Chen S, Chen M, Zhang P, Zhang Q, Chen Y (2010) Guidelines for developing effective estimation of distribution algorithms in solving single machine scheduling problems. Expert Syst Appl 37(9):6441–6451

    Article  Google Scholar 

  • Cheong CY, Tan KC, Liu DK, Lin CJ (2010) Multi-objective and prioritized berth allocation in container ports. Ann Oper Res 180(1):63–103

    Article  MathSciNet  MATH  Google Scholar 

  • Coello Coello CA (2006) Evolutionary multi-objective optimization: a historical view of the field. IEEE Comput Intell Mag 1(1):28–36

    Article  MathSciNet  Google Scholar 

  • Costa M, Minisci E (2003) MOPED: a multi-objective Parzen-based estimation of distribution algorithm for continuous problems. In: Second international conference evolutionary multi-criterion optimization, pp 282–294

  • Da San Martino G, Sperduti A (2010) Mining structured data. IEEE Comput Intell Mag 5(1):42–49

    Article  Google Scholar 

  • Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, Chichester

    MATH  Google Scholar 

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

    Article  Google Scholar 

  • Diaby M (2007) The traveling salesman problem: a linear programming formulation. T Math 6(6):745–754

    MathSciNet  MATH  Google Scholar 

  • Eiselt HA, Laporte G (1991) A combinatorial optimization problem arising in dartboard design. J Oper Res Soc 42(2):113–118

    Google Scholar 

  • Elaoud S, Teghem J, Loukil T (2010) Multiple crossover genetic algorithm for the multi-objective traveling salesman problem. Electron Notes Discrete Math 36:939–946

    Article  Google Scholar 

  • García-Martínez C, Cordón O, Herrera F (2004) An empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics), pp 61–72

  • Goh CK, Tan KC (2009) A competitive-cooperative coevolutionary paradigm for dynamic multiobjective optimization. IEEE T Evolut Comput 13(1):103–127

    Article  Google Scholar 

  • Gonzales C (2005) Contributions on theoretical aspects of estimation of distribution algorithms. Dissertation, University of the Basque Country

  • Herrera F, Garcia-Martinez C, Cordon O (2007) A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. Eur J Oper Res 80(1):116–148

    Google Scholar 

  • Hinton GE (2002) Training products of experts by minimizing contrastive divergence. Neural Comput 14(8):1771–1800

    Article  MATH  Google Scholar 

  • Hinton GE (2005) What kind of a graphical model is the brain? In: Proceedings of the 19th international joint conference on artificial intelligence pp 1765–1775

  • Jahne M, Li X, Branke J (2009) Evolutionary algorithms and multi-objectivization for the travelling salesman problem. In: Proceedings of the 11th annual genetic and evolutionary computation conference, pp 595–602

  • Jarboui B, Eddaly M, Siarry P (2009) An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput Oper Res 36(9):2638–2646

    Article  MathSciNet  MATH  Google Scholar 

  • Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):231–247

    Article  MATH  Google Scholar 

  • Larrañaga P, Lozano JA (2001) Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer, Norwell

    Google Scholar 

  • Laumanns M, Ocenasek J (2002) Bayesian optimization algorithms for multi-objective optimization. Parallel Problem Solving from Nature seventh International Conference pp 298–307

  • Li M, Yi Z, Zhu M (2009) Solving TSP by using Lotka-Volterra neural networks. Neurocomputing 72(16–18):3873–3880

    Article  Google Scholar 

  • Lin L (2009) Maximum entropy estimation of distribution algorithm for jssp under uncertain information based on rough programming. International workshop on intelligent systems and application, pp 1–4

  • Lozano JA, Larraga P, Bengoetxea E (2006) Towards a new evolutionary computation: advances on estimation of distribution algorithms (Studies in Fuzziness and Soft Computing). Springer, New York

    MATH  Google Scholar 

  • Malandraki C, Dial RB (1996) A restricted dynamic programming heuristic algorithm for time dependent traveling salesman problem. Eur J Oper Res 90(1):45–55

    Article  MATH  Google Scholar 

  • Manuel L, Thomas S (2010) The impact of design choices of multiobjective antcolony optimization algorithms on performance: an experimental study on the biobjective TSP. In: Proceedings of the 12th annual conference on genetic and evolutionary computation, pp 71–78

  • Marti L, Garcia J, Berlanga A et al (2009) On the model-building issue of multi-objective estimation of distribution algorithms. In: Proceedings of the fourth international conference on hybrid artificial intelligence systems, pp 293–300

  • Miller BL, Goldberg DE (1996) Genetic algorithms, selection schemes, and the varying effects of noise. Evol Comput 4(2):113–131

    Article  Google Scholar 

  • Muhlenbein H (1998) The equation for response to selection and its use for prediction. Evol Comput 5(3):303–346

    Article  Google Scholar 

  • Muhlenbein H, Paass G (1996) From recombination of genes to the estimation of distributions I. binary parameters. In: Proceedings of the fourth international conference on parallel problem solving from nature, pp 178–187

  • Neri F, Mininno E (2010) Memetic compact differential evolution for cartesian robot control. IEEE Comput Intell Mag 5(2):54–65

    Article  Google Scholar 

  • Okabe T, Jin Y, et al (2004) Voronoi-based estimation of distribution algorithm for multi-objective optimization. In: IEEE congress on evolutionary computation, pp 1594–1601

  • Ong YS, Lim M, Chen XS (2010) Memetic computation–past, present and future. IEEE Comput Intell Mag 5(2):24–31

    Article  Google Scholar 

  • Padberg M, Rinaldi G (1988) Branch-and-cut approach to a variant of the traveling salesman problem. J Guid Control Dynam 11(5):436–440

    Article  MathSciNet  MATH  Google Scholar 

  • Pelikan M, Goldberg DE, Lobo FG (2002) A survey of optimization by building and using probabilistic models. Comput Optim Appl 21(1):5–20

    Article  MathSciNet  MATH  Google Scholar 

  • Pelikan M, Sastry K, Goldberg DE (2005) Multi-objective hBOA, clustering, and scalability. In: Conference on genetic and evolutionary computation, pp 663–670

  • Pelikan M, Sastry K, Goldberg DE (2006) Multiobjective estimation of distribution algorithm. Scalable optimization via probabilistic modeling 33 Springer pp 223–248

  • Peng W, Zhang Q, Li H (2009) Comparison between MOEA/D and NSGAII on the multi-objective travelling salesman problem. Stud Comput Intell 171:309–324

    Article  Google Scholar 

  • Reinelt G (1989) Fast heuristics for large geometric traveling salesman problems. ORSA J Comput 4(2):206–217

    MathSciNet  Google Scholar 

  • Salakhutdinov R, Mnih A, Hinton G (2007) Restricted Boltzmann machines for collaborative filtering. In: ACM international conference proceeding series, pp 791–798

  • Salhi A, Rodriguez JAV, Zhang Q (2007) An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem. Genetic and evolutionary computation conference, pp 570–576

  • Sastry K, Goldberg DE, Pelikan M (2005) Limits of scalability of multiobjective estimation of distribution algorithms. In: IEEE Congress on evolutionary computation, pp 2217–2224

  • Shi L, Li Z (2009) An improved pareto genetic algorithm for multi-objective TSP. International conference on natural computation, pp 585–588

  • Shin SY, Lee IH, Zhang BT (2005) Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing. IEEE T Evol Comput 9(2):143–158

    Article  Google Scholar 

  • Shim VA, Tan KC, Chia JY (2010) An investigation on sampling technique for multi-objective restricted boltzmann machine. IEEE congress on evolutionary computation, pp 1081–1088

  • Tan KC, Cheong CY, Goh CK (2007) Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. Eur J Oper Res 177(2):813–839

    Article  MATH  Google Scholar 

  • Tang HJ, Shim VA, Tan KC, Chia JY (2010) Restricted Boltzmann machine based algorithm for multi-objective optimization. IEEE congress on evolutionary computation, pp 3958–3965

  • Tieleman T (2008) Training restricted Boltzmann machines using approximations to the likelihood gradient. In: Proceedings of the 25th international conference on machine learning, pp 1064–1071

  • Ting CK, Zeng WM, Lin TC (2010) Linkage discovery through data mining. IEEE Comput Intell Mag 5(1):10–13

    Article  Google Scholar 

  • Velhuizen DA, Lamont GB (1998) Evolutionary computation and convergence to a Pareto front. Late breaking papers at the genetic programming conference, pp 221–228

  • Villalobos-Arias MA, Pulido GT, Coello Coello CA (2005) A proposal to use stripes to maintain diversity in a multi-objective particle swarm optimizer. IEEE swarm intelligence symposium, pp 23–30

  • Wellman MA, Gemmill DD (1995) A genetic algorithm approach to optimization of asynchronous automatic assembly systems. Int J Flex Manuf Syst 7(1):27–46

    Article  Google Scholar 

  • Wu Y, Zhou X (2008) Meliorative Tabu search algorithm for TSP problem. J Comput Eng Appl 44(1):57–59

    Google Scholar 

  • Wu JB, Xiong SW, Xu N (2007) Simulated annealing algorithm based on controllable temperature for solving TSP. Appl Res Comput 24(5):66–89

    Google Scholar 

  • Xu C, Xu J, Chang H (2009) Ant colony optimization based on estimation of distribution for the traveling salesman problem. Fifth international conference on natural computation, pp 19–23

  • Yan XS, Liu HM, Yan J, et al (2007) A fast evolutionary algorithm for traveling salesman problem. Third international conference on natural computation, pp 85–90

  • Yang M, Kang L, Guan J (2007) An evolutionary algorithm for dynamic multi-objective TSP. In: Proceedings of the second international conference on advances in computation and intelligence, pp 62–71

  • Yang JQ, Yang JG, Chen GL (2009) Solving large scale TSP using adaptive clustering method. Second international symposium on computational intelligence and design, pp 44–51

  • Yugay O, Kim I, Kim B, et al (2008) Hybrid genetic algorithm for solving traveling salesman problem with sorted population. Third international conference on convergence and hybrid information technology, pp 1024–1028

  • Zhang Q, Zhou A, Jin Y (2008) RM-MEDA: a regularity model-based multiobjective estimation of distribution algorithm. IEEE T Evol Comput 12(1):41–63

    Article  Google Scholar 

  • Zhong X, Li W (2007) A decision-tree-based multi-objective estimation of distribution algorithm. International conference on computational intelligence and security, pp 114–118

  • Zhou G, Jia L (2008) A novel evolutionary algorithm for bi-objective symmetric traveling salesman problem. J Comput Inf Syst 4(5):2051–2056

    Google Scholar 

  • Zhu ZX, Jia S, Ji Z (2010) Towards a memetic feature selection paradigm. IEEE Comput Intell Mag 5(2):41–53

    Article  Google Scholar 

  • Zitzler E (1999) Evolutionary algorithms for multi-objective optimization: methods and applications. Dissertation, Swiss Federal Institute of Technology, Zurich

  • Zitzler E, Deb K, Thiele L (2000) Comparison of multi-objective algorithms: empirical results. Evol Comput 18(2):173–195

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, 117576, Singapore, Singapore

    Vui Ann Shim, Kay Chen Tan, Jun Yong Chia & Jin Kiat Chong

Authors
  1. Vui Ann Shim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kay Chen Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jun Yong Chia
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jin Kiat Chong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vui Ann Shim.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shim, V.A., Tan, K.C., Chia, J.Y. et al. Evolutionary algorithms for solving multi-objective travelling salesman problem. Flex Serv Manuf J 23, 207–241 (2011). https://doi.org/10.1007/s10696-011-9099-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10696-011-9099-y

Keywords

Search

Navigation