Abstract
Open Vehicle routing problems is a variant of Vehicle Routing Problem, in which vehicles don’t return the depot after serving the customers. In this study, we proposed a cluster first-routed second based algorithm. We combined Kmeans and Variable Neighborhood Search in this algorithm. Our proposed algorithm achieves the best know solutions within a reasonable time for all well-known small and medium scale benchmarks.
Author supplied keywords
Cite
CITATION STYLE
Güler, B., & Şevkli, A. Z. (2015). Oscillated variable neighborhood search for open vehicle routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9491, pp. 182–189). Springer Verlag. https://doi.org/10.1007/978-3-319-26555-1_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
