An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization.
Claudia ArchettiDominique FeilletAndrea MorM. Grazia SperanzaPublished in: Comput. Oper. Res. (2018)
Keyphrases
- traveling salesman problem
- release dates
- single machine scheduling problem
- combinatorial optimization
- metaheuristic
- vehicle routing problem
- single machine
- scheduling problem
- ant colony optimization
- processing times
- optimization problems
- tabu search
- combinatorial optimization problems
- precedence constraints
- simulated annealing
- objective function
- path relinking
- branch and bound algorithm
- optimal solution
- scatter search
- valid inequalities
- variable neighborhood search
- branch and bound
- feasible solution
- memetic algorithm
- hybrid algorithm
- np hard
- genetic algorithm
- lagrangian relaxation
- neural network
- multistage
- evolutionary algorithm