The lane covering problem with time windows
- 1 February 2008
- journal article
- research article
- Published by Informa UK Limited in Journal of Discrete Mathematical Sciences & Cryptography
- Vol. 11 (1), 67-81
- https://doi.org/10.1080/09720529.2008.10698167
Abstract
The Lane Covering Problem with Time Windows arises in the context of collaborative logistics. Given a set of lanes, it aims at finding a set of tours covering all lanes with the objective of minimizing the total travel cost. The purpose of this paper is to formulate a model for such a problem and to propose a heuristic approach based on Lagrangian relaxation for its solution. The behavior of this procedure is tested on a set of random instances.Keywords
This publication has 6 references indexed in Scilit:
- A Computational Study of Cost Reoptimization for Min-Cost Flow ProblemsINFORMS Journal on Computing, 2006
- OPTIMIZATION‐BASED PROCUREMENT FOR TRANSPORTATION SERVICESJournal of Business Logistics, 2003
- Combinatorial Auctions for Transportation Service Procurement: The Carrier PerspectiveTransportation Research Record: Journal of the Transportation Research Board, 2003
- Implementing Real-Time Optimization Models: A Case Application From The Motor Carrier IndustryOperations Research, 2002
- The relax codes for linear minimum cost network flow problemsAnnals of Operations Research, 1988
- Maximizing Profits for North American Van Lines' Truckload Division: A New Framework for Pricing and OperationsInforms Journal on Applied Analytics, 1988