A parametric study for artificial bee colony algorithm used in vehicle routing problem with simultaneous delivery and pickup

Küçük Resim Yok

Tarih

2019

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Nova Science Publishers, Inc.

Erişim Hakkı

info:eu-repo/semantics/closedAccess

Özet

Although meta-heuristic methods may be successful in solving optimization problems in a short time, it takes a long time to find the appropriate parameter values for the related solution technique. Thus, the most important stage after choosing a solution algorithm is the identification of the most accurate values for the algorithm parameters. In this study, the ability of the Artificial Bee Colony (ABC) algorithm in optimization problems and its performance in different parameter values has been examined. The proposed model was applied for vehicle routing problem with simultaneous delivery and pickup (VRPSDP), which is one of the most famous optimization problems in the real world in NP-Hard problems class and was tested on benchmarks in the literature. When the best results obtained by ABC were compared with the best results in the literature, it was seen that the performance of the ABC is similar to other population-based algorithms with the advantage of employing fewer control parameters. To examine the solution-search approach of the algorithm for problems that have different solution space and its performance, standard deviation values in the problem parameters were compared with the standard deviation values in solutions obtained by the algorithm. © 2020 by Nova Science Publishers, Inc.

Açıklama

Anahtar Kelimeler

ABC, Metaheuristic, Optimization, VRPSDP

Kaynak

Optimization and Robotic Applications

WoS Q Değeri

Scopus Q Değeri

N/A

Cilt

Sayı

Künye