SOLVING VEHICLE ROUTING PROBLEM WITH MULTIPLE OBJECTIVE METAHEURISTIC ALGORITHMS



Michal Maciejewski and Waldemar Walerjanczyk
Instytut Maszyn Roboczych i Pojazdów Samochodowych Politechnika Poznanska ul. Piotrowo 3, 60-965 Poznan, Poland e-mail: michal-m@o2.pl, wal@sol.put.poznan.pl



ABSTRACT: Vehicle Routing Problem (VRP) is a very important problem in real life. Till now many heuristic methods have been successfully applied to this problem. However, these algorithms concern the single objective optimization, while the multiple objective VRP usually is not taken into consideration. This paper is an attempt to apply multiple objective metaheuristics to the VRP. In the first part of the paper basic theoretical aspects of the VRP and multiple objective metaheuristic algorithms are introduced. Then the way of applying these metaheuristics to the VRP is presented and analyzed in detail. In the last part experimental results are presented and discussed.


KEYWORDS: Vehicle Routing Problem, Multiple Objective Optimization, Metaheuristics, Genetic Algorithms, Evolutionary Algorithms, Hybrid Genetic Algorithms

---

Back to MAS2003 Home Page