Book ChapterDOI
Developing a Hyper-Heuristic Using Grammatical Evolution and the Capacitated Vehicle Routing Problem
Richard J. Marshall,Mark Johnston,Mengjie Zhang +2 more
- pp 668-679
TLDR
A hyper-heuristic is developed, using Grammatical Evolution, to generate and apply heuristics that develop good solutions to Vehicle Routing Problem instances with only limited prior knowledge of the problem domain to be solved.Abstract:
A common problem when applying heuristics is that they often perform well on some problem instances, but poorly on others. We work towards developing a hyper-heuristic that manages delivery of good quality solutions to Vehicle Routing Problem instances with only limited prior knowledge of the problem domain to be solved. This paper develops a hyper-heuristic, using Grammatical Evolution, to generate and apply heuristics that develop good solutions. Through a series of experiments we expand and refine the technique, achieving good quality results on 40 well known Capacitated Vehicle Routing Problem instances.read more
Citations
More filters
Proceedings ArticleDOI
Grammatical Evolution for the Multi-Objective Integration and Test Order Problem
TL;DR: An offline hyper-heuristic named GEMOITO, based on Grammatical Evolution (GE), is presented to automatically generate a Multi-Objective Evolutionary Algorithm (MOEA) to solve the Integration and Test Order (ITO) problem.
Proceedings ArticleDOI
Examining the "Best of Both Worlds" of Grammatical Evolution
TL;DR: This paper examines the behaviour of three grammar-based search methods on several problems from previous GE research and shows that, unlike CFG-GP, the performance of "pure" GE on the examined problems closely resembles that of random search.
Journal ArticleDOI
The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach
TL;DR: This work proposes a hybrid of hyper-heuristic and a relax-and-cut solution method, which includes cooperation among several low-level heuristics governed and controlled by a learning mechanism, and confirms the efficiency of this solution method in terms of quality as well as computational time.
Proceedings ArticleDOI
Applying automatic heuristic-filtering to improve hyper-heuristic performance
Andres Eduardo Gutierrez-Rodríguez,José Carlos Ortiz-Bayliss,Alejandro Rosales-Pérez,Ivan M. Amaya-Contreras,Santiago Enrique Conant-Pablos,Hugo Terashima-Marín,Carlos A. Coello Coello +6 more
TL;DR: An automatic heuristic-filtering process is proposed that allows hyper-heuristics to exclude heuristics that do not contribute to improving the solution and two methods are proposed that rankHeuristics and sequentially select only suitable heuristic in a hyper- heuristic framework.
References
More filters
Book
Genetic Programming: On the Programming of Computers by Means of Natural Selection
TL;DR: This book discusses the evolution of architecture, primitive functions, terminals, sufficiency, and closure, and the role of representation and the lens effect in genetic programming.
Journal ArticleDOI
Tabu Search—Part II
TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
Journal ArticleDOI
The Truck Dispatching Problem
George B. Dantzig,J. H. Ramser +1 more
TL;DR: A procedure based on a linear programming formulation is given for obtaining a near optimal solution to the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal.
MonographDOI
The vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
TL;DR: In this paper, the authors present a comprehensive overview of the most important techniques proposed for the solution of hard combinatorial problems in the area of vehicle routing problems, focusing on a specific family of problems.
Journal ArticleDOI
The vehicle routing problem: An overview of exact and approximate algorithms
TL;DR: In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed.