Cargo Consolidation and Distribution Through a Terminals-Network: A Branch-And-Price Approach

Less-than-truckload is a transport modality that includes many practical variations to convey a number of transportation-requests from the origin locations to their destinations by using the possibility of goods-transshipments on the carrier?s terminals-network. In this way logistics companies are required to consolidate shipments from different suppliers in the outbound vehicles at a terminal of the network. We present a methodology for finding near-optimal solutions to a less-than-truckload shipping modality used for cargo consolidation and distribution through a terminals-network. The methodology uses column generation combined with an incomplete branch-and-price procedure.Fil: Dondo, Rodolfo Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentin

Route-based transportation network design

Given shipment demand and driving regulations, a consolidation carrier has to make decisions on how to route both shipments and drivers at minimal cost. The traditional way to formulate and solve these problems is through the use of two-step models. This thesis presents a heuristic algorithm to solve an integrated model that can provide superior solutions. The algorithm combines a slope scaling initialization phase and tabu search to find high-quality solutions. The performance of the proposed heuristic is benchmarked against a commercial solver and these results indicate that the proposed method is able to produce better quality solutions for the similar solution time

Integrated service selection, pricing and fullfillment planning for express parcel carriers - Enriching service network design with customer choice and endogenous delivery time restrictions

Express parcel carriers offer a wide range of guaranteed delivery times in order to separate customers who value quick delivery from those that are less time but more price sensitive. Such segmentation, however, adds a whole new layer of complexity to the task of optimizing the logistics operations. While many sophisticated models have been developed to assist network planners in minimizing costs, few approaches account for the interplay between service pricing, customer decisions and the associated restrictions in the distribution process. This paper attempts to fill this research gap by introducing a heuristic solution approach that simultaneously determines the ideal set of services, the associated pricing and the fulfillment plan in order to maximize profit. By integrating revenue management techniques into vehicle routing and eet planning, we derive a new type of formulation called service selection, pricing and fulfillment problem (SSPFP). It combines a multi-product pricing problem with a cycle-based service network design formulation. In order derive good-quality solutions for realistically-sized instances we use an asynchronous parallel genetic algorithm and follow the intuition that small changes to prices and customer assignments cause minor changes in the distribution process. We thus base every new solution on the most similar already evaluated fulfillment plan. This adapted initial solution is then iteratively improved by a newly-developed route-pattern exchange heuristic. The performance of the developed algorithm is demonstrated on a number of randomly created test instances and is compared to the solutions of a commercial MIP-solver.Series: Schriftenreihe des Instituts für Transportwirtschaft und Logistik - Supply Chain Managemen

The parcel hub scheduling problem with limited conveyor capacity and controllable unloading speeds

We investigate a specific truck scheduling problem at cross-docks in the postal service industry on an operational level aiming to maximise the number of duly parcels assuming fixed departure times of the outbound trucks. The inbound gates and the conveyors as means of transportation inside the hub constitute the bottleneck resources. As a novel extension, we propose flexible unloading speeds to efficiently utilise the scarce resources. We formalise the problem with a mixed integer program and explicitly incorporate controllable unloading speeds of the inbound trucks. We determine the computational complexity and develop a genetic algorithm to efficiently solve the problem. Our investigation focuses on both the performance of the genetic algorithm and the applicability of the results in a real-world environment by implementing scheduling policies in a simulation model that considers individual parcel interactions. Based on our experimental results, we can state that especially in problem settings with scarce conveyor capacities, our approach to incorporate controllable unloading speeds has the potential of significantly increasing the number of duly parcels

Modelling and Performance Evaluation of Containerised Parcel Delivery

This paper investigates different factors that affect the performance of containerised transportation in parcel delivery networks. Motivated by a situation facing a postal delivery company in Australia, we study how container utilisation rate, sortation activities, and changes in cost parameters can affect the overall performance of a parcel delivery network. Mixed-integer programming and machine learning are employed to model a realistic parcel delivery network considering sortation activities and to evaluate the performance of this network using data from a major postal service provider. The findings of this study can help parcel delivery companies to make more informed investment decisions and introduce more effective performance improvement initiatives

Efficient Solution of Minimum Cost Flow Problems for Large-scale Transportation Networks

With the rapid advance of information technology in the transportation industry, of which intermodal transportation is one of the most important subfields, the scale and dimension of problem sizes and datasets is rising significantly. This trend raises the need for study on improving the efficiency, profitability and level of competitiveness of intermodal transportation networks while exploiting the rich information of big data related to these networks. Therefore, this dissertation aims to investigate intermodal transportation network design problems, especially practical optimization problems, and to develop more realistic and effective models and solution approaches that will assist network operators and/or decision makers of the intermodal transportation system. This dissertation focuses on developing a novel strategy for solving the Minimum Cost Flow (MCF) problem for large-scale network design problems by adopting a divide-and-conquer policy during the optimization process. The main contribution is the development of an agglomerative clustering based tiling strategy to significantly reduce the computational and peak memory consumption of the MCF model for large-scale networks. The tiling strategy is supported by the regional-division theorem and -approximation regional-division theorem that are proposed and proved in this dissertation. The region-division theorem is a sufficient condition to exactly guarantee the consistency between the local MCF solution of each sub-network obtained by the aforementioned tiling strategy and the global MCF solution of the whole network. Furthermore, the -approximation region-division theorem provides worst-case bounds, so that the practical approximation MCF solution closely approximates the optimal solution in terms of its optimal value. A series of experiments are performed to evaluate the utility of the proposed approach of solving the large-scale MCF problem. The results indicate that the proposed approach is beneficial to save the execution time and peak memory consumption in large-scale MCF problems under different circumstances