Title: A hybrid optimal solution for the combinatorial problem of vehicle routing

Authors: Kirti Pandey; Chandra Kumar Jha

Addresses: Computer Science Department, Banasthali Vidyapith, Rajasthan, India ' Computer Science Department, Banasthali Vidyapith, Rajasthan, India

Abstract: Vehicle routing problem (VRP) is a classic combinatorial optimisation problem. It is a type of problem in which the solution is made up of a set of fundamental discrete decisions or assumptions. For solving a class of this issue, we devised a hybrid approach that integrates certain characteristics of firefly optimisation and particle swarm optimisation algorithms. The objective is to derive the best possible solutions for capacitated VRP using this hybrid optimisation model. The unexplored solution space is searched in the proposed work through FA, whereas PSO provided the essential structure for our suggested approach. Dynamic adaptation for some parameters is applied to some particles which gradually increases its values during the search process for the velocity values. It is worth noting that the particles utilise the dynamic values at each generation will be different. The best possible solutions are from a run of 20 experiments are evaluated and compared with the other approaches.

Keywords: combinatorial problem; firefly algorithm; particle swarm optimisation; PSO; vehicle routing problem; VRP; dynamic adaptation mechanism.

DOI: 10.1504/IJIEI.2023.136104

International Journal of Intelligent Engineering Informatics, 2023 Vol.11 No.4, pp.337 - 352

Received: 17 Apr 2023
Accepted: 05 Aug 2023
Published online: 16 Jan 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article