Naslov
Darwin Meets Computers : New Approach To Multiple Depot Capacitated Vehicle Routing Problem

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

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

Izvornik
Proceedings of the International Conference on System, Man and Cybernetics / Tien, James M. - : Institute of Electrical and Electronics Engineers (IEEE), 1997, 421-426

Skup
The International Conference on System, Man and Cybernetics

Mjesto i datum
Orlando (FL), Sjedinjene Američke Države, 12.10.1997. - 15.10.1997

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
multiple depot capacitated vehicle routing problem (MDCVRP); genetic algorithm (GA); heuristic improvements

Sažetak
We present a study of using genetic algorithms to solve non-fixed destination multiple-depot capacitated vehicle routing problem (MDCVRP). The genetic algorithm was developed on the basis of experiences in solving the Travelling Salesman Problem (TSP) and the Single Depot Capacitated Vehicle Routing Problem (CVRP). Heuristic improvements in population initialization and crossover operators are made to prevent converging to local optima and to reduce the search space domain. To deal effectively with the constraints of the problem, and to prune the search space of GA in advance, the difficult capacity and supply reliability constraints are embedded in the decimal strings that are coded to represent the vehicle routes between depots. Computational results carried out on several instances indicate that the total distance traveled can be reduced significantly when such method is used.

Izvorni jezik
Engleski

Znanstvena područja
Elektrotehnika

POVEZANOST RADA