Journal ArticleDOI
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
Reads0
Chats0
TLDR
The paper presents an efficient Hybrid Genetic Search with Advanced Diversity Control for a large class of time-constrained vehicle routing problems, introducing several new features to manage the temporal dimension.About:
This article is published in Computers & Operations Research.The article was published on 2013-01-01. It has received 452 citations till now. The article focuses on the topics: Static routing & Vehicle routing problem.read more
Citations
More filters
Journal ArticleDOI
Exact Method for the Vehicle Routing Problem with Mixed Linehaul and Backhaul Customers, Heterogeneous Fleet, time Window and Manufacturing Capacity☆
TL;DR: In this paper, the authors address the problem of designing a set of vehicle routes satisfying the delivery and the collection requirements of a set geographically scattered linehaul and backhaul customers, where each customer has a known demand for delivery and/or pickup, and it must be serviced within a predefined time window, representing the earliest and the latest times service time.
Proceedings ArticleDOI
A math-hyper-heuristic approach for large-scale vehicle routing problems with time windows
TL;DR: This study presented a math-hyper-heuristic approach to tackle vehicle routing more effectively and more efficiently and achieved better solutions in comparison with two state of the art methods on all instances.
Journal ArticleDOI
Heuristics for vehicle routing problems: Sequence or set optimization?
TL;DR: In this article, a structural decomposition for the capacitated vehicle routing problem (CVRP) based on vehicle-to-customer "assignment" and visits "sequencing" decision variables is investigated.
Journal ArticleDOI
Temperature drift modeling and compensation of capacitive accelerometer based on AGA-BP neural network
TL;DR: The results validate that, the AGA-BP compensation model has the best effect, compared to the multiple linear regression (MLR) compensation model and GA- BP compensation model, of high reference values for compensating rapid temperature variation.
Journal ArticleDOI
A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows
TL;DR: In this paper, a hybrid metaheuristic algorithm is proposed to solve the time-dependent vehicle routing problem with hard time windows, which makes use of Large Neighbourhood Search (LNS) and Variable Neighbor Search (VNS) techniques.
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.
The traveling salesman problem
TL;DR: This study tested human performance on a real and virtual floor, as well as in a threedimensional (3D) virtual space, and modeled these results by a graph pyramid algorithm, which suggests that deterioration of performance in the 3D space can be attributed to geometrical relations between hierarchical clustering in a3D space and coarse-to-fine production of a tour.
Journal ArticleDOI
A general heuristic for vehicle routing problems
David Pisinger,Stefan Ropke +1 more
TL;DR: A unified heuristic which is able to solve five different variants of the vehicle routing problem and shown promising results for a large class of vehicle routing problems with backhauls as demonstrated in Ropke and Pisinger.
Journal ArticleDOI
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms
Olli Bräysy,Michel Gendreau +1 more
TL;DR: How heuristic methods should be evaluated and proposed using the concept of Pareto optimality in the comparison of different heuristic approaches are discussed.
Book ChapterDOI
Local Search in Combinatorial Optimization
TL;DR: Computational bounds for local search in combinatorial local search algorithms for Combinatorial problems local searchgorithms for solving the combinatoric a dual local search framework for combinatorials the max-min ant system and local search for combinatorsial a framework for local combinatoria optimization problems localSearch in combinatorship optimization radarx heuristics and localsearch paginas.