Computational Logistics

Name: Computational Logistics | 9th International Conference, ICCL 2018, Vietri sul Mare, Italy, October 1-3, 2018, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

9th International Conference, ICCL 2018, Vietri sul Mare, Italy, October 1-3, 2018, Proceedings

Raffaele Cerulli Andrea Raiconi Stefan Voß(Editor)

Springer (Publisher)

Published on 19. September 2018

XI, 488 pages

E-Book

PDF with digital watermarking

System requirements

978-3-030-00898-7 (ISBN)

€53.49incl. 7% vat

System requirements

for PDF with digital watermarking

E-Book Single Licence

Available for download

Description

More details

Other editions

Content

Intro
Preface
Organization
Contents
Maritime Shipping and Routing
Applying a Relax-and-Fix Approach to a Fixed Charge Network Flow Model of a Maritime Inventory Routing Problem
1 Introduction
2 Problem Formulation
2.1 Valid Inequalities
3 The Relax-and-Fix Algorithm
4 Improvement Phase
5 Computational Results
5.1 Tested Instances
5.2 Parametrization
5.3 Main Results
6 Conclusion and Future Work
References
Offshore Supply Planning in a Rolling Time Horizon
1 Introduction
2 Problem Description
3 Mathematical Formulations
3.1 Order Selection Problem
3.2 Vessel Routing Problem with Selective Pickups and Deliveries
4 Computational Study
4.1 Case Study Setup
4.2 Case Results
5 Concluding Remarks
References
Maritime Fleet Deployment with Speed Optimization and Voyage Separation Requirements
1 Introduction
2 Problem Description
2.1 Fleet Deployment
2.2 Fuel Consumption and Speed
2.3 Voyage Separation Requirements
2.4 Problem Summary
3 Mathematical Formulations
3.1 Arc Flow Model
3.2 Path Flow Model
4 Computational Study
4.1 Test Instances
4.2 Comparison of the Arc Flow and Path Flow Models
4.3 Comparison of Using Different Speed Points for Linearization
4.4 Path Reduction Heuristics
5 Concluding Remarks
References
A Novel Method for Solving Collision Avoidance Problem in Multiple Ships Encounter Situations
1 Introduction
2 Structure of the Proposed Method
3 Models and Solution Steps
3.1 Decision Variables and Parameters
3.2 Phase I: Trajectory Prediction
3.3 Phase II: Collision Risk Evaluation
3.4 Phase III: Multi-ship Collision Avoidance Coordination
4 Preliminary Results
4.1 Experimental Settings
4.2 An Example of Simulated Ships' Trajectories to Avoid Collisions
4.3 Overall Comparison of Different Anti-collision Operations
5 Conclusions and Future Work
References
Stimulating Inland Waterway Transport Between Seaports and the Hinterland from a Coordination Perspective
1 Introduction
2 Problem Description
3 Proposed Coordination Strategies
3.1 Levels of Cooperativeness and Interactions
3.2 Models and Solution Methods
4 Comparison of Different Coordination Strategies
5 Conclusions and Future Directions
References
Autonomous Surface Vessels in Ports: Applications, Technologies and Port Infrastructures
Abstract
1 Introduction
2 Research Framework
3 Applications of ASVs in Ports
3.1 Cargo Transport
3.2 Maritime Service
3.3 Maritime Surveillance
3.4 Maritime Research
4 Development of Ship Technology
4.1 ASV Technologies
4.2 TRL of ASV Technologies
5 Development of Port Infrastructure
5.1 Information Service
5.2 Navigation Assistance
5.3 Shore Control Center
5.4 Terminal
5.5 TRL of Port Infrastructures
6 Scenarios of ASVs in Ports
7 Conclusions
Acknowledgment
References
Survey on Short-Term Technology Developments and Readiness Levels for Autonomous Shipping
1 Introduction
2 ASV Technologies and Technology Readiness Level
2.1 ASV Technologies
2.2 Technology Readiness Levels
3 Technology Developments
3.1 Navigation
3.2 Guidance
3.3 Motion Controller
3.4 Hardware
3.5 Overall Developments
3.6 Short-Term Development
4 Conclusions
References
A UAV-Driven Surveillance System to Support Rescue Intervention
1 Introduction
2 Related Work
3 Overview
3.1 Data Acquisition
3.2 Situation Understanding
3.3 Alert Rescuers
4 Case Study
5 Conclusion
References
Container Handling and Container Terminals
A Literature Review on Container Handling in Yard Blocks
1 Introduction
2 Terminal and Container Handling Operations
3 Literature Review
4 Conclusion
References
A New Lower Bound for the Block Relocation Problem
1 Introduction
2 Lower Bounds for the Restricted BRP
3 A New Lower Bound for the Restricted BRP
4 Computational Results
5 Conclusions
References
The Standard Capacity Model: Towards a Polyhedron Representation of Container Vessel Capacity
1 Introduction
2 Problem Formulation
3 The Standard Capacity Model
4 Experimental Results
4.1 Variable Displacement, Fixed Number of Sections
4.2 Variable Number of Sections, Fixed Displacement
4.3 Stress Forces
5 Conclusion and Future Work
References
Crane Intensity and Block Stowage Strategies in Stowage Planning
1 Introduction
2 Background and Problem Definition
3 LNS Based Matheuristic
3.1 Initial Solution
3.2 Repair Operator
3.3 Destroy Operators
3.4 Acceptance and Termination Criteria
4 Computational Results
4.1 Evaluation of the Compact Model
4.2 Evaluation of the LNS
5 Conclusions
References
Skipping the Storage Phase in Container Transshipment Operations
1 Introduction
2 Related Works
3 Problem Statement
3.1 Notation
3.2 The Mathematical Model
4 Refinement of the DCTP Model
5 Solution Algorithm
6 Computational Experience
6.1 Instance Generator Algorithm
6.2 Lower Bounds for the DCTP
6.3 Analysis of the Results
7 Conclusions
References
Alternative Performance Indicators for Optimizing Container Assignment in a Synchromodal Transportation Network
1 Introduction
2 Minimum Cost Multicommodity Flow on Space-Time Graphs
3 Attributes
3.1 Robustness
3.2 Flexibility
3.3 Customer Satisfaction
4 Conclusions
References
Vehicle Routing and Multi-modal Transportation
The Cost of Continuity in the Collaborative Pickup and Delivery Problem
1 Introduction
2 Literature Review
3 Problem Description
4 Solution Method
5 Computational Study
5.1 Total Collaboration Gain
5.2 The Cost of Continuity
6 Conclusion
References
.28em plus .1em minus .1emA Matheuristic Approach to the Pickup and Delivery Problem with Time Windows
1 Introduction
2 Problem Definition
3 Related Works
4 Proposed Algorithm
4.1 Greedy Constructive Algorithm
4.2 Adaptive Guided Ejection Search (AGES)
4.3 Large Neighborhood Search (LNS)
4.4 Perturbation
4.5 Set Partitioning Problem (SPP)
5 Computational Experiments
5.1 Reimplementation of State-of-the-Art
5.2 Component Selection and Parameter Tuning of IGLS
5.3 Numerical Results of IGLS
6 Conclusion and Future Work
References
Towards Asymptotically Optimal One-to-One PDP Algorithms for Capacity 2+ Vehicles
1 Introduction
1.1 Related Work
1.2 Contribution and Outline
2 An Asymptotically Optimal PDP-C Algorithm
2.1 The Pseudocode
2.2 Analysis of the PDP-C Algorithm
3 A PDP Algorithm
4 Conclusion
References
A Many-to-One Algorithm to Solve a Many-to-Many Matching Problem for Routing
1 Introduction
1.1 Literature Review
1.2 Contribution and Outline
2 Problem Description
3 Solution Approach
3.1 Preprocessing of Path Generation
3.2 Preprocessing of Feasible Matches
3.3 Binary Integer Linear Programming
4 Numerical Experiment
4.1 Preprocessing Performance
4.2 Algorithm Performance
4.3 Sensitivity Analysis
5 Conclusion and Future Research
References
A Heuristic Approach to the Driver and Vehicle Routing Problem
1 Introduction
2 Heuristic Approach
2.1 First Phase: Generation of Drivers' Routes
2.2 Second Phase: Generation of Vehicles' Routes
3 Computational Results
4 Conclusions and Future Research
References
Solving Full-Vehicle-Mode Vehicle Routing Problems Using ACO
Abstract
1 Introduction
2 Vehicle Modes in the VRP
2.1 Full Vehicle Mode
2.2 The Pheromone Setting for Vehicle Types in ACO
2.3 The Selection Mechanism for Different Vehicle Types in ACO
3 Computational Experiments
3.1 Project Background
3.2 Benchmarks
4 Conclusions
Acknowledgements
References
Optimising Routing in an Agent-Centric Synchromodal Network with Shared Information
1 Introduction
2 Literature Review
3 Models
3.1 Assumptions
3.2 Description of Simulation
3.3 Public Information Models
3.4 Full Information Model
4 Results
5 Conclusions
References
Adapting the A* Algorithm to Increase Vehicular Crowd-Sensing Coverage
1 Introduction
2 Vehicular Crowd-Sensing
3 The Proposed Routing Algorithm
3.1 The A* Algorithm
3.2 The Proposed Solution
4 Experimental Design
4.1 The Dataset
4.2 Experimental Procedure
5 Results and Discussion
6 Conclusion
References
Pricing Car-Sharing Services in Multi-Modal Transportation Systems: An Analysis of the Cases of Copenhagen and Milan
1 Introduction
2 Problem Description
3 Mathematical Model
3.1 Modeling Assumption
3.2 Notation and Model
4 The Cases of Copenhagen and Milan
4.1 Utility Function
4.2 Characteristics of the Cities
4.3 Results for the Base Case
4.4 Factors Influencing Car-Sharing Services
5 Conclusions
A Attributes of the Origin-Destination Pairs Considered
References
Network Design and Scheduling
Exact Methods and Heuristics for the Liner Shipping Crew Scheduling Problem
1 Introduction
1.1 The Crew Scheduling Problem
1.2 Literature Review
2 Models
2.1 Integer Model
2.2 Set Covering Model
2.3 Column Generation Heuristic
2.4 Greedy Heuristic Used as Benchmark
3 Data and Results
3.1 Data
3.2 Results Using Integer Model
4 Conclusion
References
The Balanced Dispatching Problem in Passengers Transport Services on Demand
1 Introduction
2 Statement of the Problem
3 The Online Dispatching Algorithm
4 Computational Experiments
5 Final Remarks
References
Scheduling Assistance for Passengers with Special Needs in Large Scale Airports
1 Introduction
1.1 Motivation for This Research
2 Mathematical Formulation and Complexity
3 Lower Bounds
4 An Heuristic Algorithm
4.1 The Algorithm
4.2 Computational Experiments
4.3 Conclusions
References
A Study on Travel Time Stochasticity in Service Network Design with Quality Targets
1 Introduction
2 Problem Description
3 Model Formulation
4 Experimental Plan
4.1 Instances and Scenario Generation
5 Experimental Results and Analysis
5.1 Evaluation Analysis: Benefits of Stochastic Formulation
5.2 Structural Analysis: Reducing Delay Risk Techniques
5.3 Comparative Analysis: Impact of Parameters
6 Conclusion
References
Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval
1 Introduction
2 Related Works
3 Contributions
4 Case Under MNA Interval
4.1 The Improved Procedure
4.2 Algorithm DP is an Improved FPTAS
5 Consequences: An Improved FPTAS for the ONA Case
6 Conclusion
References
Selected Topics in Logistics Oriented Combinatorial Optimization
Smoothing the Outflow of Stock from Picking Lines in a Distribution Centre
1 Introduction
2 The Distribution Network
3 Literature
4 Model
4.1 Assumptions
4.2 Sets, Parameters and Variables Used in the Models
4.3 Model 1: Limit Deadline, Minimise Outflow Above Target Level
4.4 Model 2: Limit Outflow, Minimise Days Late on Out-of-DC Date
4.5 Data and Implementation
5 Results
6 Conclusions, Recommendations and Future Work
References
An Effective Structural Iterative Refinement Technique for Solving the Quadratic Assignment Problem
1 Introduction
2 Related Work
3 The PASS
4 Computational Experiments
5 Concluding Remarks
References
Application of MILP to Strategic Sourcing of High-Cost Medical Devices and Supplies
Abstract
1 Introduction
2 The Business Setting
3 Introducing Balanced Scorecards as Procurement Constraints
4 The MILP Model
5 Data for the Planning Scenarios
6 MILP Solution Process
7 Sample Results
8 Conclusion
References
Location of Electric Vehicle Charging Stations Under Uncertainty on the Driving Range
Abstract
1 Introduction and Related Literature
2 Expected Flow Refueling Location Problem (EFRLP)
2.1 Problem Description
2.2 Mathematical Formulation (EFRLM1)
2.3 Mathematical Formulation (EFRLM2)
3 Solving the Problem Using a Tabu Search Procedure
4 Numerical Experiments
4.1 Test Instances
4.2 Numerical Results
5 Conclusion
References
Author Index

System requirements

Save as PDF Copy link into clipboard

Schweitzer Fachinformationen

Computational Logistics

Description

More details

Other editions

Additional editions

Content

System requirements