2021
DOI: 10.1016/j.omega.2020.102316
|View full text |Cite
|
Sign up to set email alerts
|

Solving a stochastic inland waterway port management problem using a parallelized hybrid decomposition algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 15 publications
(8 citation statements)
references
References 49 publications
0
8
0
Order By: Relevance
“…More publications have been focused on more general inland waterway ship routing and port management problems, see e.g. [1][2][3][4]12,[23][24][25] .…”
Section: Lock Schedulingmentioning
confidence: 99%
See 1 more Smart Citation
“…More publications have been focused on more general inland waterway ship routing and port management problems, see e.g. [1][2][3][4]12,[23][24][25] .…”
Section: Lock Schedulingmentioning
confidence: 99%
“…Moreover, the lock management, i.e., the scheduling of all lock operations, is done based on intuition and ad-hoc decision making, typically resulting in a first-come-first-served queuing policy. 1 To ensure timely service at the lock, the skippers have the incentive to speed up in front of a lock, and overtake preceding vessels to receive the lock service earlier.…”
Section: Introductionmentioning
confidence: 99%
“…Constraints (8) update the remaining weight capacity of the EVs based on the nodes visited. Constraints (9) enforce that the remaining weight capacity of the EVs is less than the EV maximum weight capacity and also be greater than zero in all the visited nodes by the EVs. Constraints (10) and (11) update the battery power level of the EVs based on the nodes visited.…”
Section: Setsmentioning
confidence: 99%
“…Therefore, the full model [IWT] is also N P-hard and solving any large size instance this problem is very challenging for commercial solvers such as Gurobi, and CPLEX. To overcome this challenge, we propose a parallelized hybrid decomposition algorithm based on Nested Decom-position Algorithm [14] embedded with a sample average approximation algorithm [15] and a Progressive Hedging Algorithm [16], to solve the model to optimality (or nearoptimality) in a reasonable timeframe. All algorithms are coded in python 2.7 and as an optimization solver we used Gurobi Optimizer 7.0.2.…”
Section: Solution Approach: Settingmentioning
confidence: 99%