A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline

DOI10.1007/978-3-319-26626-8_23zbMath1478.90114OpenAlexW2402161193MaRDI QIDQ3467854

Dan Yang, Xiaohan He, Liang Song, Hongwei David Du, Hejiao Huang

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_23

zbMATH Keywords

LNSinsert heuristicDVRPTDtime deadline

Mathematics Subject Classification ID

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

Related Items (2)

A monarch butterfly optimization for the dynamic vehicle routing problem ⋮ Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO

Cites Work

• An improved LNS algorithm for real-time vehicle routing problem with time windows
• Dynamic vehicle routing: Status and prospects
• A review of dynamic vehicle routing problems
• Dynamic transportation of patients in hospitals
• Ant colony system for a dynamic vehicle routing problem
• The Truck Dispatching Problem
• The period routing problem
• Parallel iterative search methods for vehicle routing problems

This page was built for publication: A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline