The time-dependent capacitated profitable tour problem with time windows and precedence constraints.
Peng SunLucas P. VeelenturfSaid DabiaTom Van WoenselPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- precedence constraints
- vehicle routing problem
- traveling salesman problem
- travel time
- branch and bound algorithm
- combinatorial optimization
- scheduling problem
- routing problem
- tabu search
- np hard
- approximation algorithms
- metaheuristic
- parallel machines
- partially ordered
- partial order
- vertex cover
- single machine scheduling problem
- precedence relations
- release dates
- optimization problems
- series parallel
- branch and bound
- ant colony optimization
- global constraints
- parallel processors
- sequence dependent setup times
- single machine
- maximum lateness
- unit length
- lagrangian relaxation
- partially ordered sets
- flowshop
- integer programming
- lot sizing
- minimum cost
- processing times
- particle swarm optimization
- worst case
- computational complexity
- optimal solution
- multi item
- genetic algorithm
- simulated annealing
- cost function
- special case
- lower bound