Rozdziały
Stały URI dla kolekcjihttp://hdl.handle.net/11652/4011
Przeglądaj
Pozycja Comparison of Selected Algorithms Solving Vehicle Routing Problem with Simultaneous Delivery and Pickup(Wydawnictwo Politechniki Łódzkiej, 2021) Michalik, Maciej; Ochelska-Mierzejewska, JoannaThe Vehicle Routing Problem is a widely known combinatorial optimization problem. A particular variant of this problem is Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP). In this paper, two metaheuristics are compared in the context of solving the VRPSDP - the Genetic Algorithm (GA) and Ant Colony Optimization (ACO). Both implemented algorithms are hybridized using local search operators. Implemented algorithms are tested using well known Dethloff dataset. The final results show that, in general, ACO gives more accurate results than GA, but it is worse in terms of performance. The main reason for that is the difficulty of incorporating local search operators into the Genetic Algorithm.