An efficient mixed integer programming model for pairing containers in inland transportation based on the assignment of orders

The inland transportation takes a significant portion of the total cost that arises from intermodal transportation. In addition, there are many parties (shipping lines, haulage companies, customers) who share this operation as well as many restrictions that increase the complexity of this problem and make it NP-hard. Therefore, it is important to create an efficient strategy to manage this process in a way to ensure all parties are satisfied. This paper investigates the pairing of containers/orders in drayage transportation from the perspective of delivering paired containers on 40-ft truck and/or individual containers on 20-ft truck, between a single port and a list of customer locations. An assignment mixed integer linear programming model is formulated, which solves the problem of how to combine orders in delivery to save the total transportation cost when orders with both single and multiple destinations exist. In opposition to the traditional models relying on the vehicle routing problem with simultaneous pickups and deliveries and time windows formulation, this model falls into the assignment problem category which is more efficient to solve on large size instances. Another merit for the proposed model is that it can be implemented on different variants of the container drayage problem: import only, import–inland and import–inland–export. Results show that in all cases the pairing of containers yields less cost compared to the individual delivery and decreases empty tours. The proposed model can be solved to optimality efficiently (within half hour) for over 300 orders

Concepts, Mechanisms, and Algorithms to Measure the Potential of Container Sharing in Seaport Hinterland Transportation

This thesis analyzes how trucking companies of a hinterland region can improve their routes if shipping companies allow the mutual exchange of their containers. In this case, trucking companies that are assigned by shipping companies cooperate by sharing information regarding which locations empty containers are currently stacked. These containers can then be integrated into a vehicle's route of any operating trucking company in the hinterland. The investigation aims at measuring the quantitative potential of the container sharing idea by means of problem settings illustrating realistic hinterland regions of a seaport. As a first step, the impact of street turns on the transportation costs of a trucking company should be measured. By forbidding or allowing the use of street turns for a single trucking company, the potential of the container sharing idea can be indicated, and the interrelation of empty container movements and transportation costs can be shown. As a further step, the benefit of exchanging empty containers between several trucking companies needs to be analyzed. In doing so, it is possible to investigate the potential and realistic limits of container sharing

Container Hinterland Drayage - On the Simultaneous Transportation of Containers Having Different Sizes

In an intermodal transportation chain drayage is the term used for the movement by truck of cargo that is filled in a loading unit. The most important intermodal transportation chain is the intermodal container transportation, in which containers represent the loading unit for cargo. Cost effectiveness constitutes a general problem of drayage operations. A major cost driver within container transportation chains is the movement and repositioning of empty containers. The present thesis investigates the potential to reduce drayage costs. Two solution methodologies are developed for operating a fleet of trucks that transports containers of different sizes, which addresses a recent gap in research in seaport hinterland regions

The one container drayage problem with soft time windows

Intermodal freight transport consists of using different modes of transport without changing the load unit. This results in a significant reduction in the time that goods spend at intermodal terminals, where transshipment takes place. Drayage refers to the transport of freight on trucks among intermodal terminals, depots, customers and suppliers. In spite of the fact that drayage only represents between 5 and 10 percent of total distance, it may amount up to more than 30 percent of the total costs. The aim of this work is to study drayage operations. First, an extensive literature review is undertaken. Since the intermodal transport chain can become more efficient by means of a proper organisation of the drayage movements, the optimization of the daily drayage problem has been identified as one of the main ways of reducing the drayage cost and improving intermodal operations. On this problem, the lack of a common benchmark has hindered reaching further conclusions from all the research carried out. Therefore, this paper proposes a common framework and presents a generalized formulation of the problem, which allows modeling most drayage policies, with the limitation of only considering one-container problems. Results show that flexible tasks in the repositioning of empty containers as well as soft time windows can reduce the operating costs and facilitate the management of drayage companies. This work may help consider adequate policies regarding drayage operations in intermodal terminals

Combining multiple trips in a port environment for empty movements minimization

Road transportation represents the most used transportation mode to cover short distances. However, structural lack of planning and optimization in road transportation creates negative effects both for companies and for the social community, such as environmental pollution, economic loss and road congestion. These effects are mainly due to the fact that a lack of planning can yield the necessity of a huge number of empty trips. Usually trucks that pick up or deliver a full container in a port must return back the empty container to the place where the trip started, so performing one leg of the total trip without payload. The aim of the present paper is to propose a mathematical approach for combining multiple trips in a port environment (specifically, import, export and inland trips) by considering the opportunity of carrying two 20 ft containers simultaneously on the same truck and by using the same load unit if possible. In this way, in the same route, more than two nodes can be visited with the same vehicle thus significantly reducing the number of total empty movements. Time windows constraints related to companies and terminal opening hours as well as to ship departures are considered in the problem formulation. Moreover driving hours restrictions and trips deadlines are taken into account, together with goods compatibility for matching different trips. An experimental campaign based on real data is discussed in the paper

Disruption Response Support For Inland Waterway Transportation

Motivated by the critical role of the inland waterways in the United States\u27 transportation system, this dissertation research focuses on pre- and post- disruption response support when the inland waterway navigation system is disrupted by a natural or manmade event. Following a comprehensive literature review, four research contributions are achieved. The first research contribution formulates and solves a cargo prioritization and terminal allocation problem (CPTAP) that minimizes total value loss of the disrupted barge cargoes on the inland waterway transportation system. It is tailored for maritime transportation stakeholders whose disaster response plans seek to mitigate negative economic and societal impacts. A genetic algorithm (GA)-based heuristic is developed and tested to solve realistically-sized instances of CPTAP. The second research contribution develops and examines a tabu search (TS) heuristic as an improved solution approach to CPTAP. Different from GA\u27s population search approach, the TS heuristic uses the local search to find improved solutions to CPTAP in less computation time. The third research contribution assesses cargo value decreasing rates (CVDRs) through a Value-focused Thinking based methodology. The CVDR is a vital parameter to the general cargo prioritization modeling as well as specifically for the CPTAP model for inland waterways developed here. The fourth research contribution develops a multi-attribute decision model based on the Analytic Hierarchy Process that integrates tangible and intangible factors in prioritizing cargo after an inland waterway disruption. This contribution allows for consideration of subjective, qualitative attributes in addition to the pure quantitative CPTAP approach explored in the first two research contributions

Dynamic approach to solve the daily drayage problem with travel time uncertainty

The intermodal transport chain can become more e cient by means of a good organization of drayage movements. Drayage in intermodal container terminals involves the pick up and delivery of containers at customer locations, and the main objective is normally the assignment of transportation tasks to the di erent vehicles, often with the presence of time windows. This scheduling has traditionally been done once a day and, under these conditions, any unexpected event could cause timetable delays. We propose to use the real-time knowledge about vehicle position to solve this problem, which permanently allows the planner to reassign tasks in case the problem conditions change. This exact knowledge of the position of the vehicles is possible using a geographic positioning system by satellite (GPS, Galileo, Glonass), and the results show that this additional data can be used to dynamically improve the solution

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

Optimizing multiple truck trips in a cooperative environment through MILP and Game Theory

Today, the challenge of economy regarding freight transport is to generate flows of goods extremely fast, handling information in short times, optimizing decisions, and reducing the percentage of vehicles that circulate empty over the total amount of transportation means, with benefits to roads congestion and the environment, besides economy. Logistic operators need to pose attention on suitable planning methods in order to reduce their costs, fuel consumption and emissions, as well as to gain economy of scale. To ensure the maximum efficacy, planning should be also based on cooperation between the involved subjects. Collaboration in logistics is an effective approach for business to obtain a competitive edge. In a successful collaboration, parties involved from suppliers, customers, and even competitors perform a coordinated effort to realize the potential benefit of collaboration, including reduced costs, decreased lead times, and improved asset utilization and service level. In addition to these benefit, having a broader supply chain perspective enables firms to make better-informed decisions on strategic issues. The first aim of the present Thesis is to propose a planning approach based on mathematical programming techniques to improve the efficiency of road services of a single carrier combining multiple trips in a port environment (specifically, import, export and inland trips). In this way, in the same route, more than two transportation services can be realized with the same vehicle thus significantly reducing the number of total empty movements. Time windows constraints related to companies and terminal opening hours as well as to ship departures are considered in the problem formulation. Moreover, driving hours restrictions and trips deadlines are taken into account, together with goods compatibility for matching different trips. The second goal of the Thesis is to define innovative planning methods and optimization schemes of logistic networks in which several carriers are present and the decisional actors operate in a cooperative scenario in which they share a portion of their demand. The proposed approaches are characterized by the adoption both of Game Theory methods and of new original methods of profits distribution