Bibliometric Analysis Of Travelling Salesman Problem With Drones (TSP-D)

Authors

  • Yugeswary Kanesen
  • Hasneeza Liza Zakaria
  • M. S Asi
  • Rozmie Razif Othman
  • Wan Nur Suryani Firuz Wan Ariffin
  • Nuraminah Ramli
  • Mohd Alif Hasmani Abd Ghani

DOI:

https://doi.org/10.58915/ijact.v4.2024.1647

Abstract

The growing need for efficient package delivery systems in Last Mile Delivery (LMD) has attracted significant attention, bringing the Travelling Salesman Problem with Drones (TSP-D) to the forefront of scholarly research. The research under consideration generated a surge in scientific output across various domains, including economics, industry, and logistics, owing to the potential benefits it presents. The primary objective of this study is to compile, organize, and analyze the literature on TSP-D in the context of LMD. A comprehensive bibliometric analysis scrutinized the progress made in this field during the period spanning 2017 to 2024. The study encompassed an extensive analysis of a corpus of 2,397 scholarly publications, yielding numerous intriguing conclusions derived from a meticulously constructed framework. This review addresses inquiries about the most prevalent research categories on resolving TSP-D, focusing on exact and metaheuristic approaches.

Keywords:

Combinatorial optimization, drones, LMD, metaheuristics, TSP-D

Downloads

Published

2024-12-30

How to Cite

Yugeswary Kanesen, Hasneeza Liza Zakaria, M. S Asi, Rozmie Razif Othman, Wan Nur Suryani Firuz Wan Ariffin, Nuraminah Ramli, & Mohd Alif Hasmani Abd Ghani. (2024). Bibliometric Analysis Of Travelling Salesman Problem With Drones (TSP-D). International Journal of Advanced Communication Technology (IJACT), 4, 29–46. https://doi.org/10.58915/ijact.v4.2024.1647

Issue

Section

Articles