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

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.