Skip to main content
SpringerLink
Log in

Transportation Service Network Design: Models and Algorithms

  • Conference paper
Computer-Aided Transit Scheduling

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 471))

Abstract

We focus on the problem of large scale service network design for transportation carriers requiring the determination of the cost minimizing or profit maximizing set of transportation services and their schedules, given resource constraints. Examples include determining the set of flights and their schedules for an airline; determining the routing and scheduling of tractors and trailers in a trucking operation; and jointly determining the aircraft flights, ground vehicle and package routes and schedules for a provider of express shipment service. In this paper, we survey network design literature, and present a general modeling framework and solution approach for large-scale transportation service network design.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Ahuja, R.K./Magnanti, T.L./Orlin, J.B. Network Flows — Theory, Algorithms, and Applications, Prentice Hall, 1993

    Google Scholar 

  • Barnhart, C. /Johnson, E.L. /Nemhauser, G.L. /Savelsbergh, M.W.F. /Vance, P.H., Branch-and-Price: Column Generation for Solving Huge Integer Programs. Operations Research, 46:3, 1998

    Article  Google Scholar 

  • Barnhart, C./Schneur, R.R., Air Network Design for Express Shipment Service. Operations Research, 44:6, 1996

    Article  Google Scholar 

  • Bradley, S.P./Hax, A.C./Magnanti, T.L., Applied Mathematical Programming. Addision-Wesley Publishing Company, 1977

    Google Scholar 

  • CPLEX Optimization, Inc., Using the CPLEX Callable Library, version 4.0. CPLEX Optimization, Inc. Suite 279, 930 Tahoe Blvd., Bldg. 802, Incline Village, NV 89451–9436, 1995

    Google Scholar 

  • Crainic, T.G. /Rousseau, J.M., Multicommodity, Multimode Freight Transportation: A General Modeling and Algorithmic Framework for the Service Network Design Problem. Transportation Research-B, 20B:3, 1986

    Google Scholar 

  • Desaulniers, G./Desrosiers, J./Ioachim, I./Solomon, M./Soumis, F., Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems. Working Paper, GERAD, 1994

    Google Scholar 

  • Desrochers, M./Soumis, F., A Column Generation Approach to the Urban Transit Crew Scheduling Problem. Transportation Science 23, 1989

    Google Scholar 

  • Desrosiers, J./Dumas, Y./Solomon, M./Soumis, F., Time Constrained Routing and Scheduling. In Handbooks in Operations Research and Management Science, Volume on Networks, North Holland, 1992

    Google Scholar 

  • Erlenkotter, D., A Dual-Based Procedure for Uncapacitated Facility Location. Operations Research, 26:6, 1978

    Article  Google Scholar 

  • Farvolden, J.M./Powell, W.B., Subgradient Methods for the Service Network Design Problem. Transportation Science, 28:3, 1994

    Article  Google Scholar 

  • Guignard, M./Spielberg, K., A Direct Dual Method for the Mixed Plant Location Problem with Some Side Constraints. Mathematical Programming, 17, 1979

    Google Scholar 

  • Guignard, M., A Lagrangean dual ascent algorithm for simple plant location problems. European Journal of Operations Research, 35, 1988

    Google Scholar 

  • Hane, C.A. /Barnhart, C. /Johnson, E.L. /Marsten, R.E. /Nemhauser, G.L. /Sigismondi, G., The Fleet Assignment Problem: Solving a Large-Scale Integer Program. Tech. Rep. COC-92–04, School of Industrial and Systems Engineering, Georgia Institute of Technology, June 1994

    Google Scholar 

  • Jones, K.L./Lustig, I.J./Farvolden, J.M./Powell, W.B., Multicommod-ity Network Flows: The Impact of Formulation on Decomposition. Mathematical Programming, 62, 1993

    Google Scholar 

  • Kim, D., Large Scale Transportation Service Network Design: Models, Algorithms and Applications. Ph.D. Thesis, Massachusetts Institute of Technology, 1997

    Google Scholar 

  • Lamar, B.W./Sheffi, Y./Powell, W.B., A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems. Operations Research, 38:4, 1990

    Article  Google Scholar 

  • Leung, J.M.Y./Magnanti, T.L./Singhal, V., Routing Point-to-Point Delivery Systems: Formulation and Heurisitcs. Transportation Science, 24, 1990

    Google Scholar 

  • Magnanti, T.L., Combinatorial Optimization and Vehicle Fleet Planning: Perspectives and Prospects. Networks, 11, 1981

    Google Scholar 

  • Magnanti, T.L./Wong, R.T., Network Design and Transportation Planning: Models and Algorithms. Transportation Science, 18:1, February 1984

    Article  Google Scholar 

  • Magnanti, T.L./Mirchandani, P., Shortest Paths, Single Origin- Designation Network Design, and Associated Polyhedra. Networks, 23, 1993

    Google Scholar 

  • Magnanti, T.L./Mirchandani, P./Vachani, R., The Convex Hull of Two Core Capacitated Network Design Problems. Mathematical Programming, 60, 1993

    Google Scholar 

  • Magnanti, T.L./Mirchandani, P./Vachani, R., Modeling and Solving the Two- Facility Capacitated Network Loading Problem. Operations Research, 43:1, 1995

    Article  Google Scholar 

  • Minoux, M., Network Systhesis and Optimum Network Design Problems: Models, Solution Methods and Applications. Network, 19, 1989

    Google Scholar 

  • Nemhauser, G.L./Wolsey, L.A., Integer and Combinatorial Optimization. A Wiley-Interscience Publication, John Wiley & Sons, Inc., 1988

    Google Scholar 

  • Nemhauser, G.L./Salvelsbergh, M.W.P./Sigismondi, G.C., MINTO, a Mixed INTeger Optimizer. Operations Research Letters, 15, 1994

    Google Scholar 

  • Nemhauser, G.L., The Age of Optimization: Solving Large-Scale Real-World Problems. OR Forum, Operations Research, 42:1, 1994

    Article  Google Scholar 

  • Newton, H.N., Network Design Under Budget Constraints with Application to the Railroad Blocking Problem. Ph.D. Thesis, Industrial and Systems Engineering, Auburn University, Auburn, Alabama, 1996

    Google Scholar 

  • OSL, IBM Optimization Subroutine Library Guide and Reference. IBM Systems Journal, SC23–0519, Issue 1, 31, 1992

    Google Scholar 

  • Parker, M./Ryan, J., A Column Generation Algorithm for Bandwidth Packing. Telecommunications Systems, 1994

    Google Scholar 

  • Powell, W.B., A Local Improvement Heuristic for the Design of Less-than-Truckload Motor Carrier Networks. Transportation Science, 20:4, 1986

    Google Scholar 

  • Powell, W.B./Sheffi, Y., Design and Implementation of an Interactive Opti-mizatin System for Network Design in the Motor Carrier Industry. Operations Research, 37, 1989

    Google Scholar 

  • Shenoi, R. G., Integrated Airline Schedule Optimization: Models and Solution Methods. Ph.D. Thesis, Massachusetts Institute of Technology, 1996

    Google Scholar 

  • Van Roy, T.J., A Cross Decomposition Algorithm for Capacitated Facility Location. Operations Research, 34:1, 1986

    Google Scholar 

  • Vance, P.H./Barnhart, C./Johnson, E.L./Nemhauser, G.L., Solving Binary Cutting Stock Problems by Column Generation and Branch-and-Bound, Computational Optimization and Applications, Computational Optimization and Applications, 3, 111–130, 1994

    Article  Google Scholar 

  • Ziarati, K./Soumis, F./Desrosiers, J./Gelinas, S./Saintonge, A., Locomotive Assignment with Heterogeneous Consists at CN North America. Working Paper, GERAD and École Polytechnique de Montreal, 1995

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. i2 Technologies, White Plains, New York, 10606, USA

    Daeki Kim

  2. Massachusetts Institute of Technology, Cambridge, MA, 02139, USA

    Cynthia Barnhart

Authors
  1. Daeki Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cynthia Barnhart
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Civil and Environmental Engineering, Massachusetts Institute of Technology, 77 Massschusetts Avenue, Cambridge, MA, 02139, USA

    Nigel H. M. Wilson

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, D., Barnhart, C. (1999). Transportation Service Network Design: Models and Algorithms. In: Wilson, N.H.M. (eds) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85970-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-85970-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65775-0

  • Online ISBN: 978-3-642-85970-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation