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

Single Depot Multiple Travelling Salesman Problem Solved With Preference-Based Stepping Ahead Firefly Algorithm

Ravneil Nand, Kaylash Chaudhary, Bibhya Sharma

IEEE Access · 2024 · 12 · 26655-26666

DOI: 10.1109/access.2024.3366183 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Access, 2024. Verfasst von Ravneil Nand und 2 weiteren Autor:innen. Die Arbeit wurde bisher 11-mal zitiert (Crossref) und nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Nand, R., Chaudhary, K., & Sharma, B. (2024). Single Depot Multiple Travelling Salesman Problem Solved With Preference-Based Stepping Ahead Firefly Algorithm. IEEE Access, 12, 26655-26666. https://doi.org/10.1109/access.2024.3366183

Vancouver

Nand R, Chaudhary K, Sharma B. Single Depot Multiple Travelling Salesman Problem Solved With Preference-Based Stepping Ahead Firefly Algorithm. IEEE Access. 2024;12:26655-26666. doi:10.1109/access.2024.3366183

BibTeX
@article{Nand2024,
  author = {Nand, Ravneil and Chaudhary, Kaylash and Sharma, Bibhya},
  title = {Single Depot Multiple Travelling Salesman Problem Solved With Preference-Based Stepping Ahead Firefly Algorithm},
  journal = {IEEE Access},
  year = {2024},
  volume = {12},
  pages = {26655--26666},
  doi = {10.1109/access.2024.3366183}
}
Kostenlos starten →