A hybrid algorithm for the Vehicle Routing Problem with AND/OR Precedence Constraints and time windows.
Mina RoohnavazfarSeyed Hamid Reza PasandidehRoberto TadeiPublished in: Comput. Oper. Res. (2022)
Keyphrases
- vehicle routing problem
- hybrid algorithm
- precedence constraints
- tabu search
- scheduling problem
- vehicle routing
- particle swarm optimization
- memetic algorithm
- branch and bound algorithm
- routing problem
- simulated annealing
- np hard
- metaheuristic
- travel time
- benchmark instances
- single machine
- flowshop
- feasible solution
- hybrid method
- parallel machines
- combinatorial optimization
- processing times
- single machine scheduling problem
- artificial bee colony algorithm
- job shop scheduling problem
- ant colony optimization algorithm
- search algorithm
- genetic algorithm
- initial population
- particle swarm optimization pso
- approximation algorithms
- search procedure
- partial order
- ant colony optimization
- optimal solution
- hill climbing
- swarm intelligence
- lower bound
- global constraints
- partially ordered
- integer programming
- pso algorithm