The traveling salesman problem, edited by E. L. Lawler, J. K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, John Wiley & sons, chichester, 1985, 463 pp.
R. JohnsonM. G. PilcherPublished in: Networks (1989)
Keyphrases
- traveling salesman problem
- precedence relations
- resource constrained project scheduling problem
- precedence constraints
- processing times
- combinatorial optimization
- ant colony optimization
- single machine scheduling problem
- optimization problems
- combinatorial problems
- ant colony optimization algorithm
- combinatorial optimization problems
- branch and bound algorithm
- vehicle routing problem
- hamiltonian cycle
- discrete optimization problems
- traveling salesman
- discrete particle swarm optimization
- crossover operator
- genetic local search
- single machine
- scheduling problem
- neural network
- parallel machines
- branch and bound
- markov decision processes
- metaheuristic
- evolutionary algorithm