A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
Year of publication: |
16 April 2018
|
---|---|
Authors: | Liu, Tian ; Luo, Zhixing ; Hu, Qin ; Lim, Andrew |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 266.2018, 2 (16.4.), p. 487-497
|
Subject: | Cutting | Branch and cut | Polyhedral combinatorics | Two-echelon vehicle routing | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Algorithmus | Algorithm |
-
Mhamedi, Tayeb, (2024)
-
An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
Marques, Guillaume, (2020)
-
Two-echelon electric vehicle routing problem with a developed moth-flame meta-heuristic algorithm
Goli, Alireza, (2022)
- More ...
-
A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
Luo, Zhixing, (2021)
-
Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
Luo, Zhixing, (2014)
-
On service consistency in multi-period vehicle routing
Luo, Zhixing, (2015)
- More ...