An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
Year of publication: |
2020
|
---|---|
Authors: | Hellsten, Erik Orm ; Sacramento, David ; Pisinger, David |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 287.2020, 2 (1.12.), p. 682-698
|
Subject: | ALNS | General shop scheduling | OR in maritime industry | Port operations | Scheduling-Verfahren | Scheduling problem | Hafen | Port | Tourenplanung | Vehicle routing problem | Hafenwirtschaft | Port management | Heuristik | Heuristics | Containerterminal | Container terminal |
-
Daily train scheduling in seaport terminal : a MILP approach
Guedes, Lucas S. M., (2021)
-
Li, Bing, (2022)
-
Port rail shunting scheduling problem
Ambrosino, Daniela, (2022)
- More ...
-
A branch-and-price algorithm for solving the single-hub feeder network design problem
Hellsten, Erik Orm, (2022)
-
Deep Dual-Optimal Inequalities for Generalized Capacitated Fixed-Charge Network Design Problems
Koza, David Franz, (2020)
-
Christiansen, Marielle, (2020)
- More ...