Optimal Solutions for the Vehicle Routing Problem with Split Demands.
Hipólito Hernández-PérezJuan José Salazar GonzálezPublished in: ICCL (2019)
Keyphrases
- vehicle routing problem
- metaheuristic
- optimal solution
- np hard
- discrete particle swarm optimization
- tabu search
- knapsack problem
- vehicle routing problem with time windows
- routing problem
- feasible solution
- test instances
- travel time
- hybrid metaheuristic
- vehicle routing
- combinatorial optimization
- optimization problems
- multi depot
- memetic algorithm
- search space
- simulated annealing
- ant colony optimization
- particle swarm optimization
- solution space
- traveling salesman problem
- iterated local search
- benchmark instances
- objective function
- benchmark problems
- search methods
- branch and bound
- path relinking
- lower bound
- variable neighborhood search
- scatter search
- total cost
- genetic algorithm
- hybrid algorithm
- linear programming
- column generation
- branch and bound algorithm
- linear program
- greedy randomized adaptive search procedure
- search procedure
- nature inspired
- scheduling problem
- special case
- search algorithm
- logistics distribution
- neural network