Improving Clarke-Wright Algorithm with Genetic Programming

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00219995" target="_blank" >RIV/68407700:21230/14:00219995 - isvavai.cz</a>
Result on the web
<a href="http://artax.karlin.mff.cuni.cz/~bajel3am/itat2014/local/38_Hruska.pdf" target="_blank" >http://artax.karlin.mff.cuni.cz/~bajel3am/itat2014/local/38_Hruska.pdf</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Improving Clarke-Wright Algorithm with Genetic Programming
Original language description
This work proposes a genetic programming approach for producing an improved Clarke-Wright savings algorithm (CW) for solving capacitated vehicle routing problem (CVRP). CW is a very popular and fast low-level constructive heuristic which uses saving value, defined between each pair of two cities, to construct solutions for CVRP. The main idea of the proposed approach is to use genetic programming (GP) for evolving new mathematical functions for calculating the saving between each pair of cities. CW algorithm with the evolved function is tested on BranchAndCut VRP benchmarks. The results are promising and show improvement on the more than half of test instances.
Czech name
—
Czech description
—

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 14th conference ITAT 2014 ? Workshops and Posters
ISBN
978-80-87136-19-5
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
38-43
Publisher name
Institute of Computer Science AS CR
Place of publication
Praha
Event location
Demänovská Dolina
Event date
Sep 25, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)