Daduna / Voß / Liedtke | Computational Logistics | Buch | 978-3-031-43611-6 | sack.de

Buch, Englisch, Band 14239, 552 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 850 g

Reihe: Lecture Notes in Computer Science

Daduna / Voß / Liedtke

Computational Logistics

14th International Conference, ICCL 2023, Berlin, Germany, September 6¿8, 2023, Proceedings

Buch, Englisch, Band 14239, 552 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 850 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-031-43611-6
Verlag: Springer Nature Switzerland


This book constitutes the refereed proceedings of the 13th International Conference on Computational Logistics, ICCL 2023, held in Berlin, Germany, during September 6-8, 2023.

The 32 full papers presented in this volume were carefully reviewed and selected from 71 submissions.

They are grouped into the following topics: computational logistics; maritime shipping; vehicle routing; traffic and transport; and combinatorial optimization.
Daduna / Voß / Liedtke Computational Logistics jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Successfully Using ChatGPT in Logistics: Are We There Yet?.- When Routing Meets Recommendation: Solving Dynamic Order Recommendations Problem in Peer-to-Peer Logistics Platforms.- A Reactive-Periodic Hybrid Optimization for Internal Hospital Logistics.- Cybersecurity Considerations for the Design of a Digital Twin Enabled AI-Driven Real-Time Distributed Optimization of Container Carbon Emissions Reduction for Synchromodal Freight Operations.- Customer’s Choice in the Context of Cross-border E-Commerce: An Application of SEM.- Towards a Deep Reinforcement Learning Model of Master Bay Stowage Planning.- The Dynamic RORO Stowage Planning Problem.- Allocation of shore side electricity: The case of the Port of Hamburg.- Stockyard storage space allocation in dry bulk terminals considering mist cannons and energy expenditure.- Planning LNG Annual Delivery Programs with Speed Optimization and Multiple Loading Ports.- Tramp Ship Routing with Bunker Optimization and Flexible CargoQuantities: Case from Dry Bulk Shipping.- Digital Twins in Seaports: Current and Future Applications.- Using Neural Networks for ETA Prediction in inland waterway transport.- A Regret Policy For The Dynamic Vehicle Routing Problem With Time Windows.- A Tabu Search Algorithm for the Traveling Purchaser Problem with Transportation Time Limit.- GRASP solution approach for the e-waste collection problem.- The heterogeneous fleet risk-constrained vehicle routing problem in humanitarian logistics.- The Snow Grooming Routing Problem.- A constraint programming model for the vehicle routing problem with multiple time windows.- A Variable Neighborhood Search Algorithm for the Truck-Drone Routing Problem.- Prediction and Analysis of Transit Ferries Travel Time: An Open Data-Based Case Study.- A Bi-objective Column Generation Approach for Real-World Rolling Stock Circulation Planning Problems.- An Effective Matheuristic Approach for Robust Bus Driver Rostering with Uncertain Daily Working Hours.-Beyond Cargo Hitching: Combined People and Freight Transport Using Dynamically Configurable Autonomous Vehicles.- Impact of Public Transport Development on Health Care Services in Rural Areas.- Ridesharing in Rural Areas with Autonomous Electric Vehicles and Interrelated Trips.- Operational integration of supply chain activities with earliness and tardiness considerations.- Constrained Multi-Agent Path Planning Problem.- UAV Path Planning for Area Coverage and Energy Consumption in Oil and Gas Exploration Environment.- Minimizing peak energy demand in exible job shops.- Carbon-Aware Mine Planning with a Novel Multi-Objective Framework.- Multi-product lot-sizing problem with remanufacturing, lost sales and sequence-dependent changeover cost.- A radius-based approach for the bi-objective p-center and p-dispersion problem


Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.