2,533 research outputs found
Models for intermodal depot selection
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Ocean Engineering, 1997.Includes bibliographical references (p. 154-157).Qiang Gao.Ph.D
Robust optimisation of dry port network design in the container shipping industry under uncertainty
PhD ThesisThe concept of dry port has attracted the attention of many researchers in the field of containerised
transport industry over the past few decades. Previous research on dry port container network
design has dealt with decision-making at different levels in an isolated manner. The purpose of
this research is to develop a decision-making tool based on mathematical programming models to
integrate strategic level decisions with operational level decisions. In this context, the strategic
level decision making comprises the number and location of dry ports, the allocation of customers
demand, and the provision of arcs between dry ports and customers within the network. On the
other hand, the operational level decision making consists of containers flow, the selection of
transportation modes, empty container repositioning, and empty containers inventory control. The
containers flow decision involves the forward and backward flow of both laden and empty
containers. Several mathematical models are developed for the optimal design of dry port networks
while integrating all these decisions.
One of the key aspects that has been incorporated in this study is the inherent uncertainty of
container demands from end customers. Besides, a dynamic setting has to be adopted to consider
the inevitable periodic fluctuation of demands. In order to incorporate the abovementioned
decision-making integration with uncertain demands, several models are developed based on twostage stochastic programming approach. In the developed models, the strategic decisions are made
in the first stage while the second-stage deals with operational decisions. The models are then
solved through a robust sample average approximation approach, which is improved with the
Benders Decomposition method. Moreover, several acceleration algorithms including multi-cut
framework, knapsack inequalities, and Pareto-optimal cut scheme are applied to enhance the
solution computational time.
The proposed models are applied to a hypothetical case of dry port container network design in
North Carolina, USA. Extensive numerical experiments are conducted to validate the dry port
network design models. A large number of problem instances are employed in the numerical
experiments to certify the capability of models. The quality of generated solutions is examined via
a statistical validation procedure. The results reveal that the proposed approach can produce a
reliable dry port container network under uncertain environment. Moreover, the experimental
results underline the sensitivity of the configuration of the network to the inventory holding costs
iii
and the value of coefficients relating to model robustness and solution robustness. In addition, a
number of managerial insights are provided that may be widely used in container shipping
industry: that the optimal number of dry ports is inversely proportional to the empty container
holding costs; that multiple sourcing is preferable when there are high levels of uncertainty; that
rail tends to be better for transporting laden containers directly from seaports to customers with
road being used for empty container repositioning; service level and fill rate improve when the
design targets more robust solutions; and inventory turnover increases with high levels of holding
cost; and inventory turnover decreases with increasing robustness
Inventory routing for dynamic waste collection
We consider the problem of collecting waste from sensor equipped underground containers.
These sensors enable the use of a dynamic collection policy. The problem, which is known
as a reverse inventory routing problem, involves decisions regarding routing and container selection.
In more dense networks, the latter becomes more important. To cope with uncertainty in
deposit volumes and with fluctuations due to daily and seasonal e ects, we need an anticipatory
policy that balances the workload over time. We propose a relatively simple heuristic consisting
of several tunable parameters depending on the day of the week. We tune the parameters of this
policy using optimal learning techniques combined with simulation. We illustrate our approach
using a real life problem instance of a waste collection company, located in The Netherlands, and
perform experiments on several other instances. For our case study, we show that costs savings
up to 40% are possible by optimizing the parameters
Models and Solutions Algorithms for Improving Operations in Marine Transportation
International seaborne trade rose significantly during the past decades. This created the need to improve efficiency of liner shipping services and marine container terminal operations to meet the growing demand. The objective of this dissertation is to develop simulation and mathematical models that may enhance operations of liner shipping services and marine container terminals, taking into account the main goals of liner shipping companies (e.g., reduce fuel consumption and vessel emissions, ensure on-time arrival to each port of call, provide vessel scheduling strategies that capture sailing time variability, consider variable port handling times, increase profit, etc.) and terminal operators (e.g., decrease turnaround time of vessels, improve terminal productivity without significant capital investments, reduce possible vessel delays and associated penalties, ensure fast recovery in case of natural and man-made disasters, make the terminal competitive, maximize revenues, etc.). This dissertation proposes and models two alternatives for improving operations of marine container terminals: 1) a floaterm concept and 2) a new contractual agreement between terminal operators. The main difference between floaterm and conventional marine container terminals is that in the former case some of import and/or transshipment containers are handled by off-shore quay cranes and placed on container barges, which are further towed by push boats to assigned feeder vessels or floating yard. According to the new collaborative agreement, a dedicated marine container terminal operator can divert some of its vessels for the service at a multi-user terminal during specific time windows. Another part of dissertation focuses on enhancing operations of liner shipping services by introducing the following: 1) a new collaborative agreement between a liner shipping company and terminal operators and 2) a new framework for modeling uncertainty in liner shipping. A new collaborative mechanism assumes that each terminal operator is able to offer a set of handling rates to a liner shipping company, which may result in a substantial total route service cost reduction. The suggested framework for modeling uncertainty is expected to assist liner shipping companies in designing robust vessel schedules
A novel mathematical formulation for solving the dynamic and discrete berth allocation problem by using the Bee Colony Optimisation algorithm
AbstractBerth allocation is one of the crucial points for efficient management of ports. This problem is complex due to all possible combinations for assigning ships to available compatible berths. This paper focuses on solving the Berth Allocation Problem (BAP) by optimising port operations using an innovative model. The problem analysed in this work deals with the Discrete and Dynamic Berth Allocation Problem (DDBAP). We propose a novel mathematical formulation expressed as a Mixed Integer Linear Programming (MILP) for solving the DDBAP. Furthermore, we adapted a metaheuristic solution approach based on the Bee Colony Optimisation (BCO) for solving large-sized combinatorial BAPs. In order to assess the solution performance and efficiency of the proposed model, we introduce a new set of instances based on real data of the Livorno port (Italy), and a comparison between the BCO algorithm and CPLEX in solving the DDBAP is performed. Additionally, the application of the proposed model to a real berth scheduling (Livorno port data) and a comparison with the Ant Colony Optimisation (ACO) metaheuristic are carried out. Results highlight the feasibility of the proposed model and the effectiveness of BCO when compared to both CPLEX and ACO, achieving computation times that ensure a real-time application of the method
Priority Control of Berth Allocation Problem in Container Terminals
This paper presents a decision support system for the core problem of berth allocation decision in a container terminal. The allocation of berths to the calling vessels is complex with the fact that different service level requirements are required for different vessels. Terminal managers demand for effective decision support systems that would aid them with the allocation problem considering service priorities. Consequently, this study provides a DSS, built by a dynamic discrete-event simulation model embedded with an optimization tool that determines the priority controls for the berth allocation to the calling vessels. To show the practical application of the DSS, a comprehensive case study from a Turkish container terminal considering the current state and future expansion plans that also provides an indication of the usability aspect of the program on other ports around the world has been conducted. Further experiments are conducted based on data from the Port of Rotterdam. The DSS presented in this study may help port authorities in determining more efficient allocation decisions within a container terminal
Sequence-Based Simulation-Optimization Framework With Application to Port Operations at Multimodal Container Terminals
It is evident in previous works that operations research and mathematical algorithms can provide optimal or near-optimal solutions, whereas simulation models can aid in predicting and studying the behavior of systems over time and monitor performance under stochastic and uncertain circumstances. Given the intensive computational effort that simulation optimization methods impose, especially for large and complex systems like container terminals, a favorable approach is to reduce the search space to decrease the amount of computation.
A maritime port can consist of multiple terminals with specific functionalities and specialized equipment. A container terminal is one of several facilities in a port that involves numerous resources and entities. It is also where containers are stored and transported, making the container terminal a complex system. Problems such as berth allocation, quay and yard crane scheduling and assignment, storage yard layout configuration, container re-handling, customs and security, and risk analysis become particularly challenging.
Discrete-event simulation (DES) models are typically developed for complex and stochastic systems such as container terminals to study their behavior under different scenarios and circumstances. Simulation-optimization methods have emerged as an approach to find optimal values for input variables that maximize certain output metric(s) of the simulation. Various traditional and nontraditional approaches of simulation-optimization continue to be used to aid in decision making.
In this dissertation, a novel framework for simulation-optimization is developed, implemented, and validated to study the influence of using a sequence (ordering) of decision variables (resource levels) for simulation-based optimization in resource allocation problems. This approach aims to reduce the computational effort of optimizing large simulations by breaking the simulation-optimization problem into stages.
Since container terminals are complex stochastic systems consisting of different areas with detailed and critical functions that may affect the output, a platform that accurately simulates such a system can be of significant analytical benefit. To implement and validate the developed framework, a large-scale complex container terminal discrete-event simulation model was developed and validated based on a real system and then used as a testing platform for various hypothesized algorithms studied in this work
- …