A bi-objective time-dependent vehicle routing problem with delivery failure probabilities.
Franco MenaresElizabeth MonteroGermán Paredes-BelmarAndrés BronfmanPublished in: Comput. Ind. Eng. (2023)
Keyphrases
- bi objective
- vehicle routing problem
- travel time
- vehicle routing problem with simultaneous
- routing problem
- metaheuristic
- knapsack problem
- ant colony optimization
- efficient solutions
- multi objective
- vehicle routing
- tabu search
- benchmark problems
- combinatorial optimization problems
- shortest path problem
- traveling salesman problem
- vehicle routing problem with time windows
- pick up and delivery
- np hard
- multi objective optimization
- hybrid metaheuristic
- memetic algorithm
- combinatorial optimization
- particle swarm optimization
- multiple objectives
- network design
- benchmark instances
- genetic algorithm
- special case
- simulated annealing
- probability distribution
- exact algorithms
- evolutionary algorithm
- hybrid algorithm
- search strategies
- neighborhood search
- genetic programming