Pregled bibliografske jedinice broj: 71760
GA Approach to Solving Multiple Vehicle Routing Problem
GA Approach to Solving Multiple Vehicle Routing Problem // Progress in Artificial Intelligence / Carbonell, Jaime G.; Siekmann, Jorg (ur.).
Berlin: Springer, 1995. str. 473-481
CROSBI ID: 71760 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
GA Approach to Solving Multiple Vehicle Routing Problem
Autori
Krajcar, Slavko ; Škrlec, Davor ; Pribićević, Branko ; Blagajac, Snježana
Vrsta, podvrsta i kategorija rada
Poglavlja u knjigama, znanstveni
Knjiga
Progress in Artificial Intelligence
Urednik/ci
Carbonell, Jaime G.; Siekmann, Jorg
Izdavač
Springer
Grad
Berlin
Godina
1995
Raspon stranica
473-481
ISBN
3-540-60428-6
Ključne riječi
genetic algorithm, optimization, multiple vehicle routing problem
Sažetak
Paper deals with the application of genetic algorithm in the Multiple Vehicle Routing Problem. A short overview of a previously on-site developed algorithm is given. The genetic algorithm is developed on basis of experiences in solving the Travelling Salesperson Problem. A few heuristic improvements are added in order to prevent converging to local optima and to reduce the search domain. The performance of the algorithm is investigated on two configurations, and so is the influence of each genetic parameter on the algorithm's effectiveness. The final assessment is given in conclusion.
Izvorni jezik
Engleski
Znanstvena područja
Elektrotehnika