Original paper
A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows
Abstract
This paper considers the vehicle routing problem with soft time windows, a challenging routing problem where customers' time windows may be violated at a certain cost. The vehicle routing problem with soft time windows has a lexicographic objective function, aimed at minimizing first the number of routes, then the number of violated time windows, and finally the total routing distance. We present a multistage very large-scale neighborhood search...
Paper Details
Title
A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows
Published Date
May 1, 2015
Journal
Volume
49
Issue
2
Pages
223 - 238
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History