The vehicle routing problem
Perturbation heuristics for the pickup and delivery traveling salesman problem
Computers and Operations Research
Computers and Operations Research
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Computers and Operations Research
A scatter search algorithm for solving vehicle routing problem with loading cost
Expert Systems with Applications: An International Journal
An effective local search approach for the Vehicle Routing Problem with Backhauls
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Solving vehicle routing with full container load and time windows
ICCL'12 Proceedings of the Third international conference on Computational Logistics
The vehicle routing problem with restricted mixing of deliveries and pickups
Journal of Scheduling
Adaptive Path Relinking for Vehicle Routing and Scheduling Problems with Product Returns
Transportation Science
| Hi-index | 0.01 |
We consider the problem in which a fleet of vehicles located at a central depot is to be optimallyused to serve a set of customers partitioned into two subsets of linehaul and backhaul customers. Each route starts and ends at the depot and the backhaul customers must be visited afterthe linehaul customers. A new (0-1) integer programming formulation of this problem is presented. We describe a procedure that computes a valid lower bound to the optimal solution cost by combining different heuristic methods for solving the dual of the LP-relaxation of the exact formulation. An algorithm for the exact solution of the problem is presented. Computational tests on problems proposed in the literature show the effectiveness of the proposed algorithms in solving problems up to 100 customers.