Dynamic vehicle routing using an improved variable neighborhood search algorithm

DOI10.1155/2013/672078zbMath1268.90005WikidataQ59003651 ScholiaQ59003651MaRDI QIDQ2375629

Li Wang, Yuexiang Yang, Yingcheng Xu

Publication date: 14 June 2013

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/672078

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90B80: Discrete location and assignment

Related Items

An integration of mixed VND and VNS: the case of the multivehicle covering tour problem, Dynamic vehicle routing problems with enhanced ant colony optimization

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• A general vehicle routing problem
• Online decision making and automatic decision model adaptation
• Adaptive granular local search heuristic for a dynamic vehicle routing problem
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
• Approximative solutions to the bicriterion vehicle routing problem with time windows
• Variable neighborhood decomposition search
• A variable neighborhood search heuristic for periodic routing problems
• A variable neighbourhood search algorithm for the open vehicle routing problem
• Ant colony system for a dynamic vehicle routing problem
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
• Variable neighborhood search for the p-median
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows