The multiple trip vehicle routing probem with backhauls : formulation and a two-level variable neighborhood search
Year of publication: |
February
|
---|---|
Authors: | Wassan, Naveed ; Wassan, Niaz ; Nagy, Gábor ; Salhi, Saïd |
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. 78.2017, p. 454-467
|
Subject: | Routing | Multiple trips | Backhauling | VNS | Meta-heuristics | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Theorie | Theory |
-
Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks
Dib, Omar, (2017)
-
A tabu search algorithm for the multi-period inspector scheduling problem
Qin, Hu, (2015)
-
Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
Zhao, Jingyi, (2022)
- More ...
-
Solving the Mixed Backhauling Vehicle Routing: Problem with Ants
Wassan, Niaz A., (2013)
-
An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem
Sze, Jeeu Fong, (2024)
-
Evaluating alternative supply chain structures for perishable products
Thron, Thomas, (2007)
- More ...