Solving a Real-Life Tramp Ship Routing and Scheduling Problem with Speed Profiles

2021 ◽  
pp. 82-96
Author(s):  
Lucas Louzada ◽  
Rafael Martinelli ◽  
Victor Abu-Marrul
Keyword(s):  
Real Life ◽  
Scheduling Problem ◽  
Ship Routing ◽  
Routing And Scheduling ◽  
Ship Routing And Scheduling

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

2021 ◽  
Vol 11 (11) ◽  
pp. 4840
Author(s):  
Apichit Maneengam ◽  
Apinanthana Udomsakdigool
Keyword(s):  
Time Window ◽  
Set Covering ◽  
Scheduling Problem ◽  
Ship Routing ◽  
Routing And Scheduling ◽  
Weighted Sum Method ◽  
Ship Routing And Scheduling ◽  
Green Ship ◽  
Covering Model ◽  
Time Window Constraints

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.

scholarly journals A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows

2015 ◽  
Vol 45 ◽  
pp. 350-360 ◽  
Author(s):  
Jesica de Armas ◽  
Eduardo Lalla-Ruiz ◽  
Christopher Expósito-Izquierdo ◽  
Dario Landa-Silva ◽  
Belén Melián-Batista
Keyword(s):  
Time Windows ◽  
Scheduling Problem ◽  
Ship Routing ◽  
Routing And Scheduling ◽  
Ship Routing And Scheduling

A branch-price-and-cut method for a ship routing and scheduling problem with split loads

2012 ◽  
Vol 39 (12) ◽  
pp. 3361-3375 ◽  
Author(s):  
Magnus Stålhane ◽  
Henrik Andersson ◽  
Marielle Christiansen ◽  
Jean-François Cordeau ◽  
Guy Desaulniers
Keyword(s):  
Scheduling Problem ◽  
Ship Routing ◽  
Routing And Scheduling ◽  
Ship Routing And Scheduling ◽  
Cut Method

scholarly journals A Genetic Algorithm for Ship Routing and Scheduling Problem with Time Window

2012 ◽  
Vol 02 (03) ◽  
pp. 417-429 ◽  
Author(s):  
Khaled Al-Hamad ◽  
Mohamed Al-Ibrahim ◽  
Eiman Al-Enezy
Keyword(s):  
Genetic Algorithm ◽  
Time Window ◽  
Scheduling Problem ◽  
Ship Routing ◽  
Routing And Scheduling ◽  
Ship Routing And Scheduling

In-port multi-ship routing and scheduling problem with draft limits

2020 ◽  
pp. 1-22 ◽  
Author(s):  
Mehdi Mahmoodjanloo ◽  
Gang Chen ◽  
Sobhan Asian ◽  
Seyed Hossein Iranmanesh ◽  
Reza Tavakkoli-Moghaddam
Keyword(s):  
Scheduling Problem ◽  
Ship Routing ◽  
Routing And Scheduling ◽  
Ship Routing And Scheduling
Sign in / Sign up

Export Citation Format

Share Document