Skip to main content

2011 | Buch

Computational Logistics

Second International Conference, ICCL 2011, Hamburg, Germany, September 19-22, 2011. Proceedings

herausgegeben von: Jürgen W. Böse, Hao Hu, Carlos Jahn, Xiaoning Shi, Robert Stahlbock, Stefan Voß

Verlag: Springer Berlin Heidelberg

Buchreihe : Lecture Notes in Computer Science

insite
SUCHEN

Über dieses Buch

This book constitutes the refereed proceedings of the Second International Conference on Computational Logistics, ICCL 2011, held in Hamburg, Germany, in September 2011.

The 26 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on transport services, logistics systems and production, and maritime shipping and container terminals.

Inhaltsverzeichnis

Frontmatter

Transport Services

Combinatorial Auctions in Freight Logistics
Abstract
Freight business is a huge market with strong competition. In many companies, planning and routing software has been introduced, and optimization potentials have been widely exploited. To further improve efficiency, especially the small and medium sized carriers have to cooperate beyond enterprise boundaries. A promising approach to exchange transportation requests between freight carriers is provided by combinatorial auctions and exchanges. They allow bundles of items to be traded, thereby allowing participants to express complex synergies.
In this paper we discuss various goals for a combinatorial request exchange in freight logistics and provide the reasoning for our design decisions. All goals aim to improve usefulness in a practical environment of less-than-truckload (LTL) carriers. We provide experimental results for both generated and real-life data that show significant savings and are often close to a heuristic solution for the global optimization problem. We study how bundling and restricting the number of submitted bids affect the solution quality.
Heiner Ackermann, Hendrik Ewe, Herbert Kopfer, Karl-Heinz Küfer
Shipper Decision Support for the Acceptance of Bids during the Procurement of Transport Services
Abstract
Combinatorial reverse auctions can be used by shippers in order to procure transportation services from carriers. After carriers have submitted their bids, a shipper has to decide about the allocation of transport services to carriers, i.e., a shipper has to solve the winner determination problem of the auction. This paper focuses on a bicriteria winner determination problem in which a shipper has to select a subset of the set of bids and simultaneously decide about the desired trade-off between total transportation costs and the quality of the entire transportation services. To solve this bicriteria optimization problem a metaheuristic is developed that computes a set of non-dominated solutions based on the concepts of multi-start, large neighborhood search and a bicriteria branch-and-bound procedure. Compared to previous results in the literature, the proposed algorithm is able to improve the set of non-dominated solutions for 14 out of 30 benchmark instances.
Tobias Buer, Herbert Kopfer
Aspects of Information Management in Road Freight Transport
Abstract
For freight transport (and in particular road freight transport) the availability of a suitable (intra- and inter-organizational) information management is of decisive significance. Therefore, the technical (and organizational) framework as well as the essential instruments will be presented and analyzed. This will be followed by an examination of the operational planning and the operations of the road freight transport where economic factors influence the discussion as well as ecological aspects. It will be illustrated that an intelligent linkage between different elements of the information and communication technology and the automotive engineering as well as with the transport infrastructure leads to a significant improvement regarding the operational processes in road freight transport. This does not only refer to the costs of transport operations but also reflects positive ecological effects and improvements of transport security.
Joachim R. Daduna
The Single-Stage Location-Routing Problem with Time Windows
Abstract
The well-known capacitated facility location problem (CFLP) and the vehicle routing problem with time windows (VRPTW) have been studied intensively over the last decades. In most distribution systems, depot location and routing decisions are implemented independently. Low-quality solutions are obtained if a sequential method, e.g., locate depots first and plan routes second, is used. In location-routing problems (LRP), location and routing are solved simultaneously. Here, our goal is to combine the CFLP and the VRPTW into a single-stage LRP with time windows (SSLRPTW), which covers more realistic aspects, especially time aspects, of many real problems. In order to efficiently solve the SSLRPTW for large-scale instances, a tabu search heuristic is proposed. This method outperforms the used sequential method.
Halil Ibrahim Gündüz
A Cross Entropy Multiagent Learning Algorithm for Solving Vehicle Routing Problems with Time Windows
Abstract
The vehicle routing problem with time windows (VRPTW) has been the subject of intensive study because of its importance in real applications. In this paper, we propose a cross entropy multiagent learning algorithm, which considers an optimum solution as a rare event to be learned. The routing policy is node-distributed, controlled by a set of parameterized probability distribution functions. Based on the performance of experienced tours of vehicle agents, these parameters are updated iteratively by minimizing Kullback-Leibler cross entropy in order to generate better solutions in next iterations. When applying the proposed algorithm on Solomon’s 100-customer problem set, it shows outperforming results in comparison with the classical cross entropy approach. Moreover, this method needs only very small number of parameter settings. Its implementation is also relatively simple and flexible to solve other vehicle routing problems under various dynamic scenarios.
Tai-Yu Ma
Modelling the Synchronization of Transport Means in Logistics Service Operations
Abstract
Synchronization of vehicle operations plays an important role for logistics service providers. Examples of logistics businesses with synchronization requirements can be found, e.g., in swap trailer transportation and truck-meets-truck traffic. In this paper, we provide a classification of the various types of synchronization requirements for transport means in logistics applications. For supporting the planning of logistics service operations, we formulate a new mixed-integer programming model for vehicle routing, where vehicle routes are synchronized at fixed and given points. Computational results are provided for assessing the solvability of the model under various problem settings.
Dorota Slawa Mankowska, Christian Bierwirth, Frank Meisel
Optimization of Infectious Medical Waste Collection Using RFID
Abstract
In this paper we consider the collection of infectious medical waste, produced by patients in self-treatment and stored at pharmacies. The problem is formulated as a collector-managed inventory routing problem, encompassing stochastic aspects, which are common in such problems. Social objectives, specifically the satisfaction of pharmacists and the local authority, as well as the minimization of public health risks, are considered for the real-world motivated inventory routing problem. To optimize the planning process for a predefined time horizon, we take advantage of radio frequency identification technologies. We design a tabu search based algorithm to optimize the determination of visit dates and corresponding vehicle routes. The suggested approach is tested on real-world data from the region of Provence-Alpes-Côte d’Azur, in France. The results for different waste collection scenarios are analyzed and compared in order to evaluate the performance of the proposed solution method.
Pamela C. Nolz, Nabil Absi, Dominique Feillet
The Pickup and Delivery Problem with Cross-Docking Opportunity
Abstract
In this paper, we consider the pickup and delivery problem with cross-docking opportunity (PDPCD). The problem arises from an industry application, and includes pickup requests, delivery requests, and pickup-and-delivery requests. Each pickup-and-delivery request can be served either as direct delivery by one truck, or by being picked up and transported to the cross-dock by one vehicle, and subsequently delivered at its final destination by another vehicle. Handling times at customers sites and terminal are given. A typical daily instance includes 500–1,000 requests. We solve the problem using a Large Neighborhood Search (LNS) approach.
Hanne L. Petersen, Stefan Ropke
Application of an RFID-Based System for Construction Waste Transport: A Case in Shanghai
Abstract
Effective management of construction waste imposes a big challenge to cities with large volume of construction activities. Shanghai had to handle these problems in preparing the 2010 World Expo such as overloading of the trucks, traffic safety on the road, environment pollution, and heavy manpower needed to supervise the transport process. This paper presents our effort of applying Radio Frequency Identification (RFID) technology to reengineer the construction waste transport. Details of the new RFID-based system are introduced with an in-depth comparison with the traditional system. A Fuzzy Comprehensive Evaluation (FCE) method is used to validate the effectiveness of the new system. Case studies in Shanghai show that the RFID-based system helps to better monitor the transportation procedure and to avoid the existing problems significantly. On the other hand, it shows that stakeholders such as project owners and transport contractors are not always satisfied with the governments’ strong position in the new system, which might prevent the wide application of RFID technology in construction waste transport.
Tingting Ruan, Hao Hu
Strategic and Operational Planning of Bike-Sharing Systems by Data Mining – A Case Study
Abstract
Bike-sharing is a new form of sustainable urban public mobility. A common issue observed in bike-sharing systems is imbalances in the distribution of bikes. There are two logistical measures alleviating imbalances: strategic network design and operational repositioning of bikes. IT-systems record data from Bike Sharing Systems (BSS) operation that are suitable for supporting these logistical tasks. A case study shows how Data Mining applied to operational data offers insight into typical usage patterns of bike-sharing systems and is used to forecast bike demand with the aim of supporting and improving strategic and operational planning.
Patrick Vogel, Dirk C. Mattfeld

Logistics Systems and Production

Economic Impacts of the Alternative Reuse of Empty ISO Containers
Abstract
With hundreds of thousands of ISO containers rejected from the world’s container fleet every year due to age or empty container accumulation problems, the question of their potential reuse for other purposes arises. Moreover, beside the ecological impacts the economic impacts of the different reuses are of great interest as such recycling activities may provide cost and energy saving opportunities. Next to providing some background information about containers and empty container management, this paper investigates the scale of containers that enter the secondary market, different ways in which they can be put to new use and several concepts of economic impacts resulting from the repurposing activities. Furthermore, it suggests promising research opportunities in particular with respect to the use of information systems and modern communication and information technology (IT) for planning and control of container flows and alternative reuse of containers.
Peter Großkurth, Robert Stahlbock, Stefan Voß
Optimal Issuing of Perishables with a Short Fixed Shelf Life
Abstract
The management of inventories of perishable products with a short maximal shelf life takes a good issuing policy next to a good ordering policy. Ordering policies of non-perishables are well studied in literature and implemented in Automated Store Ordering (ASO) systems and Computer Assisted Ordering (CAO) systems. These ordering policies are stock-level dependent and do not take the product ages into account. As a consequence when applied to perishable products they do not anticipate expected future outdating of products and thus result in unnecessary outdating and shortages. Improved ordering policies are proposed in the literature but hardly implemented in ASO and CAO systems as these are designed for the management of non-perishables. Without changing the order policies of such systems one may reduce outdating and shortages by issuing the products in a sophisticated way. We present therefore a stochastic model that is solved by stochastic dynamic programming.
René Haijema
The Maximum Flow Problem with Minimum Lot Sizes
Abstract
In many transportation systems, the shipment quantities are subject to minimum lot sizes in addition to regular capacity constraints. That is, either the quantity must be zero, or it must be between the two bounds. In this work, we consider a directed graph, where a minimum lot size and a flow capacity are defined for each arc, and study the problem of maximizing the flow from a given source to a given terminal. We prove that the problem is NP-hard. Based on a straightforward mixed integer programming formulation, we develop a Lagrangean relaxation technique, and demonstrate how this can provide strong bounds on the maximum flow. For fast computation of near-optimal solutions, we develop a heuristic that departs from the zero solution and gradually augments the set of flow-carrying (open) arcs. The set of open arcs does not necessarily constitute a feasible solution. We point out how feasibility can be checked quickly by solving regular maximum flow problems in an extended network, and how the solutions to these subproblems can be productive in augmenting the set of open arcs. Finally, we present results from preliminary computational experiments with the construction heuristic.
Dag Haugland, Mujahed Eleyat, Magnus Lie Hetland
Multiobjective Evolutionary Algorithm for Redesigning Sales Territories
Abstract
Redesigning sales territories is a strategic activity that seeks to improve customer’s service level, sales costs and the quality’s life of the salesmen to gain a competitive advantage in the market. In this paper we propose a multiobjective evolutionary algorithm for redesigning sales territories inspired by a company dedicated to sell products along Mexico. One objective seeks to minimize new turnover variation against the current ones of the salesmen. The other objective looks at compacting territories through minimizing the sum of the distance traveled of its salesmen. Each territory is restricted to a maximum workload and the conservation of the residence places of the salesmen in new territorial configurations. Through an evolutionary algorithm we seek to solve large instances that have not been solved by an exact method.
Loecelia Ruvalcaba, Gabriel Correa, Vittorio Zanella
Optimizing Complex Logistics Systems with Approximative Consideration of Short-Term Costs
Abstract
This paper provides an approach which optimizes complex logistics networks strategically, considering the total operational and tactical costs. Real-world-sized instances of models which consider the costs of all time-horizons exactly are very complex and very difficult to solve. Beside this it does not make much sense to completely plan operational details (that will never be executed later on). So, we formulate a model which uses an appropriate approximation of short-term costs. This makes the model and the solution process much easier. But the model turns out to be very complex, nevertheless. So we introduce a heuristic to solve it and to gain a satisfactory solution.
Tobias Winkelkotte

Maritime Shipping and Container Terminals

Application of RFID Technology at the Entrance Gate of Container Terminals
Abstract
Radio Frequency Identification refers to using transponders or tags affiliated with an object for the purpose of identification and tracking by means of radio waves. This paper focuses on container port operations, emphasizing on the current status of these operations and its business bottlenecks. Based on that, we discuss related solutions for improving efficiency from the perspective of orderly balance and seamless connection in different operational processes at the entrance gate of container terminals.
Lei Hu, Xiaoning Shi, Stefan Voß, Weigang Zhang
A Three-Level Hierarchical Workload Management Scheme for Yard Cranes in Container Terminals
Abstract
We propose a three-level, hierarchical scheme for yard crane (YC) workload management in container terminals. Level 1 distributes YCs among different rows in the storage yard at suitable times based on predicted future workload. This is done a few times during a shift of 8 hours. Level 2 dispatches YCs to work in various non-overlapping working zones in each row for the time window in between two rounds of YC re-distributions at Level 1. Level 3 determines the serving sequences of vehicle jobs for an YC in a working zone over a period of time (e.g., a sub-planning window). The algorithms for levels 2 and 3 have been published elsewhere. This paper proposes the proportional distribution and the uniform distribution strategies for YC deployment at level 1. We compare the performance of the three-level hierarchical scheme in terms of average job waiting times and the average number of overflow jobs at the end of each planning window under the two distribution strategies.
Shell Ying Huang, Xi Guo, Mei Mei Lau
A Service-Oriented Model for the Yard Management Problem in Container Terminals
Abstract
This study proposes a novel service-oriented model for the yard management problem in container terminals. Two decisions of the yard management problem are integrated instead of being solved hierarchically: storage allocation for containers that arrive in near future and yard crane (YC) deployment for assigning yard cranes over the entire storage yard. A concept of YC assignment profile is proposed in order to take into account the requirement of YC work patterns. The problem is formulated as a mixed integer linear program with the objective of minimizing total delayed workload and YC movement penalty as well as the total container moving distance. A rolling horizon approach (RHA) is developed to obtain good solutions in an efficient manner.
Jian Gang Jin, Jin Xin Cao, Jiang Hang Chen, Der-Horng Lee
Container Terminal Yard Operations – Simulation of a Side-Loaded Container Block Served by Triple Rail Mounted Gantry Cranes
Abstract
When thinking about automated operations, ports and terminal operators worldwide are investigating new technology to increase the efficiency and throughput of their terminals. Recently, double and triple rail mounted gantry crane solutions have been considered and are already in use or currently implemented. While in a latest configuration, a pair of twin cranes running on the same rails in addition to a large cross-over crane running on its own rails is used, it seems not yet clear to which extent using three cranes in one block or stack is profitable even if cross-over cranes are not considered. This paper investigates the possible productivity increase for a side-loaded block layout when two or three rail mounted gantry cranes are used.
Jan Klaws, Robert Stahlbock, Stefan Voß
Randomized Algorithm with Tabu Search for Multi-Objective Optimization of Large Containership Stowage Plans
Abstract
This paper describes a randomized algorithm with Tabu Search (TS) for multi-objective optimization of large containership stowage plans. The algorithm applies a randomized block-based container allocation approach to obtain a Pareto set of stowage plans from a set of initial solutions in the first stage, and uses TS to carry out multi-objective optimization on the Pareto set of stowage plans in the second stage. Finally, a group of non-dominated solutions is generated based on objectives such as the number of re-handles, the completion time of the longest crane, the number of stacks that exceed the weight limit, the number of idle slots, horizontal moment difference and cross moment difference. Experimental results based on real data show that the proposed algorithm is able to obtain better stowage plans compared with human planners.
Fan Liu, Malcolm Yoke Hean Low, Wen Jing Hsu, Shell Ying Huang, Min Zeng, Cho Aye Win
A Variable Neighborhood Search Heuristic for Tramp Ship Scheduling
Abstract
This paper considers a classical ship scheduling problem in which the routing and scheduling of a heterogeneous fleet of ships with time windows for pick-ups and deliveries at multiple ports is required. Assuming fixed ship speeds, the problem of maximising profit is addressed. A variable neighborhood search metaheuristic is proposed for this problem. A computational evaluation compares this variable neighborhood search procedure with multi-start local search and a previous tabu search approach. Computational results show that variable neighborhood search provides both the best-quality solutions and the fastest computation time compared to multi-start and tabu search.
Fotini Malliappi, Julia A. Bennell, Chris N. Potts
Fast Generation of Near-Optimal Plans for Eco-Efficient Stowage of Large Container Vessels
Abstract
Eco-efficient stowage plans that are both competitive and sustainable have become a priority for the shipping industry. Stowage planning is NP-hard and is a challenging optimization problem in practice. We propose a new 2-phase approach that generates near-optimal stowage plans and fulfills industrial time and quality requirements. Our approach combines an integer programming model for assigning groups of containers to storage areas of the vessel over multiple ports, and a constraint programming and local search procedure for stowing individual containers.
Dario Pacino, Alberto Delgado, Rune Møller Jensen, Tom Bebbington
Game Theoretical Aspects in Modeling and Analyzing the Shipping Industry
Abstract
The shipping industry is known for providing transport service in terms of deploying vessels and accessing ports, making shipping one of the network-based services. From the perspective of traditional as well as neo-economics, shipping is assumed to pursue profit maximization subject to scarce resources, e.g. capital, assets, seafarers, or binding constraints derived from schedules, etc. Players could be any of the following: linkage operators, e.g. liner shipping carriers, port operators, freight forwarders, customs, hinterland haulage carriers, inland navigation carriers, market regulators, etc. Taking into account interdependencies and inter-relations, game theory provides a meaningful way to model and analyze behaviors of the involved players. In this paper we provide a survey on game theoretical approaches within the shipping industry.
Xiaoning Shi, Stefan Voß
Scheduling Yard Cranes Considering Crane Interference
Abstract
Automated stacking cranes form the heart of modern container terminals. Hence, their productivity has a major influence on the performance of the terminal. In the first part of this paper, the yard crane scheduling problem and its practical relevance from the point of view of the Container Terminal Altenwerder (CTA) in Hamburg, Germany, is described. In Altenwerder, 26 yard blocks orthogonal to the quay with transfer areas at both ends of each block are operated with double rail mounted gantries (DRMG). In the second part of the paper, an outline of a new scheduling algorithm for yard cranes on this particular layout is given. The procedure minimizes delays for the jobs and the cycle times of the cranes. In addition to in-motion times also other parts of the cycle time, as waiting and blocking times resulting from other cranes, are taken into account in the scheduling approach. A branch and bound algorithm is used to create sequences of jobs for each crane. Using a simulation model, both the influence of the length of these sequences and the impact of technical breakdowns on the results are analysed. Finally, the results are verified with operational data and the applicability for practice at the CTA is evaluated.
Ulf Speer, Gerlinde John, Kathrin Fischer
Solving the Resource Allocation Problem in a Multimodal Container Terminal as a Network Flow Problem
Abstract
Continuously increasing global container trade and pressure from a limited number of large shipping companies are enforcing the need for efficient container terminals. By using internal material handling resources efficiently, transfer times and operating costs are reduced. We focus our study on container terminals using straddle carriers (SC) for transportation and storage operations. We assume that SCs are shared among maritime and inland transport modes (truck, train, barge). The problem is thus to decide how many resources to allocate to each transport mode in order to minimize vehicle (vessel, truck, train, barge) delays. We present a mixed integer linear programming model, based on a network flow representation, to solve this allocation problem. The modular structure of the model enables us to represent different container terminals, transport modes and service strategies. We present parts of our model and exemplary applications for a terminal at the “Grand Port Maritime de Marseille” in France.
Elisabeth Zehendner, Nabil Absi, Stéphane Dauzère-Pérès, Dominique Feillet
A Simulation Study for Evaluating a Slot Allocation Model for a Liner Shipping Network
Abstract
Revenue management (RM) methods are still only rarely used in the liner shipping industry. Usually, skilled employees make the decisions whether to accept or reject a booking and decision support systems are not commonly used. But for maximizing a company’s profit it can be crucial to make the right decisions for each booking request and therefore such a system can make an important contribution to success. In this work, a discrete-event simulation model for container bookings is developed, including a quantitative slot allocation model which takes into account different segmentations, the network structure of liner shipping with the possibility of transshipments, and the existence of different round trips of ships on the services. With a simulation study, different scenarios, networks and input settings can be evaluated regarding their performance, to determine the best strategy for the company. In this study, the incoming bookings are simulated and the decision whether a booking is to be accepted or rejected is based on the capacity that is available in the respective booking class according to the solution of the slot allocation model. This booking limit (BL) strategy is compared to a ”first come first serve” (FCFS) strategy and to an optimal strategy (OS) which is based on the assumption that all bookings are known in advance. The results show that the BL strategy is recommendable for liner shipping companies, as it leads to significant profit increases compared to FCFS.
Sebastian Zurheide, Kathrin Fischer
Backmatter
Metadaten
Titel
Computational Logistics
herausgegeben von
Jürgen W. Böse
Hao Hu
Carlos Jahn
Xiaoning Shi
Robert Stahlbock
Stefan Voß
Copyright-Jahr
2011
Verlag
Springer Berlin Heidelberg
Electronic ISBN
978-3-642-24264-9
Print ISBN
978-3-642-24263-2
DOI
https://doi.org/10.1007/978-3-642-24264-9