Naslov
Genetic Algorithm Approach For Multiple Depot Capacitated Vehicle Routing Problem Solving With Heuristic Improvements Built-In

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

Izvornik
International Journal of Modelling and Simulation (0228-6203) 20 (2000), 4; 320-328

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
Multiple Depot Capacitated Vehicle Routing Problem (MDCVRP); Genetic Algorithm (GA); Heuristic Improvements

Sažetak
The paper proposes a genetic algorithm (GA) in conjunction with handy heuristic techniques to solve the non-fixed destination Multiple Depot Capacitated Vehicle Routing Problem (MDCVRP). New heuristic techniques are added in order to prevent converging to local optima, and to speed up the convergence of the algorithm by reduction of the search space domain. The proposed GA approach has been tested on several instances of practical long-term link distribution network design problem which could be easily correlated with the non-fixed destination MDCVRP. Test results reveal that the features of easy implementation, fast convergence, and near optimal solution in solving the MDCVRP can be achieved by the proposed GA approach.

Izvorni jezik
Engleski

Znanstvena područja
Elektrotehnika

POVEZANOST RADA