Xin Wang. Operational. Transportation Flanning. of Modern Freight. Forwarding Companies. Vehicle Routing under. Consideration of Subcontracting

Transcription

1 Xin Wang Operational Transportation Flanning of Modern Freight Forwarding Companies Vehicle Routing under Consideration of Subcontracting and Request Exchange Foreword by Prof. Dr.-Ing. Herbert Springer Gabler

2 Contents List of Figures List of Tables Abbreviations XIII XV XVII 1 Introduction Request fulfillment of freight forwarding companies Objectives and Structure of tlie Thesis 3 2 Vehicle Routing Introduction Mathematieal model for the PDPTW Solution approaches for the PDPTW Exact algorithms Heuristic algorithms The ALNS heuristic of Röpke and Pisinger(2006) General ideas Removal operators Insertion operators Adaptive operator ehoiee Further settings 22 3 Freight Consolidation Introduction Mathematical formulation Solution methodology A local search heuristic A snnulated aunealing heuristic Computational experiments Cost function for the freigilt charge calculation Test instances Computational results 40

3 X Contents 3.5 Conclusions 41 4 From Cherry-Picking to Integrated Operational Transportation Flanning External transportation resourc.es in subcontracting Cherry-Picking Integrated operational transportation planning Literatur«: review Subcontracting vehicle routes Subcontracting requests to common carriers Subcontracting both routes and requests Mathematical model Reducing long-term costs through integrated planning 54 5 Solution approaches for the integrated operational transportation planning problem Adaptive large neighborhood search Heuristie II: An iterative approach A set partitioning model of the IOTPP Construction of candidate routes Obtaining integer Solution* Overview of the heuristie Computational experiments Instance generation Computational results Conclusions 69 6 Collaborative transportation planning Introduction Design of request exchange mechanisms Mathematical formulation Request exchange mechanisms in literature 78 7 A route-based request exchange mechanism for the collaborative transportation planning The route-based request exchange mechanism Preprocessing Initial route generation Temporary winner determination 87

4 Contents XI Iterative route generation Final winner determination Computational experiments Test instante generation Route generator Computational results Discussion of results Conelusions 99 8 Collaborative integrated operational transportation planning Problem definition Solution approach for collaborative planning Preprocessing Initial route generation Temporary winner determination Iterative route generation Final winner determination and flow of payments Computational Experiments Instance generation Isolated and centralized planning Collaborative planning Conelusions Dynamic collaborative transportation planning Literature review Problem definition Solution approaches Rolling horizon planning with fixed interval Request triggered rolling horizon planning Determination of due requests Planning strategies using advanced request Information Identification of requests for exchange Extended route-based request exchange mechanism Conelusions 126

5 XII Contents 10 Computational study on the dynamic collaborative transportation planning Tost 1: Dyiiamism of instances Measuring dynamism of instances Instante generation Simulation results Test 2: Value of advanced request Information Instance generation Simulation settings Results and discussion Test 3: Length of the planning period in RHP-INT Simulation settings Results and discussion Total costs of the Solution» Cost-savings through CTP Test 4: Length of the planning horizon in RHP-RT Simulation settings Results and discussion Total costs of the solutions Comparison between RHP-INT and RHP-R.T Test 5: Flanning wit.h high subcontracting costs Instance adjustment and Simulation settings Results and discussion Conclusions Conclusions and future research Sunnnary and conclusions Outlook of future research 150 Bibliography 153