| dc.description.abstract |
Vehicle Routing Problem is one of the classical NP hard and combinatorial optimization problems that has been a spark of interest in the operation research domain. Though many variations of classical VRP are being developed, there is still the need for developing algorithms to improve solutions for VRP. A hybrid gain-based ant colony optimization-firefly algorithm (GACO-FA) has been proposed to deal with VRP. A global search is initially performed using the gain-based ant colony optimization, and subsequently local search for promising solution is done in the fine-tuned search space using firefly algorithm. The strengths of GACO and weakness of FA are aptly managed with a finer trade-off between them. The proposed GACO-FA is compared with best-known solutions and existing algorithms for performance analysis using the benchmark dataset. Analysis has been performed using measures like route cost, standard deviation, and percentage variation in length. The results have also been statistically verified for their significance. |
en_US |