EUVIMEDEUVIMED entdecken
Crossref

Genetic Programming Hyper Heuristic With Elitist Mutation for Integrated Order Batching and Picker Routing Problem

Yuquan Wang, Naiming Xie, Nanlei Chen, Hui Ma, Gang Chen

IEEE Transactions on Evolutionary Computation · 2025-04 · 29 (2) · 346-359

DOI: 10.1109/tevc.2025.3532022 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Evolutionary Computation, 2025-04. Verfasst von Yuquan Wang und 4 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 55 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities, 333 Talent Project in Jiangsu Province, China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China
  • Fundamental Research Funds for the Central Universities
  • 333 Talent Project in Jiangsu Province, China
  • Jiangsu Province Basic Research Special Funds
  • Hohai University Humanities and Social Sciences Special-Young Teachers Project

Zitieren

APA

Wang, Y., Xie, N., Chen, N., Ma, H., & Chen, G. (2025). Genetic Programming Hyper Heuristic With Elitist Mutation for Integrated Order Batching and Picker Routing Problem. IEEE Transactions on Evolutionary Computation, 29(2), 346-359. https://doi.org/10.1109/tevc.2025.3532022

Vancouver

Wang Y, Xie N, Chen N, Ma H, Chen G. Genetic Programming Hyper Heuristic With Elitist Mutation for Integrated Order Batching and Picker Routing Problem. IEEE Transactions on Evolutionary Computation. 2025;29(2):346-359. doi:10.1109/tevc.2025.3532022

BibTeX
@article{Wang2025,
  author = {Wang, Yuquan and Xie, Naiming and Chen, Nanlei and Ma, Hui and Chen, Gang},
  title = {Genetic Programming Hyper Heuristic With Elitist Mutation for Integrated Order Batching and Picker Routing Problem},
  journal = {IEEE Transactions on Evolutionary Computation},
  year = {2025},
  volume = {29},
  number = {2},
  pages = {346--359},
  doi = {10.1109/tevc.2025.3532022}
}
Kostenlos starten →