Improving parametric Clarke and Wright algorithms by means of EAGH-1

View/Open
Document typeArticle
Defense date2014-06-01
PublisherInstitut d'Estadística de Catalunya
Rights accessOpen Access
Abstract
Since Clarke and Wright proposed their well-known savings a
lgorithm for solving the Capacitated Vehicle Routing Problem, several enhancements to the original savings formula have been
recently proposed, in the form of parameterisations. In this paper we first propose to use Empirically Adjusted Greedy Heuristics to run these parameterized heuristics and we also consider the addition of new parameters. This approach is shown to improve the savings
algorithms proposed in the literature. Moreover, we propose a new procedure which leads to even better solutions, based on what we call Iterative Empirically Adjusted Greedy Heuristics
CitationCorominas, A.; García-Villoria, A.; Pastor, R. Improving parametric Clarke and Wright algorithms by means of EAGH-1. "SORT: statistics and operations research transactions", 01 Juny 2014, vol. 38, núm. 1, p. 3-12.
ISSN1696-2281
Files | Description | Size | Format | View |
---|---|---|---|---|
article Corominas et al. (corr.).pdf | Article principal | 105,9Kb | View/Open |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain