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
New enhancements for the exact solution of the vehicle routing problem with time windows
TL;DR: Two enhancements for the exact solution of the VRPTW by branch-price-and-cut BPC are introduced and a sharper form of the limited-memory subset-row inequalities is developed by representing the memory as an arc subset rather than a node subset.
Journal ArticleDOI
A new fusion of salp swarm with sine cosine for optimization of non-linear functions
TL;DR: A novel hybrid powerful meta-heuristic that integrates the salp swarm algorithm with sine cosine algorithm (called HSSASCA) for improving the convergence performance with the exploration and exploitation being superior to other comparative standard algorithms.
Journal ArticleDOI
A hybrid multi-objective genetic local search algorithm for the prize-collecting vehicle routing problem
TL;DR: A Pareto-based evolutionary algorithm featuring a genetic algorithm combined with a local search strategy and a vehicle-number-range determination approach is proposed to obtain a tight upper bound and lower bound of the number of vehicles in the multi-objective PCVRP-P problem.
Journal ArticleDOI
Slack Induction by String Removals for Vehicle Routing Problems
TL;DR: This research presents a novel and scalable approach called “SmartCard” that automates the very labor-intensive and therefore time-heavy and expensive process of manually cataloging and routing vehicles through a network.
Journal ArticleDOI
A novel hybrid shuffled frog leaping algorithm for vehicle routing problem with time windows
TL;DR: The modified clone selection procedure is presented to improve the quality of the solutions and bring more diversity to the population and the adaptive soft time windows penalty measure is proposed to allow the existence of infeasible solutions in the evolution process.
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.