Evolutionary algorithms for solving multi-objective travelling salesman problem

Flexible Services and Manufacturing Journal

Volumn 23, Issue 2, 2011, Pages 207-241

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

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Estimation of distribution algorithm; Evolutionary multi objective optimization; Probabilistic model; Restricted Boltzmann machine; Travelling salesman problem

Indexed keywords

ESTIMATION OF DISTRIBUTION ALGORITHMS; EVOLUTIONARY MULTIOBJECTIVE OPTIMIZATION; PROBABILISTIC MODELS; RESTRICTED BOLTZMANN MACHINE; TRAVELLING SALESMAN PROBLEM;

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; MATHEMATICAL OPERATORS; MULTIOBJECTIVE OPTIMIZATION;

TRAVELING SALESMAN PROBLEM;

EID: 79960559355     PISSN: 19366582     EISSN: 19366590     Source Type: Journal    
DOI: 10.1007/s10696-011-9099-y     Document Type: Article

References (71)

1. EHL Aarts JHM Korst 1989 Boltzmann machines for travelling salesman problems Eur J Oper Res 39 1 79 95 988024 0669.90079 10.1016/0377-2217(89)90355- X
2. I Arel DC Rose TP Karnowski 2010 Deep machine learning-a new frontier in artificial intelligence research IEEE Comput Intell Mag 5 4 13 18 10.1109/MCI.2010.938364
3. TP Bagchi JND Gupta C Sriskandarajah 2006 A review of TSP based approaches for flowshop scheduling Eur J Oper Res 169 3 816 854 2173995 1079.90048 10.1016/j.ejor.2004.06.040 (Pubitemid 41492018)
4. Baluja S (1994) Population-based incremental learning. A method for integrating genetic search based function optimization and competitive learning. Technical Report: CS-94-163
5. J Blazewicz M Kasprzak W Kuroczycki 2002 Hybrid genetic algorithm for DNA sequencing with errors J Heuristics 8 5 495 502 1002.68594 10.1023/A: 1016589707123 (Pubitemid 34950323)
6. PAN Bosman D Thierens 2002 Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithms Int J Approx Reason 31 3 259 289 1950896 1056.68114 10.1016/S0888-613X(02)00090-7 (Pubitemid 35411833)
7. S Chen M Chen P Zhang Q Zhang Y Chen 2010 Guidelines for developing effective estimation of distribution algorithms in solving single machine scheduling problems Expert Syst Appl 37 9 6441 6451 10.1016/j.eswa.2010.02.073
8. CY Cheong KC Tan DK Liu CJ Lin 2010 Multi-objective and prioritized berth allocation in container ports Ann Oper Res 180 1 63 103 2728284 1202.90130 10.1007/s10479-008-0493-0
9. CA Coello Coello 2006 Evolutionary multi-objective optimization: a historical view of the field IEEE Comput Intell Mag 1 1 28 36 2242406 10.1109/MCI.2006.1597059
10. 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
11. G Da San Martino A Sperduti 2010 Mining structured data IEEE Comput Intell Mag 5 1 42 49 10.1109/MCI.2009.935308
12. Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, Chichester
13. K Deb A Pratap S Agarwal T Meyarivan 2002 A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE T Evolut Comput 6 2 182 197 10.1109/4235.996017 (Pubitemid 34555372)
14. M Diaby 2007 The traveling salesman problem: a linear programming formulation T Math 6 6 745 754 2331158 1168.90580 (Pubitemid 47023965)
15. HA Eiselt G Laporte 1991 A combinatorial optimization problem arising in dartboard design J Oper Res Soc 42 2 113 118
16. S Elaoud J Teghem T Loukil 2010 Multiple crossover genetic algorithm for the multi-objective traveling salesman problem Electron Notes Discrete Math 36 939 946 10.1016/j.endm.2010.05.119
17. 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 (Pubitemid 39210702)
18. CK Goh KC Tan 2009 A competitive-cooperative coevolutionary paradigm for dynamic multiobjective optimization IEEE T Evolut Comput 13 1 103 127 10.1109/TEVC.2008.920671
19. Gonzales C (2005) Contributions on theoretical aspects of estimation of distribution algorithms. Dissertation, University of the Basque Country
20. F Herrera C Garcia-Martinez O Cordon 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 (Pubitemid 46123845)
21. GE Hinton 2002 Training products of experts by minimizing contrastive divergence Neural Comput 14 8 1771 1800 1010.68111 10.1162/089976602760128018
22. 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
23. 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
24. B Jarboui M Eddaly P Siarry 2009 An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Comput Oper Res 36 9 2638 2646 2586529 1179.90138 10.1016/j.cor.2008.11.004
25. G Laporte 1992 The traveling salesman problem: an overview of exact and approximate algorithms Eur J Oper Res 59 2 231 247 0760.90089 10.1016/0377-2217(92)90138-Y (Pubitemid 23565197)
26. Larrañaga P, Lozano JA (2001) Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer, Norwell
27. Laumanns M, Ocenasek J (2002) Bayesian optimization algorithms for multi-objective optimization. Parallel Problem Solving from Nature seventh International Conference pp 298-307
28. M Li Z Yi M Zhu 2009 Solving TSP by using Lotka-Volterra neural networks Neurocomputing 72 16-18 3873 3880 10.1016/j.neucom.2009.05.002
29. 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
30. 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
31. C Malandraki RB Dial 1996 A restricted dynamic programming heuristic algorithm for time dependent traveling salesman problem Eur J Oper Res 90 1 45 55 0916.90262 10.1016/0377-2217(94)00299-1 (Pubitemid 126392350)
32. 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
33. 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
34. BL Miller DE Goldberg 1996 Genetic algorithms, selection schemes, and the varying effects of noise Evol Comput 4 2 113 131 10.1162/evco.1996.4.2.113 (Pubitemid 126706153)
35. H Muhlenbein 1998 The equation for response to selection and its use for prediction Evol Comput 5 3 303 346 10.1162/evco.1997.5.3.303
36. 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 (Pubitemid 126128306)
37. F Neri E Mininno 2010 Memetic compact differential evolution for cartesian robot control IEEE Comput Intell Mag 5 2 54 65 10.1109/MCI.2010.936305
38. 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
39. YS Ong M Lim XS Chen 2010 Memetic computation-past, present and future IEEE Comput Intell Mag 5 2 24 31 10.1109/MCI.2010.936309
40. M Padberg G Rinaldi 1988 Branch-and-cut approach to a variant of the traveling salesman problem J Guid Control Dynam 11 5 436 440 969959 0661.90091 10.2514/3.20336
41. M Pelikan DE Goldberg FG Lobo 2002 A survey of optimization by building and using probabilistic models Comput Optim Appl 21 1 5 20 1883087 0988.90052 10.1023/A:1013500812258 (Pubitemid 34172679)
42. Pelikan M, Sastry K, Goldberg DE (2005) Multi-objective hBOA, clustering, and scalability. In: Conference on genetic and evolutionary computation, pp 663-670
43. Pelikan M, Sastry K, Goldberg DE (2006) Multiobjective estimation of distribution algorithm. Scalable optimization via probabilistic modeling 33 Springer pp 223-248
44. W Peng Q Zhang H Li 2009 Comparison between MOEA/D and NSGAII on the multi-objective travelling salesman problem Stud Comput Intell 171 309 324 10.1007/978-3-540-88051-6-14
45. G Reinelt 1989 Fast heuristics for large geometric traveling salesman problems ORSA J Comput 4 2 206 217 1003556
46. Salakhutdinov R, Mnih A, Hinton G (2007) Restricted Boltzmann machines for collaborative filtering. In: ACM international conference proceeding series, pp 791-798
47. 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 (Pubitemid 47291580)
48. 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 (Pubitemid 41496125)
49. Shi L, Li Z (2009) An improved pareto genetic algorithm for multi-objective TSP. International conference on natural computation, pp 585-588
50. SY Shin IH Lee BT Zhang 2005 Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing IEEE T Evol Comput 9 2 143 158 10.1109/TEVC.2005.844166 (Pubitemid 40573248)
51. 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
52. KC Tan CY Cheong CK Goh 2007 Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation Eur J Oper Res 177 2 813 839 1110.90015 10.1016/j.ejor.2005.12.029
53. 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
54. 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
55. CK Ting WM Zeng TC Lin 2010 Linkage discovery through data mining IEEE Comput Intell Mag 5 1 10 13 10.1109/MCI.2009.935310
56. Velhuizen DA, Lamont GB (1998) Evolutionary computation and convergence to a Pareto front. Late breaking papers at the genetic programming conference, pp 221-228
57. 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 (Pubitemid 44017879)
58. MA Wellman DD Gemmill 1995 A genetic algorithm approach to optimization of asynchronous automatic assembly systems Int J Flex Manuf Syst 7 1 27 46 10.1007/BF01324878
59. Y Wu X Zhou 2008 Meliorative Tabu search algorithm for TSP problem J Comput Eng Appl 44 1 57 59
60. JB Wu SW Xiong N Xu 2007 Simulated annealing algorithm based on controllable temperature for solving TSP Appl Res Comput 24 5 66 89
61. 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
62. 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
63. 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
64. 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
65. 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
66. Q Zhang A Zhou Y Jin 2008 RM-MEDA: a regularity model-based multiobjective estimation of distribution algorithm IEEE T Evol Comput 12 1 41 63 10.1109/TEVC.2007.894202 (Pubitemid 351330331)
67. 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
68. G Zhou L Jia 2008 A novel evolutionary algorithm for bi-objective symmetric traveling salesman problem J Comput Inf Syst 4 5 2051 2056
69. ZX Zhu S Jia Z Ji 2010 Towards a memetic feature selection paradigm IEEE Comput Intell Mag 5 2 41 53 10.1109/MCI.2010.936311
70. Zitzler E (1999) Evolutionary algorithms for multi-objective optimization: methods and applications. Dissertation, Swiss Federal Institute of Technology, Zurich
71. E Zitzler K Deb L Thiele 2000 Comparison of multi-objective algorithms: empirical results Evol Comput 18 2 173 195 10.1162/106365600568202