Computational Logistics: 11th International Conference, ICCL 2020, Enschede, The Netherlands, September 28–30, 2020, Proceedings (Theoretical Computer Science and General Issues)

This book constitutes the proceedings of the 11th International Conference on Computational Logistics, ICCL 2020, held in Enschede, The Netherlands, in September 2020. The 49 papers included in this book were carefully reviewed and selected from 73 submissions. They were organized in topical sections named: maritime and port logistics; vehicle routing and scheduling; freight distribution and city logistics; network design and scheduling; and selected topics in logistics. Due to the Corona pandemic ICCL 2020 was held as a virtual event. Preface Organization Contents Maritime and Port Logistics Evaluating Port Development Strategies for a Modal Shift: A Norwegian Case Study 1 Introduction 2 Problem Definition and Mathematical Formulation 2.1 Problem Definition and Notation 2.2 Model 3 Computational Study 3.1 Input Data for the Case Study 3.2 Computational Results 4 Concluding Remarks References Pickup and Delivery Problem with Transshipment for Inland Waterway Transport 1 Introduction 2 Literature Review 2.1 Transshipment in Transportation Domain 2.2 Optimization Challenges for Inland Barges 3 Optimization Model for Inland Barges 4 Solution Methodology 4.1 Insertion Operators 4.2 Removal Operators 4.3 Performance Improvement 5 Case Study 5.1 Data 5.2 Benchmark Comparison 5.3 Experiments with Large Instances 6 Conclusions and Future Work References Ferry Service Network Design for Kiel fjord 1 Introduction 2 Related Literature 3 Modelling of the FSNDP 4 Generation of Route and Frequency Combinations 5 Computational Study 5.1 Instances 5.2 Parameters 5.3 Computational Results 6 Conclusion References Smart Containers with Bidding Capacity: A Policy Gradient Algorithm for Semi-cooperative Learning 1 Introduction 2 Related Work 3 Problem Definition 4 Solution Method 5 Numerical Experiments 5.1 Exploration of Parameter Space 5.2 Analysis of Policy Performance 6 Conclusions References Analyzing the Impact of the Northern Sea Route on Tramp Ship Routingpg with Uncertain Cargo Availability 1 Introduction 2 Problem Description 3 Model Formulation 3.1 Modeling Approach 3.2 Notation 3.3 Preprocessing Procedures 3.4 Model 4 Data and Scenario Generation 4.1 Input Data 4.2 Scenario Generation 5 Case Study 6 Conclusion References Stowage Planning with Optimal Ballast Water 1 Introduction 2 Literature Review 3 Integrated Stowage Planning 4 Ro-Ro Ship Stowage Problem with Ballast Water 5 Mathematical Formulation 5.1 Mathematical Formulation 5.2 Linearisation 6 Computational Results 7 Conclusion and Discussion References Waterborne Hinterland Transports for Floating Port Terminals 1 Introduction 2 Hinterland Transport Scenarios 2.1 Assumptions 2.2 Container Split on Hinterland Connections 3 Simulation Model 3.1 Vessel Types 3.2 Ship Velocity at Sea 3.3 Cost Model 3.4 Mathematical Model Formulation 4 Simulation Results 5 Conclusions References An Optimization Model for Defining Storage Strategies for Export Yards in Container Terminals: A Case Study 1 Introduction and Literature Review 2 Problem Description 3 The 0–1 Linear Programming Formulation 4 Case Study 5 Conclusion References Vehicle Routing and Scheduling Dynamic Assignment Vehicle Routing Problem with Time Windows 1 Introduction 2 Problem Description 3 Solution Approach 3.1 Overview of the Approach 3.2 Step 1: Create Initial Dummy Solution 3.3 Step 2: Create Improved Dummy Solution 3.4 Step 3: Dynamic Solution 4 Results 4.1 Discarding Time Windows 4.2 Incorporating Time Windows 5 Summary and Conclusions References Time-Dependent Travel-Time Constrained Inventory Routing Problem 1 Introduction 2 Literature Review 3 IRP vs. Time-Dependent IRP (TD-IRP) 3.1 Mathematical Formulation of the IRP 3.2 Time-Dependent Travelling Time Function 3.3 First in First Out (FIFO) Property 3.4 Limits of the FIFO Travelling Time Function 3.5 Mathematical Formulation of the TD-IRP 3.6 Time-Travel Constrained TD-IRP 4 Results and Discussion 5 Conclusions and Perspectives References Vehicle Routing Problem with Reverse Cross-Docking: An Adaptive Large Neighborhood Search Algorithm 1 Introduction 2 Problem Description 3 Proposed Algorithm 3.1 Phase 1: Node Selection 3.2 Phase 2: Adaptive Large Neighborhood Search (ALNS) 4 Computational Results 5 Conclusion References Solving a Bi-Objective Rich Vehicle Routing Problem with Customer Prioritization 1 Introduction 2 Literature Review 3 Problem Formulation 4 Heuristics 5 Experiments 5.1 Description of Problem Instances 5.2 Experiments with the Mathematical Model 5.3 Experimental Settings 5.4 Experimental Results 6 Conclusion References A Genetic Algorithm to Minimise the Number of Vehicles in the Electric Vehicle Routing Problem 1 Introduction 2 Literature 3 Limitations of the Base Genetic Algorithm 4 Modified Crossover 5 Modified Mutation 5.1 Route Elimination Algorithm 5.2 Node Insertion with Triple Constraints 5.3 Battery-Feasible Neighbours 5.4 Route Merge Local Search (RMLS) as Mutation Operator 5.5 Charging Station Reallocation 6 Diversity Induced Population Selection 6.1 Fitness Function vs Objective Function 6.2 Similarity Score: Hamming Distance 6.3 Jaccard Index for Chromosomes 6.4 Double Jaccard Index 7 Experimental Analysis 7.1 Experimental Setup 7.2 Minimum Number of Vehicles Comparison 7.3 Average Minimum Number of Vehicles Comparison 7.4 Total Travel Duration Comparison 8 Conclusion and Future Works References Decentralized Combinatorial Auctions for Dynamic and Large-Scale Collaborative Vehicle Routing 1 Introduction 2 Related Work 3 Problem Description 4 Auction Approach 4.1 Auction Procedure 4.2 Bundle Generation 4.3 Theoretical Analysis 5 Computational Study 5.1 Impact of Bundling 5.2 Cooperation Gains 6 Conclusions References Metaheuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows and Step Cost Functions 1 Introduction 2 Problem Description 3 Proposed Metaheuristics 3.1 Local Searches 3.2 GRASP 3.3 VNS 3.4 Hybrid 4 Numerical Experiments 4.1 Literature Adapted Instances 4.2 Real Case Inspired Instances 4.3 Small-Sized Instances 5 Conclusion and Further Research References Cyclical Inventory Routing with Unsplittable Pick-Up and Deliveries 1 Introduction 2 Problem Description 3 Mathematical Model 3.1 CWUDSP Submodel 3.2 UPD Submodel 4 Two-Phase Heuristic 4.1 Phase 1: ALNS 4.2 Phase 2: Variable Fixing Procedure 5 Computational Results 5.1 Dataset 5.2 ALNS Performance 6 Conclusion References The Multistage Stochastic Vehicle Routing Problem with Dynamic Occasional Drivers 1 Introduction and Literature 2 Mathematical Formulation 2.1 Notation and Compact Model 2.2 Linearisation 2.3 Valid Inequalities and Symmetry Breaking 3 Computational Results 3.1 Instance Generation 3.2 Results and Discussion 4 Concluding Remarks References Cumulative VRP with Time Windows: A Trade-Off Analysis 1 Introduction 2 Related Works 3 Cumulative VRP 3.1 CumVRP with Hard Time Windows 3.2 CumVRP with Soft Time Windows 4 A MathGRASP Approach for the CumVRP 5 Computational Study 5.1 Problem Instances 5.2 Parameter Setting 5.3 Results 6 Conclusion and Future Research References Freight Distribution and City Logistics Formulations of a Carsharing Pricing and Relocation Problem 1 Introduction 2 Problem Overview and Modeling Assumptions 3 Extensive Formulation (F1) 4 Compact Formulation (F2) 5 Computational Study 5.1 Case Study 5.2 Results 5.3 Solutions 6 Conclusions References Evolutionary Approach for the Multi-objective Bike Routing Problem 1 Introduction 2 Motivation and Objectives 3 Related Work 4 Methodology 4.1 Definition of Cost Functions from Data 4.2 Multi-objective Algorithm 5 Results and Discussion 6 Conclusions and Future Work References Quantifying the Effect of Flexibility and Information Sharing in Transportation Planning 1 Introduction 2 Transportation Planning and Information Sharing 3 Model Formulations and Solution Approach 3.1 Notation 3.2 Model Formulations 4 Computational Study 4.1 Case Data 4.2 Results 5 Concluding Remarks References A Bin Packing Problem with Mixing Constraints for Containerizing Items for Logistics Service Providers 1 Introduction 1.1 The Load Planning and Containerization Problem 1.2 Literature Review 2 Solution Approach 2.1 Problem Formalization 2.2 Mathematical Program 2.3 First-Fit Decreasing Based Heuristic 3 Numerical Results 3.1 Test Instances 3.2 Comparison of Mixed Integer Program and FFDMC Heuristic for a Single Item Mixing Constraint 3.3 Comparison of Mixed Integer Program and FFDMC Heuristic for Multiple Item Mixing Constraints 4 Conclusion and Future Work References Distance Approximation for Dynamic Waste Collection Planning 1 Introduction 2 Literature 3 Problem Description and Formulation 3.1 A Solution Structure for the Waste Collection Case 3.2 A Generic Model for Approximating Distance 3.3 Model Evaluation 3.4 Model Adaptations for the Waste Collection Planning 3.5 A Framework for Improving Approximations 4 Computational Experiments and Results 5 Conclusions References Daily Distribution of Duties for Crew Scheduling with Attendance Rates: A Case Study 1 Introduction 2 Distribution of Duties in Railway Crew Scheduling 2.1 The Railyway Crew Scheduling Problem with Attendance Rates 2.2 Challenges Regarding the Distribution of Duties 3 Solution Approaches 3.1 Measuring the Distribution of Duties 3.2 Integrated Planning 3.3 Post-processing 4 Computational Experiments and Discussion 5 Conclusion and Further Research References A Heuristic Algorithm for Finding Attractive Fixed-Length Circuits in Street Maps 1 Introduction 2 Forming Circuits 3 Problem Generation and Preprocessing 4 Basic Algorithm Performance 5 Improving Algorithm Performance 6 Conclusions References Minimizing Movements in Location Problems with Mobile Recycling Units 1 Introduction 2 Literature Review 3 Problem Definition 4 Mathematical Formulation 5 Bilevel Decomposition Algorithm for the DLPMRU 5.1 An LP Formulation for the Waste-Movement Problem 5.2 Start Solution: Greedy Algorithm 5.3 Solution Algorithm 6 Computational Results 7 Conclusion References Travel Time Prediction Using Tree-Based Ensembles 1 Introduction 2 Methodology: Tree-Based Learning 2.1 Classification and Regression Trees 2.2 Ensemble Techniques: Bagging and Boosting 3 Travel Time Prediction 3.1 Core Data Set and Data Enrichment 3.2 Long-Term Forecasting 3.3 Short-Term Forecasting 3.4 Short vs. Long-Term Prediction 4 Discussion and Outlook References Platooning of Automated Ground Vehicles to Connect Port and Hinterland: A Multi-objective Optimization Approach 1 Introduction 2 Related Work 3 A Model for AGV Platooning 4 Solution Approach 5 Numerical Results 5.1 Experimental Settings 5.2 Results 6 Conclusions References Dynamic Pricing for User-Based Rebalancing in Free-Floating Vehicle Sharing: A Real-World Case 1 Introduction 2 Literature Review 3 Methodology 3.1 Optimal Rebalancing Method 3.2 User-Based Rebalancing 4 Experiment in a Living Lab Setting 4.1 Setting up the Living Lab 4.2 Results of the Living Lab 5 Conclusion References Automated and Autonomous Driving in Freight Transport - Opportunities and Limitations 1 Transport in the Context of Economic Developments 2 Ground-Based Freight Transport 3 Rail Freight Transport 4 Freight Transport on Inland Waterways 5 Sea Freight Transport 6 Air Freight Transport 7 Outlook and Further Developments References Learning-Based Co-planning for Improved Container, Barge and Truck Routing 1 Introduction 2 Real Time Co-planning in Synchromodal Networks 2.1 Real Time Aspect 2.2 Barge Operator 2.3 Truck Operator 3 Departure Learning 4 Simulation Experiments 4.1 Experimental Setup 4.2 Results 5 Conclusion References Overcoming Mobility Poverty with Shared Autonomous Vehicles: A Learning-Based Optimization Approach for Rotterdam Zuid 1 Introduction 2 Related Work 3 Problem Formulation 4 Algorithmic Strategies 4.1 An Approximate Dynamic Programming Algorithm 4.2 Value Function Updates 4.3 Hierarchical Aggregation for Value Function Estimation 4.4 Rebalancing Strategies 5 Experimental Study 6 Results 7 Conclusion References Idle Vehicle Repositioning for Dynamic Ride-Sharing 1 Introduction 2 Related Work 3 System Overview 3.1 Planning Service 3.2 Simulation 4 Repositioning Approaches 4.1 Forecast-Driven Repositioning 4.2 Reactive Repositioning 5 Computional Results 5.1 Data and Setup 5.2 Scenarios and Parameter Settings 5.3 Algorithm Performance with a Perfect Demand Forecast 5.4 Algorithm Performance with a Naive Demand Forecast 6 Conclusion and Outlook References Smart City: A Perspective of Emergency and Resilience at a Community Level in Shanghai 1 Introduction 2 Literature Review 2.1 Smart City and Smart Community 2.2 Geography, Demography and Complex Networks 2.3 Humanities and Social Science 2.4 ICT and Digitalization 3 A Sample Community in Shanghai 3.1 Timeline 3.2 Data 4 Effects and Sensitivity Analysis on Managerial Measures 4.1 Blocking Mobilities 4.2 Cross-Tracing Mechanism 4.3 Composing Multi-functionality Teams 4.4 Sensitivity Analysis 5 Insights and Implications in Emergencies 5.1 Imbalanced Resources 5.2 Imperfect Information 5.3 Average Household 6 Discussion and Further Research 6.1 Traffic Control at the City Level 6.2 Resilience at Multi-layer Networks References Network Design and Scheduling A Shortest Path Algorithm for Graphs Featuring Transfer Costs at Their Vertices 1 Introduction 2 Identifying Shortest Paths 3 An Extension to Dijkstra's Algorithm 4 Asymptotic Analysis 5 Computational Comparison 6 Expansion Times 7 Conclusions References A Global Intermodal Shipment Matching Problem Under Travel Time Uncertainty 1 Introduction 2 Problem Description 3 Mathematical Formulation 4 Chance-Constrained Programming Model 5 Numerical Experiments 5.1 Impact of Different Objective Functions 5.2 Comparing Deterministic, Stochastic, and Robust Approaches 6 Conclusions and Future Research References Cutting Planes for Solving Logistic Flow Problems 1 Introduction 2 Multi-Commodity Network Design Problem 3 Cutting Planes 3.1 General Cuts 3.2 Symmetry Breaking Cut 3.3 Arc Residual Capacity Cut 3.4 Cutset Cut 3.5 Strong Cut 4 Results and Conclusions References Deep Reinforcement Learning and Optimization Approach for Multi-echelon Supply Chain with Uncertain Demands 1 Introduction 2 Deep Reinforcement Learning 3 Related Works 4 Problem Modeling 4.1 MDP Formulation 4.2 Non-Linear Programming Model 5 Case Study 5.1 Methodology 5.2 Experiments 6 Conclusions References The Multi-period Petrol Station Replenishment Problem: Formulation and Solution Methods 1 Introduction 2 Literature Review 2.1 Decomposition Heuristics 2.2 Real-Life Case Studies 3 Problem Definition 4 Mathematical Formulation 5 Heuristic Solution Method 5.1 Decomposition Heuristic 5.2 Improvement Procedure 6 Computational Results 7 Conclusions and Future Research References Simulation Approach for Container Assignment Under Uncertainty 1 Introduction 2 Problem Description 3 Simulation Approach 3.1 Start of the Algorithm 3.2 Decision Space 3.3 Solving the ILP 4 Results 4.1 Design of Experiments 4.2 Benchmark Solution Methods 4.3 Numerical Results 5 Conclusions and Further Research References A Mathematical Model to Route Technicians for Inland Waterway Shipping 1 Introduction 2 Related Work 3 Mathematical Model 3.1 Model Assumptions 3.2 The ISTR Described Using a TST Graph 3.3 Binary Linear Model 4 Computational Results 4.1 Experimental Setting 4.2 Runtime Analysis 4.3 Symmetry Breaking Analysis 5 Conclusion References Selected Topics in Logistics Reactive GRASP-Based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints 1 Introduction 2 Problem Description 3 Literature Review 4 Solution Algorithm 4.1 Two-Step Heuristic 4.2 Reactive GRASP Metaheuristic 5 Computational Results 5.1 Evaluation 6 Conclusions References Game Theoretic Analysis of State Interventions to Reduce Customer Returns in E-Commerce 1 Introduction 2 The Basic Model 2.1 Model Description 2.2 Profit Functions 3 Solution Approach 4 Numerical Analysis of the Basic Model 4.1 Basic Example 4.2 Analysis 5 The Effects of State Interventions 6 Conclusion References Fair User Equilibrium in a Transportation Space-Time Network 1 Introduction 2 Fair User Equilibium in STN 3 Finding Connected Components in STN 4 Tolls on Orders 4.1 Finding a User Equilibrium 4.2 Existence of Solutions 5 Path Tolls Based on Order Fairness 5.1 Finding a User Equilibrium 5.2 Existence of Solutions 6 Conclusions and Future Research References Comparison of Manual and Automated Decision-Making with a Logistics Serious Game 1 Introduction 2 Literature 3 Problem Description 4 Solution Methods 5 Serious Game: Trucks and Barges 6 Experimental Results 6.1 Gaming Session 1: With Students 6.2 Gaming Session 2: With Job Seekers 6.3 Gaming Session 3: With Logistics Professionals 6.4 Interpretation of Algorithmic Performance 7 Conclusions and Further Research References Pricing and Quality Investments in a Mixed Brown-Green Product Market 1 Introduction 2 Literature Review 3 The Model 4 Analytical Results 4.1 Qualitative Analysis of Optimal Policies 4.2 Comparative Analysis of Equilibrium Price and Demand 5 Sensitivity Analysis 6 Conclusion References Increasing the Practical Applicability of Order Picking Operations by Integrating Classification, Labelling and Packaging Regulations 1 Introduction 2 Literature Review 3 CLP Restricted Storage Problem 3.1 Problem Description 3.2 Problem Formulation CLP Restricted Storage 3.3 CLP Regulation in Storage Assignment 4 Simulation Experiments 5 Results and Discussion 5.1 Results Simulation Study 5.2 Managerial Implications 6 Conclusions References A Solution Approach to The Problem of Nesting Rectangles with Arbitrary Rotations into Containers of Irregular Convex and Non-Convex Shapes 1 Introduction 2 Problem Definition 3 Related Works 4 Computational Geometry Subproblems 4.1 No-Fit Polygon 4.2 Inner Fit Polygon 4.3 Collision-Free Region 5 The Proposed Positioning Approach 5.1 Constructive Method 5.2 Local Search Method 5.3 The Main Algorithm 6 Results 7 Conclusions References Cash Distribution Model with Safety Constraints 1 Introduction 2 Methodology 2.1 Inventory-Routing Model 2.2 Risk Management Strategies and Mathematical Modeling 3 Computational Results 3.1 Analysis of Risk Management Strategies 3.2 Risk Performance Indicators 4 Conclusions and Future Research References Author Index This book constitutes the refereed proceedings of the 4th International Conference on Computational Logistics, ICCL 2013, held in Copenhagen, Denmark, in September 2013. The 19 papers presented in this volume were carefully reviewed and selected for inclusion in the book. They are organized in topical sections named: maritime shipping, road transport, vehicle routing problems, aviation applications, and logistics and supply chain management.