New savings based algorithms for time constrained pickup and delivery of full truckloads
- 16 December 2003
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 151 (3), 520-535
- https://doi.org/10.1016/s0377-2217(02)00650-1
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Fleet Sizing and Empty Equipment Redistribution for Center-Terminal Transportation NetworksManagement Science, 1997
- A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor CarriersTransportation Science, 1996
- The General Pickup and Delivery ProblemTransportation Science, 1995
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- Vehicle routing with full loadsComputers & Operations Research, 1988
- Maximizing Profits for North American Van Lines' Truckload Division: A New Framework for Pricing and OperationsInforms Journal on Applied Analytics, 1988
- An operational planning model for the dynamic vehicle allocation problem with uncertain demandsTransportation Research Part B: Methodological, 1987
- Truck backhauling on networks with many terminalsTransportation Research Part B: Methodological, 1987
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window ConstraintsOperations Research, 1987
- Truck backhauling on two terminal networksTransportation Research Part B: Methodological, 1984