A New Variable Neighborhood Search Algorithm for the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows

DOI10.1016/j.endm.2012.10.038zbMath1268.90165OpenAlexW1975600325MaRDI QIDQ2840789

Li Wang, Yuexiang Yang, Yingcheng Xu

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.038

zbMATH Keywords

vehicle routing problemvariable neighborhood searchheterogeneousmulti depot

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Thirty years of heterogeneous vehicle routing

Cites Work

• A column generation approach to the heterogeneous fleet vehicle routing problem
• A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
• A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
• A variable neighbourhood search algorithm for the open vehicle routing problem
• Variable neighborhood search for the p-median

This page was built for publication: A New Variable Neighborhood Search Algorithm for the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows