Dynamic vehicle routing using an improved variable neighborhood search algorithm
type: Item
instance of: scholarly article
title: Dynamic vehicle routing using an improved variable neighborhood search algorithm
zbMATH Open document ID: 1268.90005
DOI: 10.1155/2013/672078
author: Yingcheng Xu
author: Li Wang
author: Yuexiang Yang
published in: Journal of Applied Mathematics
publication date: 2013-06-14T00:00:00Z
review text: Summary: In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clustering method. Hybrid operators of insert and exchange are used to achieve the shaking process, the later optimization process is presented to improve the solution space, and the best-improvement strategy is adopted, which make the algorithm can achieve a better balance in the solution quality and running time. The idea of simulated annealing is introduced to take control of the acceptance of new solutions, and the influences of arrival time, distribution of geographical location, and time window range on route selection are analyzed. In the experiment, the proposed algorithm is applied to solve the different sizes' problems of DVRP. Comparing to other algorithms on the results shows that the algorithm is effective and feasible.
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6175906
Wikidata QID: Q59003651
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/672078
OpenAlex ID: W2029820476
cites work: Variable neighborhood search for the p-median
cites work: Variable neighborhood decomposition search
cites work: Q4955268
cites work: Ant colony system for a dynamic vehicle routing problem
cites work: Online decision making and automatic decision model adaptation
cites work: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
cites work: Adaptive granular local search heuristic for a dynamic vehicle routing problem
cites work: Approximative solutions to the bicriterion vehicle routing problem with time windows
cites work: A reactive variable neighborhood search for the vehicle-routing problem with time windows
cites work: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
cites work: A general vehicle routing problem
cites work: A variable neighborhood search heuristic for periodic routing problems
cites work: A variable neighbourhood search algorithm for the open vehicle routing problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: A generalized insertion heuristic for the travelling salesman problem with time windows
cites work: Optimization by Simulated Annealing
DBLP publication ID: journals/jam/XuWY13
Recommended article: Variable neighborhood search for the stochastic and dynamic vehicle routing problem
Recommended article: A variable neighbourhood search algorithm for the open vehicle routing problem
Recommended article: A variable neighborhood search algorithm for the capacitated vehicle routing problem
Recommended article: A variable neighborhood search algorithm for the vehicle routing problem with multiple trips
Recommended article: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Recommended article: Variable neighborhood search for vehicle routing problem with multiple time windows
Recommended article: A fast multi-neighborhood iterated local search algorithm for vehicle routing problem
Recommended article: A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands
description: scientific article