An adaptive large neighborhood search for the discrete and continuous Berth allocation problem
Year of publication: |
June 2016
|
---|---|
Authors: | Mauri, Geraldo Regis ; Ribeiro, Glaydston Mattos ; Lorena, Luiz Antonio Nogueira ; Laporte, Gilbert |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 70.2016, p. 140-154
|
Subject: | Berth allocation problem | Metaheuristic | Adaptive large neighborhood search | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Tourenplanung | Vehicle routing problem | USA | United States | Containerterminal | Container terminal | Theorie | Theory | Nachbarschaft | Neighbourhood |
-
A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
Žulj, Ivan, (2018)
-
A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
Qu, Yuan, (2012)
-
An adaptive large neighborhood search for the pickup and delivery problem with transfers
Masson, Renaud, (2013)
- More ...
-
Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem
Mauri, Geraldo Regis, (2020)
-
Mauri, Geraldo Regis, (2010)
-
A clustering search metaheuristic for the point-feature cartographic label placement problem
Rabello, Rômulo Louzada, (2014)
- More ...