Generation of VNS components with grammatical evolution for vehicle routing

Authors:
John H. Drake;Nikolaos Kililis;Ender Özcan
Affiliations:
School of Computer Science, University of Nottingham, Nottingham, UK;School of Computer Science, University of Nottingham, Nottingham, UK;School of Computer Science, University of Nottingham, Nottingham, UK
Venue:
EuroGP'13 Proceedings of the 16th European conference on Genetic Programming
Year:
2013

Citing 20
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Variable neighborhood search

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Hyperheuristic Approach to Scheduling a Sales Summit

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Models, relaxations and exact approaches for the capacitated vehicle routing problem

Discrete Applied Mathematics
Automated discovery of composite SAT variable-selection heuristics

Eighteenth national conference on Artificial intelligence
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language

Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach

Journal of Scheduling
A general heuristic for vehicle routing problems

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

Transportation Science
Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Linear genetic programming of metaheuristics

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Automated discovery of local search heuristics for satisfiability testing

Evolutionary Computation
Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Generating SAT local-search heuristics using a GP hyper-heuristic framework

EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics

IEEE Transactions on Evolutionary Computation
Evolving bin packing heuristics with genetic programming

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Automating the packing heuristic design process with genetic programming

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The vehicle routing problem (VRP) is a family of problems whereby a fleet of vehicles must service the commodity demands of a set of geographically scattered customers from one or more depots, subject to a number of constraints. Early hyper-heuristic research focussed on selecting and applying a low-level heuristic at a given stage of an optimisation process. Recent trends have led to a number of approaches being developed to automatically generate heuristics for a number of combinatorial optimisation problems. Previous work on the VRP has shown that the application of hyper-heuristic approaches can yield successful results. In this paper we investigate the potential of grammatical evolution as a method to evolve the components of a variable neighbourhood search (VNS) framework. In particular two components are generated; constructive heuristics to create initial solutions and neighbourhood move operators to change the state of a given solution. The proposed method is tested on standard benchmark instances of two common VRP variants.