default search action
ICCL 2011: Hamburg, Germany
- Jürgen Böse, Hao Hu, Carlos Jahn, Xiaoning Shi, Robert Stahlbock, Stefan Voß:
Computational Logistics - Second International Conference, ICCL 2011, Hamburg, Germany, September 19-22, 2011. Proceedings. Lecture Notes in Computer Science 6971, Springer 2011, ISBN 978-3-642-24263-2
Transport Services
- Heiner Ackermann, Hendrik Ewe, Herbert Kopfer, Karl-Heinz Küfer:
Combinatorial Auctions in Freight Logistics. 1-17 - Tobias Buer, Herbert Kopfer:
Shipper Decision Support for the Acceptance of Bids during the Procurement of Transport Services. 18-28 - Joachim R. Daduna:
Aspects of Information Management in Road Freight Transport. 29-43 - Halil Ibrahim Gündüz:
The Single-Stage Location-Routing Problem with Time Windows. 44-58 - Tai-Yu Ma:
A Cross Entropy Multiagent Learning Algorithm for Solving Vehicle Routing Problems with Time Windows. 59-73 - Dorota Slawa Mankowska, Christian Bierwirth, Frank Meisel:
Modelling the Synchronization of Transport Means in Logistics Service Operations. 74-85 - Pamela C. Nolz, Nabil Absi, Dominique Feillet:
Optimization of Infectious Medical Waste Collection Using RFID. 86-100 - Hanne L. Petersen, Stefan Ropke:
The Pickup and Delivery Problem with Cross-Docking Opportunity. 101-113 - Tingting Ruan, Hao Hu:
Application of an RFID-Based System for Construction Waste Transport: A Case in Shanghai. 114-126 - Patrick Vogel, Dirk C. Mattfeld:
Strategic and Operational Planning of Bike-Sharing Systems by Data Mining - A Case Study. 127-141
Logistics Systems and Production
- Peter Großkurth, Robert Stahlbock, Stefan Voß:
Economic Impacts of the Alternative Reuse of Empty ISO Containers. 142-159 - René Haijema:
Optimal Issuing of Perishables with a Short Fixed Shelf Life. 160-169 - Dag Haugland, Mujahed Eleyat, Magnus Lie Hetland:
The Maximum Flow Problem with Minimum Lot Sizes. 170-182 - Loecelia Ruvalcaba, Gabriel Correa, Vittorio Zanella:
Multiobjective Evolutionary Algorithm for Redesigning Sales Territories. 183-193 - Tobias Winkelkotte:
Optimizing Complex Logistics Systems with Approximative Consideration of Short-Term Costs. 194-208
Maritime Shipping and Container Terminals
- Lei Hu, Xiaoning Shi, Stefan Voß, Weigang Zhang:
Application of RFID Technology at the Entrance Gate of Container Terminals. 209-220 - Shell-Ying Huang, Xi Guo, Mei Mei Lau:
A Three-Level Hierarchical Workload Management Scheme for Yard Cranes in Container Terminals. 221-232 - Jian Gang Jin, Jin Xin Cao, Jiang Hang Chen, Der-Horng Lee:
A Service-Oriented Model for the Yard Management Problem in Container Terminals. 233-242 - Jan Klaws, Robert Stahlbock, Stefan Voß:
Container Terminal Yard Operations - Simulation of a Side-Loaded Container Block Served by Triple Rail Mounted Gantry Cranes. 243-255 - Fan Liu, Malcolm Yoke Hean Low, Wen-Jing Hsu, Shell-Ying Huang, Min Zeng, Cho Aye Win:
Randomized Algorithm with Tabu Search for Multi-Objective Optimization of Large Containership Stowage Plans. 256-272 - Fotini Malliappi, Julia A. Bennell, Chris N. Potts:
A Variable Neighborhood Search Heuristic for Tramp Ship Scheduling. 273-285 - Dario Pacino, Alberto Delgado, Rune Møller Jensen, Tom Bebbington:
Fast Generation of Near-Optimal Plans for Eco-Efficient Stowage of Large Container Vessels. 286-301 - Xiaoning Shi, Stefan Voß:
Game Theoretical Aspects in Modeling and Analyzing the Shipping Industry. 302-320 - Ulf Speer, Gerlinde John, Kathrin Fischer:
Scheduling Yard Cranes Considering Crane Interference. 321-340 - Elisabeth Zehendner, Nabil Absi, Stéphane Dauzère-Pérès, Dominique Feillet:
Solving the Resource Allocation Problem in a Multimodal Container Terminal as a Network Flow Problem. 341-353 - Sebastian Zurheide, Kathrin Fischer:
A Simulation Study for Evaluating a Slot Allocation Model for a Liner Shipping Network. 354-369
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.