EUVIMEDEUVIMED entdecken
Crossref

A clustering-scheduling-based hyper-heuristic for the multiple traveling salesman problems with multiple depots in multiple environments

Prasanta Dutta, Sudip Kumar Mandal, Indadul Khan, Krishnendu Basuli, Manas Kumar Maiti

Soft Computing · 10.11.2026

DOI: 10.1007/s00500-026-11504-7 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Soft Computing, online erschienen am 10.11.2026. Verfasst von Prasanta Dutta und 4 weiteren Autor:innen. Die Arbeit nennt 47 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Dutta, P., Mandal, S. K., Khan, I., Basuli, K., & Maiti, M. K. (2026). A clustering-scheduling-based hyper-heuristic for the multiple traveling salesman problems with multiple depots in multiple environments. Soft Computing. https://doi.org/10.1007/s00500-026-11504-7

Vancouver

Dutta P, Mandal SK, Khan I, Basuli K, Maiti MK. A clustering-scheduling-based hyper-heuristic for the multiple traveling salesman problems with multiple depots in multiple environments. Soft Computing. 2026. doi:10.1007/s00500-026-11504-7

BibTeX
@article{Dutta2026,
  author = {Dutta, Prasanta and Mandal, Sudip Kumar and Khan, Indadul and Basuli, Krishnendu and Maiti, Manas Kumar},
  title = {A clustering-scheduling-based hyper-heuristic for the multiple traveling salesman problems with multiple depots in multiple environments},
  journal = {Soft Computing},
  year = {2026},
  doi = {10.1007/s00500-026-11504-7}
}
Kostenlos starten →