Multi-routing for Transport-Matching in Cooperative, Full Truckload, Relay Networks

Bernd Nieberding ()
Additional contact information
Bernd Nieberding: University of Applied Sciences

A chapter in Operations Research Proceedings 2017, 2018, pp 325-331 from Springer

Abstract: Abstract A mathematical model is used to schedule and route full truckload shipments in a cooperative network as relays. We describe a matching of transports in the network, which eleminates empty runs. To maximize the matched number of transports handled in the network, each transport is associated with a multiple number of possible routes, under certain conditions. These re-designed dispatching processes enhance the total costs of transports for members in the cooperation.

Keywords: Truckload; Relay network; Modeling; Transport matching (search for similar items in EconPapers)
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-89920-6_44

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

DOI: 10.1007/978-3-319-89920-6_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 ().