Genetic algorithm crossover operators for ordering applications

DOI10.1016/0305-0548(93)E0024-NzbMath0813.90098MaRDI QIDQ1342326

V. Pereyra

Publication date: 11 January 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

genetic algorithm; crossover operators; tie-breaking algorithm

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

90C27: Combinatorial optimization

92D10: Genetics and epigenetics

Related Items

Using genetic algorithm for dynamic and multiple criteria web-site optimizations, Multiprogramming genetic algorithm for optimization problems with permutation property, Quality inspection scheduling for multi-unit service enterprises, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem, Hybrid genetic algorithm for optimization problems with permutation property, A new approach to solving the multiple traveling salesperson problem using genetic algorithms, Operations research at container terminals: a literature update, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains, A hybrid genetic algorithm for the two-dimensional single large object placement problem, A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item