Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 57, No. 3, May-June 2009, pp. 609-625
DOI: 10.1287/opre.1080.0587
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Jarrah, A. I.
Right arrow Articles by Neubert, L. C.
Right arrow Search for Related Content

Large-Scale, Less-than-Truckload Service Network Design

Ahmad I. Jarrah, Ellis Johnson, Lucas C. Neubert

Department of Decision Sciences, School of Business, The George Washington University, Washington, DC 20052
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
J. B. Hunt, Lowell, Arkansas 72745

jarrah{at}gwu.edu
ejohnson{at}isye.gatech.edu
luke_neubert{at}jbhunt.com

We present a novel formulation for the service network design problem in the context of large-scale, less-than-truckload (LTL) freight operations. The formulation captures the basic network design constraints; the load-planning requirement that all freight at a location, irrespective of the freight's origin, loads to the same next terminal; and other important LTL-specific requirements. Our modeling scheme fragments the underlying massive network design model with up to 1.3 million 0–1 variables and 1.3 million rows into a separate and efficient integer programming (IP) problem for each destination terminal along with a coordinating master network design problem. We produce high-quality solutions in very reasonable CPU times (~2 hours) using slope scaling and load-planning tree generation with corresponding potential annual savings of $20–25 million dollars for the target company for which the research was conducted.

Subject classifications: integer programming; transportation; shipping; multicommodity networks.
History: Received May 2006; revision received January 2008; accepted January 2008.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2009 by INFORMS.