New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries.
Yogesh Kumar AgarwalPrahalad VenkateshanPublished in: Networks (2022)
Keyphrases
- vehicle routing problem with simultaneous
- vehicle routing problem
- valid inequalities
- traveling salesman problem
- mixed integer linear programs
- feasible solution
- tabu search
- integer programming
- combinatorial optimization
- pick up and delivery
- cutting plane algorithm
- routing problem
- ant colony optimization
- network design problem
- metaheuristic
- travel time
- np hard
- mixed integer
- linear programming
- optimization problems
- benchmark problems
- mixed integer programming
- cutting plane
- integer program
- integer programming formulation
- column generation
- lower and upper bounds
- simulated annealing
- facet defining
- neural network
- knapsack problem
- particle swarm optimization
- probability distribution
- special case
- lower bound
- feature space
- search algorithm