Tuning a parametric Clarke–Wright heuristic via a genetic algorithm
Tuning a parametric Clarke–Wright heuristic via a genetic algorithm
Almost all heuristic optimization procedures require the presence of a well-tuned set of parameters. The tuning of these parameters is usually a critical issue and may entail intensive computational requirements. We propose a fast and effective approach composed of two distinct stages. In the first stage, a genetic algorithm is applied to a small subset of representative problems to determine a few robust parameter sets. In the second stage, these sets of parameters are the starting points for a fast local search procedure, able to more deeply investigate the space of parameter sets for each problem to be solved. This method is tested on a parametric version of the Clarke and Wright algorithm and the results are compared with an enumerative parameter-setting approach previously proposed in the literature. The results of our computational testing show that our new parameter-setting procedure produces results of the same quality as the enumerative approach, but requires much shorter computational time
vehicle routing, heuristics, genetic algorithms
1568-1572
Battarra, Maria
0498dc58-e9d5-4ad2-a141-040f7bcebbc2
Golden, Bruce
971bcae2-be5b-4afd-acc0-3b558d31f7d2
Vigo, Daniele
0bc6db04-0bff-438e-91ca-947171d0604e
2008
Battarra, Maria
0498dc58-e9d5-4ad2-a141-040f7bcebbc2
Golden, Bruce
971bcae2-be5b-4afd-acc0-3b558d31f7d2
Vigo, Daniele
0bc6db04-0bff-438e-91ca-947171d0604e
Battarra, Maria, Golden, Bruce and Vigo, Daniele
(2008)
Tuning a parametric Clarke–Wright heuristic via a genetic algorithm.
Journal of the Operational Research Society, 59, .
(doi:10.1057/palgrave.jors.2602488).
Abstract
Almost all heuristic optimization procedures require the presence of a well-tuned set of parameters. The tuning of these parameters is usually a critical issue and may entail intensive computational requirements. We propose a fast and effective approach composed of two distinct stages. In the first stage, a genetic algorithm is applied to a small subset of representative problems to determine a few robust parameter sets. In the second stage, these sets of parameters are the starting points for a fast local search procedure, able to more deeply investigate the space of parameter sets for each problem to be solved. This method is tested on a parametric version of the Clarke and Wright algorithm and the results are compared with an enumerative parameter-setting approach previously proposed in the literature. The results of our computational testing show that our new parameter-setting procedure produces results of the same quality as the enumerative approach, but requires much shorter computational time
This record has no associated files available for download.
More information
e-pub ahead of print date: 29 August 2007
Published date: 2008
Keywords:
vehicle routing, heuristics, genetic algorithms
Organisations:
Operational Research
Identifiers
Local EPrints ID: 204849
URI: http://eprints.soton.ac.uk/id/eprint/204849
ISSN: 0160-5682
PURE UUID: 48ea6bbf-c723-4b55-a16d-b0762171b646
Catalogue record
Date deposited: 02 Dec 2011 14:13
Last modified: 14 Mar 2024 04:33
Export record
Altmetrics
Contributors
Author:
Maria Battarra
Author:
Bruce Golden
Author:
Daniele Vigo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics