Industrial ship routing problem with split delivery and two types of vessels

Lee, Jongsung; Kim, Byung‐In

doi:10.1016/j.eswa.2015.07.059

Cited by 29 publications

(13 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nishi and Izuno [17] proposed a heuristic algorithm based on the column generation method to solve the ship routing and scheduling problem with split deliveries to minimize the total distance and satisfy the capacity of tankers. Lee and Byung-In Kim [18] formulated a mixed integer programming model for the industrial ship routing problem with split delivery to reduce the operation costs. An adaptive large neighborhood search-based heuristic model was proposed to solve the problem.…”

Section: Ship Routing and Scheduling Problemsmentioning

confidence: 99%

A Set Covering Model for a Green Ship Routing and Scheduling Problem with Berth Time-Window Constraints for Use in the Bulk Cargo Industry

Maneengam

Udomsakdigool

2021

Applied Sciences

View full text Add to dashboard Cite

This paper presents a set covering model based on route representation to solve the green ship routing and scheduling problem (GSRSP) with berth time-window constraints for multiple bulk ports. A bi-objective set covering model is constructed with features based on the minimization of the total CO2 equivalent emissions and the total travel time subject to a limited number of berths in each port, berthing time windows, and the time window for each job. The solutions are obtained using the ε-constraint method, after which a Pareto frontier is plotted. This problem is motivated by the operations of feeder barges and terminals, where the logistics control tower is used to coordinate the routing and berthing time of its barges. We show that the proposed method outperforms the weighted sum method in terms of the number of Pareto solutions and the value of the hypervolume indicator.

show abstract

Section: Ship Routing and Scheduling Problemsmentioning

confidence: 99%

A Set Covering Model for a Green Ship Routing and Scheduling Problem with Berth Time-Window Constraints for Use in the Bulk Cargo Industry

Maneengam

Udomsakdigool

2021

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…In a recent research, Lee and Kim (2015) introduced an industrial ship routing problem faced by one of the world-class steel manufacturing companies. The problem was to determine how to route a fleet of heterogeneous ships to carry the cargoes, given a set of cargoes with pickup, delivery ports, and time windows.…”

Section: Inventory Ship Routing Problemmentioning

confidence: 99%

Solving multi-product inventory ship routing with a heterogeneous fleet model using a hybrid cross entropy-genetic algorithm: a case study in Indonesia

Santosa

Damayanti

Sarkar

2016

Production & Manufacturing Research

View full text Add to dashboard Cite

Solving multi-product inventory ship routing with a heterogeneous fleet model using a hybrid cross entropygenetic algorithm: a case study in Indonesia Budi Santosa a , Rita Damayanti a and Biswajit Sarkar b a industrial engineering, institut teknologi sepuluh nopember, Kampus its sukolilo, surabaya 60111, indonesia; b department of industrial & Management engineering, hanyang university, erica campus, ansan, republic of Korea ABSTRACT This paper presents a model and an algorithm for an inventory ship routing problem (ISRP). It consists of two main parts: a model development of the ship routing problem in a multi-product inventory with a heterogeneous fleet and an algorithm development to solve the problem. The problem is referred to as ISRP. ISRP considers several parameters including the deadweight tonnage (DWT), product compatibility, port setup, and compartment washing costs. Considering these parameters, the objective function is to minimize the total cost, which consists of traveling, port setup, ship charter, and compartment washing costs. From the resulting model, there are two major steps used to solve the problem. The first is to select the ships in order to satisfy the constraint that restricts the mooring rule. The second is to find the best route, product allocation, and shipped quantity. ISRP is an Non Polynomial-hard problem. Finding the solution of such problem needs a high computation time. A new hybrid metaheuristics, namely the cross entropy-genetic algorithm (CEGA), was proposed to solve ISRP. The results were then compared with those resulted from a hybrid Tabu Search to measure the hybrid CEGA performance. The results showed that CEGA provided better solutions than those produced by the hybrid Tabu Search.

show abstract

“…A model considering these and other real-life features in which the objective is to minimize fuel costs and port charges was introduced. Lee and Kim [ 6 ] addressed a routing problem of a heterogeneous fleet with split deliveries in the context of a steel manufacturing company. They presented a mixed integer linear programming (MILP) model as well as an Adaptive Large Neighbourhood Search (ALNS) heuristic.…”

Section: Introductionmentioning

confidence: 99%

Optimization of the Use of Critical Resources in the Development of Offshore Oil Fields

Bassi

Ronconi

2020

Computational Science and Its Applications – ICCSA 2020

View full text Add to dashboard Cite

This paper focuses on a real case of connection of subsea oil wells to offshore platforms using pipe laying support vessels. The objective of this study is to maximize the oil production curve through an optimized use of the outsourced fleet. Specific features of this scenario are considered, such as technical constraints of each vessel, the availability of the vessels, materials for connection, and the end of the previous phase, called completion. A mixed integer linear programming model is developed considering several constraints that structure this complex situation, among which a relevant characteristic of the problem: the increase of the production curve using injection wells to fight the natural decline of producing wells over time. This mathematical model was tested in small computational instances, showing adequate behavior, which demonstrates that it faithfully represents the situation portrayed and can be used, combined with more advanced computational resources, to achieve better results.

show abstract

Industrial ship routing problem with split delivery and two types of vessels

Cited by 29 publications

References 45 publications

A Set Covering Model for a Green Ship Routing and Scheduling Problem with Berth Time-Window Constraints for Use in the Bulk Cargo Industry

A Set Covering Model for a Green Ship Routing and Scheduling Problem with Berth Time-Window Constraints for Use in the Bulk Cargo Industry

Solving multi-product inventory ship routing with a heterogeneous fleet model using a hybrid cross entropy-genetic algorithm: a case study in Indonesia

Optimization of the Use of Critical Resources in the Development of Offshore Oil Fields

Contact Info

Product

Resources

About