Best-order crossover for permutation-based evolutionary algorithms

Applied Intelligence

Volumn 42, Issue 4, 2015, Pages 751-776

  Andreica, Anca ^a   Chira, Camelia ^b  

^a BABE BOLYAI UNIVERSITY   (Romania)

^b TECHNICAL UNIVERSITY OF CLUJ NAPOCA   (Romania)

Author keywords

Crossover; Evolutionary algorithms; Resource constrained project scheduling problem; Travelling salesman problem; Vehicle routing problem

Indexed keywords

BENCHMARKING; COMBINATORIAL OPTIMIZATION; CONSTRAINED OPTIMIZATION; ENCODING (SYMBOLS); EVOLUTIONARY ALGORITHMS; GENES; NETWORK ROUTING; ROUTING ALGORITHMS; SCHEDULING;

COMBINATORIAL OPTIMIZATION PROBLEMS; CROSSOVER; PERMUTATION REPRESENTATION; PERMUTATION-BASED EVOLUTIONARY ALGORITHM; RECOMBINATION OPERATORS; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; TRAVELLING SALESMAN PROBLEM; VEHICLE ROUTING PROBLEMS;

TRAVELING SALESMAN PROBLEM;

EID: 84939979710     PISSN: 0924669X     EISSN: 15737497     Source Type: Journal    
DOI: 10.1007/s10489-014-0623-0     Document Type: Article

References (64)

1. Alba Torres E, Khuri S (2004) Applying Evolutionary Algorithms to Combinatorial Optimization Problems, ICCS 2001, LNCS 2074. Springer Verlag, Berlin Heidelberg, pp 689–698
2. Andreica A, Chira C (2014) Best-Order Crossover in an Evolutionary Approach to Multi-Mode Resource-Constrained Project Scheduling. International Journal of Computer Information Systems and Industrial Management (IJCISIM) 6:364–372
3. Augerat P, Belenguer JM, Benavent E, Corbern A, Naddef D, Rinaldi G (1995) Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem, Research Report 949-M, Universite Joseph Fourier, Grenoble, France
4. Back T, Fogel DB, Michalewicz Z (1997) Handbook of Evolutionary Computation (1st ed.) IOP Publ. Ltd., Bristol
5. Bierwirth C, Mattfeld DC, Kopfer H (1996) On Permutation Representations for Scheduling Problems. PPSN 1996:310–318
6. Blazewicz J, Lenstra J, Rinnooy Kan A (1983) Scheduling subject to resource constraints: Classification and complexity. Discret Appl Math 5:11–24
7. Blum C, Roli A (2003) Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Comput Surv 35:268–308
8. Blum C, Roli A, Sampels M (2008) Hybrid Metaheuristics - An Emerging Approach to Optimization, Studies in Computational Intelligence, Vol 114. Springer
9. Boettcher S, Percus AG (2001) Optimization with Extremal Dynamics. Phys Rev Lett 86:5211–5214
10. Cerny V (1985) Thermodynamical approach to the Traveling salesman problem: An efficient simulation algorithm. J Optim Theory Appl 45:41–51
11. Chira C, Gog A (2012) Recombination operators in permutation-based evolutionary algorithms for the travelling salesman problem, Chapter 10 in Logistics Management and Optimization through Hybrid Artificial Intelligence Systems. IGI Global:268–285
12. Chira C, Sedano J, Villar JR, Camara M, Corchado E (2014) Urban bicycles renting systems: Modelling and optimization using nature-inspired search methods. Neurocomputing 135:98–106
13. Darwin C (1859) On the Origin of Species by Means of Natural Selection, or the Preservation of Favoured Races in the Struggle for Life. John Murray, London. modern reprint Charles Darwin, Julian Huxley, The Origin of Species. Signet Classics (2003)
14. Davis L (1985) Applying Adaptive Algorithms to Epistatic Domains, IJCAI. Morgan Kaufmann:162–164
15. Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B 26(1):29–41
16. Eiben AE (2001) Evolutionary Algorithms and Constraint Satisfaction: Definitions, Survey, Methodology, and Research Directions. In: Kallel L, Naudts B, Rogers A (eds) Theoretical Aspects of Evolutionary Computing, Natural Computing Series, pp 13–30. Springer, Berlin Heidelberg
17. Elsayed SM, Sarker RA, Essam DL (2014) A new genetic algorithm for solving optimization problems. Eng Appl AI 27:57–69
18. Fogel L (1962) Autonomous automata. Ind Res 4:14–19
19. Fogel L, Owens A, Walsh M (1966) Artificial Intelligence through Simulated Evolution. John Wiley, New York
20. Fogel D (1998) Evolutionary Computation: the Fossil Record. IEEE Press, New York
21. Gen M, Cheng R (2000) Genetic Algorithms and Engineering Optimization. John Wiley
22. Glover F (1986) Future Paths for Integer Programming and Links to Artificial Intelligence. Comput Oper Res 13(5):533–549
23. Glover F (1989) Tabu Search – Part 1. ORSA J Comput 1(2):190–206
24. Glover F (1990) Tabu Search – Part 2. ORSA J Comput 2(1):4–32
25. Goldberg DE, Lingle R (1985) Alleles, loci, and the traveling salesman problem, Proceedings of an International Conference on Genetic Algorithms and Their Applications, 154–159
26. Goldberg D (1989) Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, MA
27. Hanshar FT, Ombuki-Berman BM (2007) Dynamic vehicle routing using genetic algorithms. Appl Intell 27(1):89–99
28. Hartmann S (1998) A Competitive Genetic Algorithm for Resource-Constrained Project Scheduling. Nav Res Logist 45:733–750
29. Ho W, Ho G TS, Ji P, Lau HCW (2008) A hybrid genetic algorithm for the multi-depot vehicle routing problem. Eng Appl AI 21(4):548–557
30. Holland JH (1962) Outline for a logical theory of adaptive systems. J ACM 3:297–314
31. Holland JH (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor
32. Jahne M, Li X, Branke J (2009) Evolutionary algorithms and multi-objectivization for the travelling salesman problem. GECCO 2009:595–602
33. Karp RM (1972) Reducibility Among Combinatorial Problems. In: Miller R E, Thatcher J W (eds) Complexity of Computer Computations. Plenum, New York, pp 85–103
34. Kennedy J, Eberhart R (1995) Particle swarm optimization, Proceedings of the 1995 IEEE Intern. Conf. Neural Networks, Perth, Australia, IEEE press, 4, pp 1942– 1948
35. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by Simulated Annealing. Science 220(4598):671–680
36. Kolisch R (1996) Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. Eur J Oper Res 90:320–333
37. Kolisch R, Schwindt C, Sprecher A (1999) Handbook on recent advances in project scheduling, pp 197–212
38. Koza JR (1992) Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge
39. Larranaga 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(2):129–170
40. Lenstra J K, Rinnooy Kan AHG (1981) Complexity of vehicle routing and scheduling problems. Networks 11:221–227
41. Lin D, Lee CKM, Ho W (2013) Multi-level genetic algorithm for the resource-constrained re-entrant scheduling problem in the flow shop. Eng Appl AI 26(4):1282–1290
42. Liu J, Zhong W, Jiao L (2010) A Multiagent Evolutionary Algorithm for Combinatorial Optimization Problems. IEEE Trans Syst Man Cybern B 40(1):229–240
43. Michalewicz Z, Fogel DB (2004) How to Solve It: Modern Heuristics, 2nd edn. Springer-Verlag, Berlin, Heidelberg
44. Moon C, Kim J, Choi G, Seo Y (2002) An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur J Oper Res 140(3):606–617
45. Oliver IM, Smith DJ, Holland JRC (1987) A study of permutation crossover operators on the traveling salesman problem Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, pp 224–230. L. E. Associates, Inc., Mahwah
46. Onwubolu GC, Davendra D (2008) Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization, Studies in Computational Intelligence, Vol 175. Springer
47. Pop PC, Matei O, Pop Sitar C (2013) An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109:76–83
48. Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & OR 31(12):1985– 2002
49. Ray S, Bandyopadhyay S, Pal SK (2007) Genetic operators for combinatorial optimization in TSP and microarray gene ordering. Appl Intell 26(3):183–195
50. Rechenberg I (1965) Cybernetic solution path of an experimental problem, Tech. Rep. 1122, Royal Aircraft Establishment
51. Rechenberg I (1973) Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Fromman-Holzboog Verlag, Stuttgart
52. Reeves CR (1995) Genetic algorithms and combinatorial optimization. In V. J. Rayward-Smith, editor, Applications of modern heuristic methods, pp 111–125. Alfred Waller Ltd., Henley-on-Thames
53. Reinelt G (1991) TSPLIB - A Traveling Salesman Problem Library. ORSA J Comput:376–384
54. Schwefel H-P (1965) Kybernetische Evolution als Strategie der experimentellen Forschung in der Stromungstechnik. Masters thesis. Technische Universitat Berlin, Berlin
55. Snasel V, Platos J, Kromer P, Ouddane N (2009) Genetic Algorithms for the Use in Combinatorial Problems. Foundations of Computational Intelligence 3:3–22
56. Storn R, Price K (1997) Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11
57. Syswerda G (1991). In: Van Nostrand Reinhold D L (ed) Schedule Optimization Using Genetic Algorithms, Handbook of Genetic Algorithms, New York, pp 332–349
58. Vidal T, Crainic TG, Gendreau M, Prins C (2013) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Computers & OR 40(1):475–489
59. Wang H, Lin D, Li M (2005) A Genetic Algorithm for Solving Resource-Constrained Project Scheduling Problem. ICNC (3):185–193
60. Whitley D, Yoo N-W (1994) Modeling Simple Genetic Algorithms for Permutation Problems. FOGA 1994:163–184
61. Whitley D (1997) Permutations, in Thomas Back. In: Fogel D B, Michalewicz Z (eds) Handbook of Evolutionary Computation, 1st edn. IOP Publ. Ltd., Bristol
62. Whitley D, Sutton A M, Howe A E, Barbulescu L (2008) Resource Scheduling with Permutation Based Representations: Three Applications. Evolutionary Computation in Practice:219–243
63. Yun Y, Chung H, Moon C (2013) Hybrid genetic algorithm approach for precedence-constrained sequencing problem. Comput. Ind. Eng 65(1):137–147
64. Zhu KQ, Liu Z (2004) Population Diversity in Permutation-Based Genetic Algorithm, Machine Learning: ECML 2004, Lecture Notes in Computer Science 3201, pp 537–547. Springer, Berlin Heidelberg