A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
- 13 January 2007
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 176 (1), 87-105
- https://doi.org/10.1016/j.ejor.2005.06.044
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- The Rollon–Rolloff Vehicle Routing ProblemTransportation Science, 2000
- Optimal sequencing of skip collections and deliveriesJournal of the Operational Research Society, 1997
- The vehicle-routing problem with delivery and back-haul optionsNaval Research Logistics (NRL), 1996
- A Network Flow Based Heuristic for Bulk Pickup and Delivery RoutingTransportation Science, 1995
- A Routing Model for Pickups and Deliveries: No Capacity Restrictions on the Secondary ItemsTransportation Science, 1993
- A survey of algorithms for the generalized assignment problemEuropean Journal of Operational Research, 1992
- PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTIONDecision Sciences, 1983
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian dualityEuropean Journal of Operational Research, 1979
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964