Proceedings ArticleDOI
Re-optimization in dynamic vehicle routing problem based on Wasp-like agent strategy
Jingyan Song,Jianming Hu,Yan Tian,Yangsheng Xu +3 more
- pp 231-236
Reads0
Chats0
TLDR
A Wasp-like agent strategy to decide when to deal with the real-time requests and reoptimize the vehicle routes is presented and the results show that the method works effectively to find competitive solutions.Abstract:
The dynamic vehicle routing problem, DVRP, is focused on optimally routing a fleet of vehicles of fixed capacity when the real-time requests of customers occur. The optimization is to search for the solution in minimizing the total length of tours and to satisfy the customer delivery time window. In this paper, we present a Wasp-like agent strategy to decide when to deal with the real-time requests and reoptimize the vehicle routes. The results show that the method works effectively to find competitive solutions.read more
Citations
More filters
Book
Metaheuristics: From Design to Implementation
TL;DR: This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling.
Journal ArticleDOI
An improved LNS algorithm for real-time vehicle routing problem with time windows
TL;DR: In this paper, an improved large neighborhood search (LNS) algorithm is proposed to solve the static problem of dynamic vehicle routing problem with hard time windows (DVRPTW).
Journal ArticleDOI
DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
TL;DR: The experimental results have shown that, due to the dynamic nature of the hyper-heuristic, the proposed approach is able to adapt to dynamic scenarios more naturally than low-level heuristics, and can obtain high-quality solutions when compared with other (meta) heuristic-based methods.
Book ChapterDOI
An Improved Evolutionary Algorithm for Dynamic Vehicle Routing Problem with Time Windows
TL;DR: A dynamic route evaluation model for modeling the responses of vehicles to changing traffic information, a modified Dijkstra's double bucket algorithm for finding the real-time shortest paths, and an improved evolutionary algorithm for searching the best vehicle routes in dynamic network are proposed.
Journal IssueDOI
Wasp swarm optimization of the c-means clustering model
TL;DR: A wasp swarm optimization (WSO) algorithm to optimize the c-means clustering model is introduced and in experiments with four benchmark data sets, the new WSO clustering algorithm is compared with AO and ACO.
References
More filters
Journal ArticleDOI
Ant colony system: a cooperative learning approach to the traveling salesman problem
TL;DR: The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and it is concluded comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs.
Journal ArticleDOI
Algorithms for the vehicle routing and scheduling problems with time window constraints
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
Journal ArticleDOI
Parallel iterative search methods for vehicle routing problems
TL;DR: Two partition methods that speed up iterative search methods applied to vehicle routing problems including a large number of vehicles, based on the arborescence built from the shortest paths from any city to the depot are presented.
Journal ArticleDOI
Dynamic vehicle routing: Status and prospects
TL;DR: The assessment of possible impact of new technologies and the distinction of dynamic problems vis-à-vis their static counterparts are given emphasis and the main issues in this rapidly growing area are examined.
Proceedings ArticleDOI
A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems
Bernd Freisleben,Peter Merz +1 more
TL;DR: The combination of local search heuristics and genetic algorithms is a promising approach for finding near-optimum solutions to the traveling salesman problem (TSP) and the results indicate that it is possible to arrive at high quality solutions in reasonable time.