A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window
type: Item
instance of: scholarly article
title: A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window
zbMATH Open document ID: 1297.90018
author: Wenbin Hu
author: Huanle Liang
author: Chao Peng
author: Bo Du
author: Qi Hu
published in: Entropy
publication date: 2014-09-19T00:00:00Z
review text: Summary: State-of-the-art heuristic algorithms to solve the vehicle routing problem with time windows (VRPTW) usually present slow speeds during the early iterations and easily fall into local optimal solutions. Focusing on solving the above problems, this paper analyzes the particle encoding and decoding strategy of the particle swarm optimization algorithm, the construction of the vehicle route and the judgment of the local optimal solution. Based on these, a hybrid chaos-particle swarm optimization algorithm (HPSO) is proposed to solve VRPTW. The chaos algorithm is employed to re-initialize the particle swarm. An efficient insertion heuristic algorithm is also proposed to build the valid vehicle route in the particle decoding process. A particle swarm premature convergence judgment mechanism is formulated and combined with the chaos algorithm and Gaussian mutation into HPSO when the particle swarm falls into the local convergence. Extensive experiments are carried out to test the parameter settings in the insertion heuristic algorithm and to evaluate that they are corresponding to the data's real-distribution in the concrete problem. It is also revealed that the HPSO achieves a better performance than the other state-of-the-art algorithms on solving VRPTW.
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 6346111
zbMATH Keywords: VRPTW
zbMATH Keywords: PSO
zbMATH Keywords: chaos algorithm
zbMATH Keywords: insertion heuristic algorithm
zbMATH Keywords: Gaussian mutation
describes a project that uses: MACS-VRPTW
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/e15041247
OpenAlex ID: W2033843955
cites work: Vehicle routing considerations in distribution system design
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
cites work: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
cites work: Tabu search heuristics for the vehicle routing problem with time windows.
cites work: A tabu search heuristic for the heterogeneous fleet vehicle routing problem
cites work: A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
cites work: Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
cites work: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
cites work: An improved LNS algorithm for real-time vehicle routing problem with time windows
cites work: A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
cites work: An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
cites work: An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
cites work: Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
cites work: Q5310731
DOI: 10.3390/E15041247
description: scientific article; zbMATH DE number 6346111