A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Exact Method for the Vehicle Routing Problem with Backhauls
Transportation Science
An exact algorithm for IP column generation
Operations Research Letters
A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
Computers and Operations Research
A Column Generation Algorithm for a Rich Vehicle-Routing Problem
Transportation Science
An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
Computers and Operations Research
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
Engineering Applications of Artificial Intelligence
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Computers and Operations Research
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
A genetic algorithm for the simultaneous delivery and pickup problems with time window
Computers and Industrial Engineering
New lower bounds for the vehicle routing problem with simultaneous pickup and delivery
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
The Pickup and Delivery Problem with Cross-Docking
Computers and Operations Research
Computers and Industrial Engineering
An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment
Transportation Science
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
The vehicle routing problem with simultaneous distribution and collection (VRPSDC) is the variation of the capacitated vehicle routing problem that arises when the distribution of goods from a depot to a set of customers and the collection of waste from the customers to the depot must be performed by the same vehicles of limited capacity and the customers can be visited in any order. We study how the branch-and-price technique can be applied to the solution of this problem and in particular we compare two different ways of solving the pricing subproblem: exact dynamic programming and state space relaxation. By applying a bidirectional search we experimentally prove its effectiveness in solving the subproblem. We also devise suitable branching strategies for both the exact and the relaxed approach and we report on an extensive set of computational experiments on benchmark instances with both simple and composite demands.