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

Build and Design of Voyage Account Applications Using C#, WPF, and SQL Server 2012 (Case Study PT. X)

Voyage Account is an application that record consumption data on each voyage, then the data is used to calculate the profit or loss of each voyage. The application interface was created using Windows Presentation Foundation (WPF). Prototyping development methods were used to create these applications, C# as the programming language, and SQL Server 2012 as the database. This study discusses the making of the interface, backend, and database of application. WPF has been selected, because WPF is the latest technology developed by Microsoft after WinForms. WPF presents a display that can be customized to user needs. The test results showed that the Voyage Account application is already functioning in accordance with wishes of the user, the test is done using sql query by entering the appropriate username and password and match the query returns results with what is displayed by the application. As for testing the interface shows if WPF can be flexibly adapted to the screen resolution of 1366 x 768, 1920 x 1080 and 1280 x 720

A multimodal network flow problem with product quality preservation, transshipment, and asset management

In this paper, we present an optimization model for a transportation planning problem with multiple transportation modes, highly perishable products, demand and supply dynamics, and management of the reusable transport units (RTIs). Such a problem arises in the European horticultural chain, for example. As a result of geographic dispersion of production and market, a reliable transportation solutions ensures long-term success in the European market. The model is an extension to the network ow problem. We integrate dynamic allocation, ow, and repositioning of the RTIs in order to nd the trade-o between quality requirements and operational considerations and costs. We also present detailed computational results and analysis

Business models for collaborative planning in transportation : an application to wood products

In this paper, we propose a framework to describe collaboration in transportation. Then, we discuss the strategic, tactical, operational and real-time transportation planning decisions and raise issues about implementing collaborative decision processes. Also, we provide a literature review of transport decision-support systems that use collaborative planning in the wood fiber flow chain in forestry. Finally, we propose a typology of different business models associated with collaboration in transport