Oscillated Variable Neighborhood Search for Open Vehicle Routing Problem

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 a...

Full description

Saved in:
Bibliographic Details
Published inNeural Information Processing Vol. 9491; pp. 182 - 189
Main Authors Güler, Bekir, Şevkli, Aişe Zülal
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2015
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Deterministic Oscillated Perturbation
Metaheuristic
Open Vehicle Routing Problem
Pattern recognition
Variable Neighborhood Search
Online AccessGet full text
ISBN9783319265544
3319265547
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-26555-1_21

Cover

More Information
Summary: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.
ISBN:9783319265544
3319265547
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-26555-1_21