Ship routing and scheduling problem for steel plants cluster alongside the Yangtze River

Li, Feng; Yang, Dong; Wang, Shuaian; Weng, Jinxian

doi:10.1016/j.tre.2018.12.001

Cited by 25 publications

(10 citation statements)

References 28 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Model (P1) is challenging to solve because it has a very large number of integer decision variables [35][36][37][38][39][40]. Given a problem instance, the number of decision variables t k is O (N), where the big-O notation is used, the number of decision variables z ik is O (N • |I|); the number of decision variables y i1 , y i2 , y i3 , y i4 , y i5 , and y i6 is O (N • |I|); the number of decision variables To address model (P1), we propose a heuristic approach below.…”

Section: Solution Methodsmentioning

confidence: 99%

Sustainable Ship Loading Planning for Prefabricated Products in the Construction Industry

Phipps

Wang

2020

Sustainability

View full text Add to dashboard Cite

This paper focuses on sustainable transportation of prefab products from factories to construction sites by ship. Since the transportation cost for all the prefab products of a construction site is mainly dependent on the number of cargo holds used on ships, a loading plan for prefab products that minimizes the number of holds required is highly desirable. This paper is therefore devoted to the development of an optimal loading plan that decides which prefab products are loaded into each cargo hold and how to pack these prefab products into the holds so that as few holds as possible are used. We formulate the problem as a large-scale integer optimization model whose objective function is to minimize the total number of cargo holds used and whose constraints represent the cargo hold capacity limits. We develop a heuristic to solve the problem and obtain a high-quality solution. We have tested the model and algorithm on a case study that includes 20 prefab products. We find that different cargo holds carry prefab products that have quite different densities. Moreover, the orientations of many prefab products are different from their default orientations. The results demonstrate the applicability of the proposed model and algorithm.

show abstract

Section: Solution Methodsmentioning

confidence: 99%

Sustainable Ship Loading Planning for Prefabricated Products in the Construction Industry

Phipps

Wang

2020

Sustainability

View full text Add to dashboard Cite

show abstract

“…Yamashita et al [22] proposed a multistart heuristic method for ship routing and scheduling by an oil company to minimize transportation costs and the number of consecutive dockings at platforms and terminals. Li [23] formulated a mixed integer programming model for a ship routing and scheduling problem for a steel plant cluster based alongside the Yangtze River. The proposed model was solved using an exact solution approach based on a dynamic programming algorithm.…”

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

“…The transportation community has developed some new methods to address the planning of shipping routes for the dry bulk fleet in recent years. Some works developed mixedinteger linear programming models to optimize the selection of vessel routes and the allocation of vessels for each course (Rakke et al [11]; Li et al [12]). De et al introduced the loading and unloading constraints and ship capacity constraints into the problem and developed a mixed-integer nonlinear programming model that satisfies actual route planning requirements (De et al [13]).…”

Section: A Dry Bulk Carrier Route Optimizationmentioning

confidence: 99%

Robust Dry Bulk Fleet Route Optimization Under Navigation Risk Consideration

Gao¹,

Wang

2021

IEEE Access

View full text Add to dashboard Cite

Ship routing and scheduling problem for steel plants cluster alongside the Yangtze River

Cited by 25 publications

References 28 publications

Sustainable Ship Loading Planning for Prefabricated Products in the Construction Industry

Sustainable Ship Loading Planning for Prefabricated Products in the Construction 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

Robust Dry Bulk Fleet Route Optimization Under Navigation Risk Consideration

Contact Info

Product

Resources

About