Adaptive search techniques for problems in vehicle routing, Part II: A numerical comparison

3Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

Research in the field of vehicle routing is often focused on finding new ideas and concepts in the development of fast and efficient algorithms for an improved solution process. Early studies introduce static tailor-made strategies, but trends show that algorithms with generic adaptive policies - which emerged in the past years - are more efficient to solve complex vehicle routing problems. In the first part of the survey, we presented an overview of recent literature dealing with adaptive or guided search techniques for problems in vehicle routing.

Cite

CITATION STYLE

APA

Kritzinger, S., Doerner, K. F., Tricoire, F., & Hartl, R. F. (2015). Adaptive search techniques for problems in vehicle routing, Part II: A numerical comparison. Yugoslav Journal of Operations Research, 25(2), 169–184. https://doi.org/10.2298/YJOR140217011K

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free