An efficient genetic algorithm for the traveling salesman problem with precedence constraints.
Chiung MoonJongsoo KimGyunghyun ChoiYoonho SeoPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- traveling salesman problem
- precedence constraints
- genetic algorithm
- ant colony optimization
- branch and bound algorithm
- crossover operator
- combinatorial optimization
- scheduling problem
- metaheuristic
- optimization problems
- approximation algorithms
- simulated annealing
- traveling salesman
- parallel machines
- single machine scheduling problem
- job shop scheduling problem
- genetic local search
- partially ordered
- hamiltonian cycle
- partial order
- neural network
- branch and bound
- vehicle routing problem
- ant colony algorithm
- lower bound
- valid inequalities
- global constraints
- tabu search
- upper bound
- fitness function
- multi objective
- search algorithm
- single machine
- swarm intelligence
- worst case
- special case
- genetic algorithm ga