Deterministic Operational Freight Planning

D. Huizing
Additional contact information
D. Huizing: TNO

Chapter Chapter 5 in Optimisation in Synchromodal Logistics, 2023, pp 89-117 from Springer

Abstract: Abstract In this chapter, the final of three problems is presented. Now, there are no stochastic elements anymore; however, the decision-maker is given control over the vehicle timetables in addition to the control over container-to-mode assignments. This problem is argued to be a departure from classical optimisation problems, but shown to still be strongly NP-hard. An integer linear program is developed to solve the problem, but the results show that it scales too poorly to solve problems of “real life size” in an appropriate amount of time for decision support. The Greedy Gain heuristic and Compatibility Clustering heuristic are developed: they solve much more limited sub-problems with the ILP, but unfortunately, even these sub-problems require too much computational effort at the wished instance size.

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_5

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

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

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 ().