CloudLogistic – Line-Based Optimization for the Disposition of LTL Shipments

Christian Tummel (), Christian Franzen, Phil Friedrichsmeier, Nadine Voßen, Philipp Wolters, Eckart Hauck and Sabina Jeschke
Additional contact information
Christian Tummel: RWTH Aachen University, IMA/ZLW & IfU
Christian Franzen: RWTH Aachen University, IMA/ZLW & IfU
Phil Friedrichsmeier: RWTH Aachen University, IMA/ZLW & IfU
Nadine Voßen: RWTH Aachen University, IMA/ZLW & IfU
Philipp Wolters: RWTH Aachen University, IMA/ZLW & IfU
Eckart Hauck: RWTH Aachen University, IMA/ZLW & IfU
Sabina Jeschke: RWTH Aachen University, IMA/ZLW & IfU

A chapter in Automation, Communication and Cybernetics in Science and Engineering 2013/2014, 2014, pp 681-693 from Springer

Abstract: Abstract As a real application of the in Tummel et al. (The Multi-Depot Heterogeneous Fleet Vehicle Routing Problem With Time Windows And Assignment Restrictions (m-VRPTWAR), 2011) introduced problem class m-VRPTWAR – the “multi-depot heterogeneous fleet vehicle routing problem with time windows and assignment restrictions” – this paper will introduce the so-called “CloudLogistic” concept. The problem addresses the assignment of a set of shipments to a set of freight routes in order to minimize unused cargo volume of the vehicles. The assignment of each shipment is restricted to a subset of freight routes. Furthermore, the shipment has to be delivered in a specific time window. Therefore, it is necessary to determine an order of shipments for each freight route that guarantees the observance of all time windows. The problem class m-VRPTWAR abstracts the implied optimization problem. Besides the introduction of the “CloudLogistic” concept, the main requirements for the software-based shipment processing are discussed, which is the central part of a software-based solution for an implied freight cooperation of Less Than Truckload (LTL) shipments. For the evaluation of problem-specific solvers, as well as for an improved evaluation of the feasibility of the m-VRPTWAR, realistic test data come into place according to Tummel et al. (An Incremental Online Heuristic for Evaluating the Feasibility of the m-VRPTWAR, 2011). Besides a detailed description of the concept a method for the generation of realistic test data will be presented. Finally the evaluation of a Repacking First Fit approach (RFF) as a solution for the discussed feasibility check will be extended by considering different choices of repacking depths.

Keywords: Vehicle Routing; Freight Cooperation; SME; Cooperation Model; Logistic Model; LTL Shipments; Line-Based Optimization (search for similar items in EconPapers)
Date: 2014
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:sprchp:978-3-319-08816-7_53

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

DOI: 10.1007/978-3-319-08816-7_53

Access Statistics for this chapter

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