ScholarLens Back to search
2008•Journal of Northeastern UniversityRequires access

Variable Neighborhood Search for Solving Vehicle Routing Problems with Backhauls and Time Windows

Yulong Li

Open publisher page 4 citations

Abstract

Based on the background of goods distribution in e-business environment,a model for solving the problems VRPBTW,i.e.,the vehicle routing problems with backhauls and time windows,is developed,and it is analyzed to improve the VNS(variable neighborhood search) algorithm so as to solve the problems.Applying the modified sequential cheapest insertion heuristic proposed originally by Braysy to generating an initial solution for improvement,the algorithm introduces four different local search operators in accordance to VNS mechanism.The results of computational tests including 15 examples were compared with that by conventional VNS and showed that the modified VNS algorithm is effective for solving the problems and greatly outperforms the conventional one.

About this research paper

What this paper is about

Based on the background of goods distribution in e-business environment,a model for solving the problems VRPBTW,i.e.,the vehicle routing problems with backhauls and time windows,is developed,and it is analyzed to improve the VNS(variable neighborhood search) algorithm so as to solve the problems.Applying the modified sequential cheapest insertion heuristic proposed originally by Braysy to generating an initial solution for improvement,the algorithm introduces four different local search operators in accordance to VNS mechanism.The results of computational tests including 15 examples were compared with that by conventional VNS and showed that the modified VNS algorithm is effective for solving the problems and greatly outperforms the conventional one.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Based on the background of goods distribution in e-business environment,a model for solving the problems VRPBTW,i.e.,the vehicle routing problems with backhauls and time windows,is developed,and it is analyzed to improve the VNS(variable neighborhood search) algorithm so as to solve the problems.Applying the modified sequential cheapest insertion heuristic proposed originally by Braysy to generating an initial solution for improvement,the algorithm introduces four different local search operators in accordance to VNS mechanism.The results of computational tests including 15 examples were compared with that by conventional VNS and showed that the modified VNS algorithm is effective for solving the problems and greatly outperforms the conventional one.

Key concepts: Vehicle routing problem, Variable neighborhood search, Mathematical optimization, Heuristic, Variable (mathematics), Computer science, Local search (optimization), Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Variable Neighborhood Search for Solving Vehicle Routing Problems with Backhauls and Time Windows — Research Paper | ScholarLens