A lightweight genetic algorithm with variable neighborhood search for multi-depot vehicle routing problem with time windows
Authors:
- Yukang SuYSYukang Su
- Shuo ZhangSZShuo Zhang
- Chengning ZhangCZChengning Zhang
- 22 May 2024
- journal article
- research article
- Published by Elsevier in Applied Soft Computing
- Vol. 161
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windowsComputers & Operations Research, 2023
- A variable neighborhood search-based algorithm with adaptive local search for the Vehicle Routing Problem with Time Windows and multi-depots aiming for vehicle fleet reductionComputers & Operations Research, 2022
- Urban Expansion of China from the 1970s to 2020 Based on Remote Sensing TechnologyChinese Geographical Science, 2021
- An Adaptive Large Neighborhood Search for the green mixed fleet vehicle routing problem with realistic energy consumption and partial rechargesApplied Soft Computing, 2021
- Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distanceComputers & Operations Research, 2021
- Carbon pricing initiatives-based bi-level pollution routing problemEuropean Journal of Operational Research, 2020
- A hybrid large-neighborhood search algorithm for the cumulative capacitated vehicle routing problem with time-window constraintsApplied Soft Computing, 2019
- Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-dockingApplied Soft Computing, 2019
- A branch-and-price algorithm for a vehicle routing with demand allocation problemEuropean Journal of Operational Research, 2019
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windowsEuropean Journal of Operational Research, 2005