Request-Allocation in Dynamic Collaborative Transportation Planning Problems

Kristian Schopka () and Herbert Kopfer ()
Additional contact information
Kristian Schopka: University of Bremen
Herbert Kopfer: University of Bremen

A chapter in Operations Research Proceedings 2016, 2018, pp 329-336 from Springer

Abstract: Abstract Several publications on collaborative transportation planning problems (CTPPs) focus on schemes that ensure a fair assignment of collaborative profits. However, it is seldom taken into account that an even allocation of transportation resources (e.g. transportation requests) is also responsible for the viability and stability of horizontal carrier coalitions; particularly if dynamic CTPPs are considered. In this paper, the winner determination problem (WDP) of an auction-based request exchange is restricted by lower and upper bounds that respect an equality between transferred and received requests for carriers. In a computational study, the restricted WDP is applied to the dynamic collaborative traveling salesman problem.

Date: 2018
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:oprchp:978-3-319-55702-1_44

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

DOI: 10.1007/978-3-319-55702-1_44

Access Statistics for this chapter

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