EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 3.0

A Mathematical Model for the Vehicles Routing Problem with Multiple Depots, Considering the Possibility of Return Using the Tabu Search Algorithm

Alim Al Ayub Ahmed, Saurabh Singhal, A. S. Prakaash, Johnry Dayupay, Irwan Rahadi, Haydar Abdulameer Marhoon, A. Heri Iswanto, Saja Fadhil Abbas, Surendar Aravindhan

Foundations of Computing and Decision Sciences · 01.12.2022 · 47 (4) · 359-370

DOI: 10.2478/fcds-2022-0019 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Foundations of Computing and Decision Sciences, online erschienen am 13.12.2022. Verfasst von Alim Al Ayub Ahmed und 8 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 24 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 3.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The current study examines an essential type of vehicle routing problem (VRP). This type is one where customers are served by limited-capacity vehicles from multiple depots and is known as Multi-Depot Capacitated Vehicle Routing Problem (MDCVRP). The novelty of this study is that in the present case, cars, after Leaving the Depot, can go back to any other depot. Those issues seem to occur in most real-world issues where information, messages, or news are sent electronically from somewhere. The purpose of the problem is to minimize the costs associated with routing. Regarding the literature on such issues, it has been proven in previous studies and research that these problems are among the hard-NP problems, and to solve them using the metaheuristic method, the exact methods justify it. After changing the basic model, this study developed a Tabu Search (TS) algorithm. The study results demonstrate that if the equipment can return to any depot, the cost is significantly reduced in contrast to the case where equipment is forced to return to their depot.

Zitieren

APA

Ahmed, A. A. A., Singhal, S., Prakaash, A. S., Dayupay, J., Rahadi, I., Marhoon, H. A., Iswanto, A. H., Abbas, S. F., & Aravindhan, S. (2022). A Mathematical Model for the Vehicles Routing Problem with Multiple Depots, Considering the Possibility of Return Using the Tabu Search Algorithm. Foundations of Computing and Decision Sciences, 47(4), 359-370. https://doi.org/10.2478/fcds-2022-0019

Vancouver

Ahmed AAA, Singhal S, Prakaash AS, Dayupay J, Rahadi I, Marhoon HA, et al. A Mathematical Model for the Vehicles Routing Problem with Multiple Depots, Considering the Possibility of Return Using the Tabu Search Algorithm. Foundations of Computing and Decision Sciences. 2022;47(4):359-370. doi:10.2478/fcds-2022-0019

BibTeX
@article{Ahmed2022,
  author = {Ahmed, Alim Al Ayub and Singhal, Saurabh and Prakaash, A. S. and Dayupay, Johnry and Rahadi, Irwan and Marhoon, Haydar Abdulameer and Iswanto, A. Heri and Abbas, Saja Fadhil and Aravindhan, Surendar},
  title = {A Mathematical Model for the Vehicles Routing Problem with Multiple Depots, Considering the Possibility of Return Using the Tabu Search Algorithm},
  journal = {Foundations of Computing and Decision Sciences},
  year = {2022},
  volume = {47},
  number = {4},
  pages = {359--370},
  doi = {10.2478/fcds-2022-0019}
}
Kostenlos starten →