Back to Search
Start Over
Variable Neighborhood Descent Branching Applied to the Green Electric Vehicle Routing Problem with Time Window and Mixed Fleet
- Source :
- Variable Neighborhood Search ISBN: 9783030696245, ICVNS
- Publication Year :
- 2021
- Publisher :
- Springer International Publishing, 2021.
-
Abstract
- This paper deals with the Green Electric Vehicle Routing Problem with Time Window and Mixed Fleet and presents a Mixed Integer Linear Programming formulation for it. Initially, we applied the CPLEX solver in this formulation. Then, to reduce the computational time, we used Local Branching and Variable Neighborhood Descent Branching (VNDB) methods. We did computational experiments with a simple adaptation of the 100-customers Solomon’s benchmark instances. The results showed that the three solution strategies reached the optimal solution. However, the running time of the VNDB is considerably smaller than those required by the other two solution methods. Therefore, this fact proves that the VNDB is the more efficient technique in the tested scenario.
Details
- ISBN :
- 978-3-030-69624-5
- ISBNs :
- 9783030696245
- Database :
- OpenAIRE
- Journal :
- Variable Neighborhood Search ISBN: 9783030696245, ICVNS
- Accession number :
- edsair.doi...........1ea817a0b2dcfb2b43b3ac51adcdbbb4