An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
Year of publication: |
August 2016
|
---|---|
Authors: | Ghilas, Veaceslav ; Demir, Emrah ; Woesel, Tom van |
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. 72.2016, p. 12-30
|
Subject: | Freight transportation | Pickup and delivery problem | Heuristic algorithm | Scheduled lines | Heuristik | Heuristics | Tourenplanung | Vehicle routing problem | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Logistikunternehmen | Logistics provider | Terminplanung | Time scheduling |
-
Branch-and-price for the pickup and delivery problem with time windows and scheduled lines
Ghilas, Veaceslav, (2018)
-
The pickup and delivery problem with time windows and scheduled lines
Ghilas, Veaceslav, (2016)
-
The time-dependent capacitated profitable tour problem with time windows and precedence constraints
Sun, Peng, (2018)
- More ...
-
The pickup and delivery problem with time windows and scheduled lines
Ghilas, Veaceslav, (2016)
-
Branch-and-price for the pickup and delivery problem with time windows and scheduled lines
Ghilas, Veaceslav, (2018)
-
A selected review on the negative externalities of the freight transportation: Modeling and pricing
Demir, Emrah, (2015)
- More ...