Journal ArticleDOI
Variable neighborhood descent for solving the vehicle routing problem with time windows
TLDR
This paper designs an integrated transportation solver for the Vehicle Routing Problem with Time Windows and proposes a VND approach, which provided better results, in terms of solution quality, than existing approaches results.About:
This article is published in Electronic Notes in Discrete Mathematics.The article was published on 2017-04-01. It has received 14 citations till now. The article focuses on the topics: Vehicle routing problem & Combinatorial optimization.read more
Citations
More filters
Journal ArticleDOI
Efficient implementation of the genetic algorithm to solve rich vehicle routing problems
TL;DR: A Genetic Algorithm (GA)-based approach is proposed to tackle the rich vehicle routing problem (RVRP), which is a well-known combinatorial optimization problem arising in many transportation and logistics settings and shows good cost-effectiveness.
Journal ArticleDOI
A Survey for Vehicle Routing Problems and Its Derivatives
Ming Han,Yabin Wang +1 more
Journal ArticleDOI
Optimization of Water Quality Monitoring Networks Using Metaheuristic Approaches: Moscow Region Use Case
Elizaveta Yudina,Anna Petrovskaia,Dmitrii Shadrin,Polina Tregubova,Elizaveta Chernova,Mariia Pukalchik,Ivan V. Oseledets +6 more
TL;DR: The paper offers and tests metaheuristic approaches for optimization of monitoring procedure and multi-factors assessment of water quality in “New Moscow” area and shows that the proposed algorithms dramatically decrease the total cost of analysis without dampening the quality of monitoring and could be recommended for optimization purposes.
References
More filters
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.
Book ChapterDOI
Iterated local search
TL;DR: Iterated Local Search (ILS) as mentioned in this paper is a general purpose metaheuristic for finding good solutions of combinatorial optimization problems, which is based on building a sequence of (locally optimal) solutions by perturbing the current solution and applying local search to that modified solution.
Journal ArticleDOI
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Olli Bräysy,Michel Gendreau +1 more
TL;DR: This paper surveys the research on the metaheuristics for the Vehicle Routing Problem with Time Windows and describes basic features of each method, and experimental results for Solomon's benchmark test problems are presented and analyzed.
Journal ArticleDOI
Heuristic methods for vehicle routing problem with time windows
TL;DR: Each of the heuristics developed to Solomon's 56 VRPTW 100-customer instances are applied, and yielded 18 solutions better than or equivalent to the best solution ever published for these problems.
Journal ArticleDOI
Localized genetic algorithm for vehicle routing problem with time windows
TL;DR: It is demonstrated that the LGA is, on average, able to produce better solutions than most of the other heuristics on small scale problems of VRPTW and has attained several new best solutions on popular datasets.