A Ship Routing and Scheduling Problem Considering Pickup and Delivery, Time Windows and Draft Limit

2019 ◽  
Author(s):  
Mahsa Ghasemi-Sardabrud ◽  
Mina Zarkandi ◽  
Mehdi Mahmoodjanloo
Keyword(s):  
Time Windows ◽  
Pickup And Delivery ◽  
Scheduling Problem ◽  
Delivery Time ◽  
Ship Routing ◽  
Routing And Scheduling ◽  
Ship Routing And Scheduling

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

scholarly journals A Heuristic Procedure for a Ship Routing and Scheduling Problem with Variable Speed and Discretized Time Windows

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Krystel K. Castillo-Villar ◽  
Rosa G. González-Ramírez ◽  
Pablo Miranda González ◽  
Neale R. Smith
Keyword(s):  
Time Windows ◽  
Waiting Times ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Computational Results ◽  
Solution Quality ◽  
Ship Routing ◽  
Routing And Scheduling ◽  
Ship Routing And Scheduling ◽  
Tramp Shipping

This paper develops a heuristic algorithm for solving a routing and scheduling problem for tramp shipping with discretized time windows. The problem consists of determining the set of cargoes that should be served by each ship, the arrival, departure, and waiting times at each port, while minimizing total costs. The heuristic proposed is based on a variable neighborhood search, considering a number of neighborhood structures to find a solution to the problem. We present computational results, and, for comparison purposes, we consider instances that can be solved directly by CPLEX to test the performance of the proposed heuristic. The heuristics achieves good solution quality with reasonable computational times. Our computational results are encouraging and establish that our heuristic can be utilized to solve large real-size instances.

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.

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
Sign in / Sign up

Export Citation Format

Share Document