Journal article · 2025 · Open access

Large neighborhood and hybrid genetic search for inventory routing problems

Jingyi Zhao, Claudia Archetti, Tuấn Anh Phạm, Thibaut Vidal

European Journal of Operational Research, 332(3), 808–821 · Published 26 November 2025 · DOI 10.1016/j.ejor.2025.11.021

Open PDFView at the publisherCite this paper

In brief

“Large neighborhood and hybrid genetic search for inventory routing problems” is a 2025 journal article by Jingyi Zhao and 3 co-authors, published in European Journal of Operational Research. OpenAlex counts 7 citations as of 18 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
7
Most cited in
2026 (4)
Field-weighted impact
1.55
References
61
Authors
4

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Zhao, J., Archetti, C., Phạm, T. A., & Vidal, T. (2025). Large neighborhood and hybrid genetic search for inventory routing problems. European Journal of Operational Research, 332(3), 808–821. https://doi.org/10.1016/j.ejor.2025.11.021

MLA 9

Zhao, Jingyi, et al. “Large neighborhood and hybrid genetic search for inventory routing problems.” European Journal of Operational Research, vol. 332, no. 3, 2025, pp. 808–821. https://doi.org/10.1016/j.ejor.2025.11.021.

Chicago

Zhao, Jingyi, Claudia Archetti, Tuấn Anh Phạm, and Thibaut Vidal. 2025. “Large neighborhood and hybrid genetic search for inventory routing problems.” European Journal of Operational Research 332 (3): 808–821. https://doi.org/10.1016/j.ejor.2025.11.021.

Harvard

Zhao, J. et al. (2025) ‘Large neighborhood and hybrid genetic search for inventory routing problems’, European Journal of Operational Research, 332(3), pp. 808–821. doi:10.1016/j.ejor.2025.11.021.

IEEE

J. Zhao, C. Archetti, T. A. Phạm, and T. Vidal, “Large neighborhood and hybrid genetic search for inventory routing problems,” European Journal of Operational Research, vol. 332, no. 3, pp. 808–821, 2025, doi: 10.1016/j.ejor.2025.11.021.

BibTeX

@article{zhao2025large,
  title     = {{Large neighborhood and hybrid genetic search for inventory routing problems}},
  author    = {Zhao, Jingyi and Archetti, Claudia and Phạm, Tuấn Anh and Vidal, Thibaut},
  journal   = {European Journal of Operational Research},
  year      = {2025},
  volume    = {332},
  number    = {3},
  pages     = {808--821},
  doi       = {10.1016/j.ejor.2025.11.021},
  url       = {https://doi.org/10.1016/j.ejor.2025.11.021}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods

  • inventory routing problem
  • large neighborhood search
  • local search
  • dynamic programming
  • heuristic optimization

Work with this paper

Most-cited papers in Engineering

All highly cited Engineering papers

Questions about this paper

How do I cite this paper in APA style?

Zhao, J., Archetti, C., Phạm, T. A., & Vidal, T. (2025). Large neighborhood and hybrid genetic search for inventory routing problems. European Journal of Operational Research, 332(3), 808–821. https://doi.org/10.1016/j.ejor.2025.11.021

How many times has this paper been cited?

7 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Jingyi Zhao, Claudia Archetti, Tuấn Anh Phạm, Thibaut Vidal.

What is the DOI of this paper?

10.1016/j.ejor.2025.11.021, permanently at https://doi.org/10.1016/j.ejor.2025.11.021. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.