Naslov
The Non-Fixed Destination Multiple Depot Capacitated Vehicle Routing Problem And Genetic Algorithms

Autori
Skok, Minea ; Škrlec, Davor ; Krajcar, Slavko

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceedings of the 22nd International Conference on Information Technology Interfaces ITI'2000 / - , 2000

Skup
22nd International Conference on Information Technology Interfaces ITI'2000

Mjesto i datum
Pula, Hrvatska, 19.06.2000. - 22.06.2000

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
non-fixed destination Multiple Depot Capacitated Vehicle Routing Problem; genetic algorithm

Sažetak
Many organizations face the problem of delivering goods from a certain number of warehouses to a number of retail sites using a fleet of vehicles. The Multiple Depot Capacitated Vehicle Routing Problem is mathematical model that closely approximates the problem faced by many of these organizations. In regard that the problem is NP-hard, requiring excessive time to be exactly solved, in this article we develop heuristic based on genetic algorithm that finds high quality solutions in a reasonable amount of computer time. Basic procedures adapted to a given problem are presented that enable genetic algorithm to simultaneously route all vehicles. Also six versions of crossover operators are compared. The test results reveal that the method is able to produce results of a kind not easily obtained before namely in terms of an amount of information about the solutions and the solution space.

Izvorni jezik
Engleski

Znanstvena područja
Elektrotehnika

POVEZANOST RADA