A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
A Multi-parametric Evolution Strategies Algorithm for Vehicle Routing Problems (2007)


Mester, D., Bräysy, O., & Dullaert, W. (2007). A Multi-parametric Evolution Strategies Algorithm for Vehicle Routing Problems. Expert Systems with Applications, 32(2), 508-517. https://doi.org/10.1016/j.eswa.2005.12.014


JYU-tekijät tai -toimittajat


Julkaisun tiedot

Julkaisun kaikki tekijät tai toimittajatMester, David; Bräysy, Olli; Dullaert, Wout

Lehti tai sarjaExpert Systems with Applications

ISSN0957-4174

eISSN1873-6793

Julkaisuvuosi2007

Volyymi32

Lehden numero2

Artikkelin sivunumerot508-517

KustantajaElsevier

JulkaisumaaAlankomaat

Julkaisun kielienglanti

DOIhttps://doi.org/10.1016/j.eswa.2005.12.014

Julkaisun avoin saatavuusEi avoin

Julkaisukanavan avoin saatavuus


Tiivistelmä

Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) in order to efficiently service a number of demand or supply points. In this paper an efficient evolution strategies algorithm is developed for both capacitated vehicle routing problem and for vehicle routing problem with time window constraints. The algorithm is based on a new multi-parametric mutation procedure that is applied within the 1 + 1 evolution strategies algorithm. Computational testing on six real-life problems and 195 benchmark problems demonstrate that the suggested algorithm is efficient and highly competitive, improving or matching the current best-known solution in 42% of the test cases.


YSO-asiasanatjakeluliikenneajoneuvotreititysalgoritmittekoäly

Vapaat asiasanatDistribution management; Vehicle routing problem; Heuristics; Evolution strategies


Liittyvät organisaatiot

JYU-yksiköt:


OKM-raportointiKyllä

Alustava JUFO-tasoNot rated


Viimeisin päivitys 2023-14-12 klo 19:14