Heuristics for dynamic and stochastic routing in industrial shipping

Maritime transportation plays a central role in international trade, being responsible for the majority of long-distance shipments in terms of volume. One of the key aspects in the planning of maritime transportation systems is the routing of ships. While static and deterministic vehicle routing problems have been extensively studied in the last decades and can now be solved effectively with metaheuristics, many industrial applications are both dynamic and stochastic. In this spirit, this paper addresses a dynamic and stochastic maritime transportation problem arising in industrial shipping. Three heuristics adapted to this problem are considered and their performance in minimizing transportation costs is assessed. Extensive computational experiments show that the use of stochastic information within the proposed solution methods yields average cost savings of 2.5% on a set of realistic test instances

Improvement Opportunities in Commodity Trucks Delivery in Globalized Markets

Market globalization has posed the problem of finding economical routes of product delivery one of which is via a system of intermodal motor traction. Currently, the automotive manufacturing plant KAMAZ supplies its products and accompanying servicing to countries in Europe, Asia, Africa and Latin America, and intends to extend the market. This study deals with peculiarities of the organization of spare parts delivery to the dealer-service network abroad. Risks of water haul are considered; methods for improving of transportation planning by developing a decision support system are proposed

An artificial neural network based decision support system for energy efficient ship operations

Reducing fuel consumption of ships against volatile fuel prices and greenhouse gas emissions resulted from international shipping are the challenges that the industry faces today. The potential for fuel savings is possible for new builds, as well as for existing ships through increased energy efficiency measures; technical and operational respectively. The limitations of implementing technical measures increase the potential of operational measures for energy efficient ship operations. Ship owners and operators need to rationalise their energy use and produce energy efficient solutions. Reducing the speed of the ship is the most efficient method in terms of fuel economy and environmental impact. The aim of this paper is twofold: (i) predict ship fuel consumption for various operational conditions through an inexact method, Artificial Neural Network ANN; (ii) develop a decision support system (DSS) employing ANN based fuel prediction model to be used on-board ships on a real time basis for energy efficient ship operations. The fuel prediction model uses operating data -‘Noon Data’ - which provides information on a ship’s daily fuel consumption. The parameters considered for fuel prediction are ship speed, revolutions per minute (RPM), mean draft, trim, cargo quantity on board, wind and sea effects, in which output data of ANN is fuel consumption. The performance of the ANN is compared with multiple regression analysis (MR), a widely used surface fitting method, and its superiority is confirmed. The developed DSS is exemplified with two scenarios, and it can be concluded that it has a promising potential to provide strategic approach when ship operators have to make their decisions at an operational level considering both the economic and environmental aspects

Barge Prioritization, Assignment, and Scheduling During Inland Waterway Disruption Responses

Inland waterways face natural and man-made disruptions that may affect navigation and infrastructure operations leading to barge traffic disruptions and economic losses. This dissertation investigates inland waterway disruption responses to intelligently redirect disrupted barges to inland terminals and prioritize offloading while minimizing total cargo value loss. This problem is known in the literature as the cargo prioritization and terminal allocation problem (CPTAP). A previous study formulated the CPTAP as a non-linear integer programming (NLIP) model solved with a genetic algorithm (GA) approach. This dissertation contributes three new and improved approaches to solve the CPTAP. The first approach is a decomposition based sequential heuristic (DBSH) that reduces the time to obtain a response solution by decomposing the CPTAP into separate cargo prioritization, assignment, and scheduling subproblems. The DBSH integrates the Analytic Hierarchy Process and linear programming to prioritize cargo and allocate barges to terminals. Our findings show that compared to the GA approach, the DBSH is more suited to solve large sized decision problems resulting in similar or reduced cargo value loss and drastically improved computational time. The second approach formulates CPTAP as a mixed integer linear programming (MILP) model improved through the addition of valid inequalities (MILP\u27). Due to the complexity of the NLIP, the GA results were validated only for small size instances. This dissertation fills this gap by using the lower bounds of the MILP\u27 model to validate the quality of all prior GA solutions. In addition, a comparison of the MILP\u27 and GA solutions for several real world scenarios show that the MILP\u27 formulation outperforms the NLIP model solved with the GA approach by reducing the total cargo value loss objective. The third approach reformulates the MILP model via Dantzig-Wolfe decomposition and develops an exact method based on branch-and-price technique to solve the model. Previous approaches obtained optimal solutions for instances of the CPTAP that consist of up to five terminals and nine barges. The main contribution of this new approach is the ability to obtain optimal solutions of larger CPTAP instances involving up to ten terminals and thirty barges in reasonable computational time