Optimal Solution of Vehicle Routing Problems with Fractional Objective Function.
Roberto BaldacciAndrew LimEmiliano TraversiRoberto Wolfler CalvoPublished in: Transp. Sci. (2020)
Keyphrases
- vehicle routing problem
- optimal solution
- metaheuristic
- objective function
- np hard
- knapsack problem
- tabu search
- vehicle routing problem with time windows
- optimization problems
- test instances
- feasible solution
- ant colony optimization
- linear programming
- routing problem
- lower bound
- global optimum
- linear program
- combinatorial optimization
- scatter search
- guided local search
- solution quality
- memetic algorithm
- benchmark problems
- greedy randomized adaptive search procedure
- branch and bound
- benchmark instances
- traveling salesman problem
- search space
- waste collection
- variable neighborhood search
- path relinking
- branch and bound algorithm
- approximation algorithms
- multi depot
- column generation
- solution space
- multi objective
- mixed integer
- special case
- heuristic methods
- cost function
- upper bound
- particle swarm optimization
- constraint satisfaction
- neural network