Deterministic Container-to-Mode Assignment

D. Huizing
Additional contact information
D. Huizing: TNO

Chapter Chapter 3 in Optimisation in Synchromodal Logistics, 2023, pp 41-58 from Springer

Abstract: Abstract This chapter presents a social optimisation problem (following Fig. 1.2 ), where both the events and the infrastructure are fixed (following Fig. 1.4 ). It is assumed that the transportation vehicles have fixed time tables, and one only has to decide on a container-to-mode assignment, so by what modality paths all containers reach their destination against minimal total cost. The containers have release times and deadlines. A model that also allows soft due dates is developed. Moreover, the option of using trucks or other “infinite resources” to help fulfil requests is added. With appropriate graph reductions, this problem can be solved to optimality in little time by solving the minimum-cost multi-commodity flow problem on an appropriate space–time network.

Date: 2023
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:lnopch:978-3-031-15655-7_3

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

DOI: 10.1007/978-3-031-15655-7_3

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().