An adaptive large neighborhood search for the pickup and delivery problem with transfers
Year of publication: |
2013
|
---|---|
Authors: | Masson, Renaud ; Lehuédé, Fabien ; Péton, Olivier |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 47.2013, 3, p. 344-355
|
Subject: | pickup and delivery problem | transfers | adaptive large neighborhood search | Heuristik | Heuristics | Tourenplanung | Vehicle routing problem | USA | United States | Theorie | Theory | Nachbarschaft | Neighbourhood |
-
An adaptive large neighborhood search for the discrete and continuous Berth allocation problem
Mauri, Geraldo Regis, (2016)
-
Grimault, Axel, (2017)
-
A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
Žulj, Ivan, (2018)
- More ...
-
Masson, Renaud, (2013)
-
A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
Masson, Renaud, (2014)
-
The Dial-A-Ride Problem with transfers
Masson, Renaud, (2014)
- More ...