66 research outputs found

    Port Hinterland Estimation and Optimization for Intermodal Freight Transportation Networks

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Liner Service Network Design

    Get PDF

    Sequence-Based Simulation-Optimization Framework With Application to Port Operations at Multimodal Container Terminals

    Get PDF
    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

    Storage yard management for container transshipment terminals

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Research on optimizing liner routing schedule of ZhongGu Shipping Company

    Get PDF

    New optimization models for empty container management

    Get PDF
    This thesis investigates the reasons why nowadays empty container repositioning represents a crucial issue for the shipping industry. Moreover, taking into account information collected through surveys and meetings with industrial experts, we provide a broad overview of current logistic practices for the management of empty containers in the context of international trade. We develop new optimization models in order to support shipping companies in dealing with empty container repositioning. We determine optimal repositioning plans within the time limits imposed by planning operations. Some optimization models have been tested on real data problems provided by a shipping company. These results show that it is possible to achieve significant savings in costs and times requested to determine repositioning plan

    Stochastic Service Network Design for Intermodal Freight Transportation

    Get PDF
    In view of the accelerating climate change, greenhouse gas emissions from freight transportation must be significantly reduced over the next decades. Intermodal transportation can make a significant contribution here. During the transportation process, different modes of transportation are combined, enabling a modal shift to environmentally friendly alternatives such as rail and inland waterway transportation. However, at the same time, the organization of several modes is more complex compared to the unimodal case (where, for example, only trucks are employed). In particular, an efficient management of uncertainties, such as fluctuating transportation demand volumes or delays, is required to realize low costs and transportation times, thereby ensuring the attractiveness of intermodal transportation for a further modal shift. Stochastic service network design can explicitly consider such uncertainities in the planning in order to increase the performance of intermodal transportation. Decisions for the network design as well as for the mode choice are defined by mathematical optimization models, which originate from operations research and include relevant uncertainities by stochastic parameters. As central research gap, this dissertation addresses important operational constraints and decision variables of real-life intermodal networks, which have not been considered in these models so far and, in consequence, strongly limit their application in everyday operations. The resulting research contribution are two new variants of stochastic service network design models: The "stochastic service network design with integrated vehicle routing problem" integrates corresponding routing problems for road vehicles into the planning of intermodal networks. This new variant ensures a cost- and delay-minimal mode choice in the case of uncertain transportation times. The "stochastic service network design with short-term schedule modifications" deals with modifications of intermodal transportation schedules in order to adapt them to fluctuating demand as best as possible. For both new model variants, heuristic solution methods are presented which can efficiently solve even large network instances. Extensive case studies with real-world data demonstrate significant savings potentials compared to deterministic models as well as (simplified) stochastic models that already exist in literature

    AIRO 2016. 46th Annual Conference of the Italian Operational Research Society. Emerging Advances in Logistics Systems Trieste, September 6-9, 2016 - Abstracts Book

    Get PDF
    The AIRO 2016 book of abstract collects the contributions from the conference participants. The AIRO 2016 Conference is a special occasion for the Italian Operations Research community, as AIRO annual conferences turn 46th edition in 2016. To reflect this special occasion, the Programme and Organizing Committee, chaired by Walter Ukovich, prepared a high quality Scientific Programme including the first initiative of AIRO Young, the new AIRO poster section that aims to promote the work of students, PhD students, and Postdocs with an interest in Operations Research. The Scientific Programme of the Conference offers a broad spectrum of contributions covering the variety of OR topics and research areas with an emphasis on “Emerging Advances in Logistics Systems”. The event aims at stimulating integration of existing methods and systems, fostering communication amongst different research groups, and laying the foundations for OR integrated research projects in the next decade. Distinct thematic sections follow the AIRO 2016 days starting by initial presentation of the objectives and features of the Conference. In addition three invited internationally known speakers will present Plenary Lectures, by Gianni Di Pillo, Frédéric Semet e Stefan Nickel, gathering AIRO 2016 participants together to offer key presentations on the latest advances and developments in OR’s research

    Green logistic network design : intermodal transportation planning and vehicle routing problems.

    Get PDF
    Due to earth\u27s climate change and global warming, environmental consideration in the design of logistic systems is accelerating in recent years. In this research we aim to design an efficient and environmentally friendly logistical system to satisfy both government and carriers. In particular, we considered three problems in this dissertation: intermodal network design, deterministic green vehicle routing problem and stochastic green vehicle routing problem. The first problem aims to design an economic and efficient intermodal network including three transportation modes: railway, highway and inland waterway. The intent of this problem is to increase the utilization percentage of waterway system in the intermodal transportation network without increasing the cost to the consumer. In particular, we develop a real world coal transportation intermodal network across 15 states in the United States including highway, railway and inland waterway. The demand data were obtained from the Bureau of Transportation Statistics (BTS) under the US Department of Transportation (DOT). Four boundary models are built to evaluate the potential improvement of the network. The first boundary model is a typical minimum cost problem, where the total transportation cost is minimized while the flow balance and capacity restrictions are satisfied. An additional constraint that help obtain an upper bound on carbon emission is added in the second boundary model. Boundary model 3 minimizes the total emission with flow balance and capacity restrictions the same as boundary model 1. Boundary model 4 minimizes the total emission with an additional current cost restriction to achieve a less-aggressive lower bound for carbon emission. With a motivation to minimize the transportation and environmental costs simultaneously, we propose multi-objective optimization models to analyze intermodal transportation with economic, time performance and environmental considerations. Using data from fifteen selected states, the model determines the tonnage of coal to be transported on roadways, railways and waterways across these states. A time penalty parameter is introduced so that a penalty is incurred for not using the fastest transportation mode. Our analysis provides authorities with a potential carbon emission tax policy while minimizing the total transportation cost. In addition, sensitivity analysis allows authorities to vary waterway, railway and highway capacities, respectively, and study their impact on the total transportation cost. Furthermore, the sensitivity analysis demonstrates that an intermodal transportation policy that uses all the three modes can reduce the total transportation cost when compared to one that uses just two modes. In contrast with traditional vehicle routing problems, the second problem intends to find the most energy efficient vehicle route with minimum pollution by optimization of travel speed. A mixed integer nonlinear programming model is introduced and a heuristic algorithm based on a savings heuristic and Tabu Search is developed to solve the large case for this problem. Numerical experiments are conducted through comparison with a solution obtained by BONMIN in GAMS on randomly generated small problem instances to evaluate the performance of the proposed heuristic algorithm. To illustrate the impact of a time window constraint, travel speed and travel speed limit on total carbon emission, sensitivity analysis is conducted based on several scenarios. In the end, real world instances are examined to further investigate the impact of these parameters. Based on the analysis from the second problem, travel speed is an important decision factor in green vehicle routing problems to minimize the fuel cost. However, the actual speed limit on a road may have variance due to congestion. To further investigate the impact of congestion on carbon emission in the real world, we proposed a stochastic green vehicle routing problem as our third problem. We consider a green vehicle problem with stochastic speed limits, which aims to find the robust route with the minimum expected fuel cost. A two-stage heuristic with sample average approximation is developed to obtain the solution of the stochastic model. Computational study compares the solutions of robust and traditional mean-value green vehicle routing problems with various settings
    corecore