Solving a Bi-Objective Rich Vehicle Routing Problem with Customer Prioritization.
Tim van BenthemMark BergmanMartijn MesPublished in: ICCL (2020)
Keyphrases
- vehicle routing problem
- bi objective
- routing problem
- combinatorial optimization
- metaheuristic
- vehicle routing problem with simultaneous
- ant colony optimization
- multi objective
- knapsack problem
- efficient solutions
- tabu search
- traveling salesman problem
- hybrid metaheuristic
- vehicle routing
- combinatorial optimization problems
- vehicle routing problem with time windows
- shortest path problem
- benchmark problems
- travel time
- multi objective optimization
- particle swarm optimization
- simulated annealing
- network design
- np hard
- multiple objectives
- pick up and delivery
- variable neighborhood search
- benchmark instances
- greedy randomized adaptive search procedure
- neighborhood search
- optimization problems
- memetic algorithm
- wireless sensor networks
- branch and bound algorithm
- search space
- genetic algorithm
- special case
- search strategies