New Formulations for the Scheduled Service Network Design Problem with Piecewise Linear Costs

Mike Hewitt () and Fabien Lehuédé ()
Additional contact information
Mike Hewitt: Loyola University Chicago
Fabien Lehuédé: IMT Atlantique, LS2N, UMR CNRS

A chapter in Combinatorial Optimization and Applications, 2024, pp 163-178 from Springer

Abstract: Abstract The Scheduled Service Network Design Problem (SSNDP) models a wide range of tactical planning issues in the operation of freight transportation networks. Most variants of the problem model transportation costs that follow a step function that represents constant per-vehicle costs. However, piecewise linear functions have also been used to model cases where transportation costs are quoted on a per-unit-of-flow basis, with the rate decreasing in the amount of flow. We present a formulation strategy for the SSNDP that can be used for cost functions of any structure as it is based on encoding cost functions in data. With an extensive computational study we study the performance of solving instances of these formulations with an off-the-shelf solver.

Keywords: Service network design; Piecewise linear costs; Integer linear programming (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-031-57603-4_8

Ordering information: This item can be ordered from
http://www.springer.com/9783031576034

DOI: 10.1007/978-3-031-57603-4_8

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().