An improved LNS algorithm for real-time vehicle routing problem with time windows

DOI10.1016/j.cor.2011.03.006zbMath1251.90019OpenAlexW2085036734MaRDI QIDQ1761960

Lianxi Hong

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.03.006

zbMATH Keywords

heuristicslarge neighborhood searchdynamic vehicle routing problemhard time window

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Dynamic design of sales territories, An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen, A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline, A bi-objective approach for scheduling ground-handling vehicles in airports, A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem, The secure time-dependent vehicle routing problem with uncertain demands, Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO, Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique, Solving the tractor and semi-trailer routing problem based on a heuristic approach, A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows, A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window, TLHSA and SACA: two heuristic algorithms for two variant VRP models

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• Real-time vehicle rerouting problems with time windows
• Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
• Variable neighborhood tabu search and its application to the median cycle problem.
• Dynamic vehicle routing: Status and prospects
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• Diversion Issues in Real-Time Vehicle Dispatching
• A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times
• Partially dynamic vehicle routing—models and algorithms
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers