Adaptive large neighborhood search for the commodity constrained split delivery VRP
Year of publication: |
2019
|
---|---|
Authors: | Gu, Wenjuan ; Cattaruzza, Diego ; Ogier, Maxime ; Semet, Frédéric |
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. 112.2019, p. 1-23
|
Subject: | Vehicle routing problem | Multiple commodities | Adaptive large neighborhood search | Local search | Tourenplanung | Theorie | Theory | Nachbarschaft | Neighbourhood |
-
An adaptive large neighborhood search for the discrete and continuous Berth allocation problem
Mauri, Geraldo Regis, (2016)
-
A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
Žulj, Ivan, (2018)
-
Large neighborhoods with implicit customer selection for vehicle routing problems with profits
Vidal, Thibaut, (2016)
- More ...
-
Vehicle routing problems with multiple commodities : a survey
Gu, Wenjuan, (2024)
-
A Branch-Price-and-Cut algorithm for the Multi-Commodity two-echelon Distribution Problem
Petris, Matteo, (2024)
-
A column generation based heuristic for the generalized vehicle routing problem with time windows
Yuan, Yuan, (2021)
- More ...