Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost
Dezhi Zhang and
Transportation Research Part E: Logistics and Transportation Review, 2016, vol. 85, issue C, 69-89
The vehicle routing problem (VRP) with stochastic demands and weight-related cost is an extension of the VRP. Although some researchers have studied the VRP with either stochastic demands or weight-related cost, the literature on this problem is quite limited. We adopt the a priori optimization to tackle this problem and propose a dynamic programming to compute the expected cost of each route. We develop the adaptive large neighborhood search heuristics equipped with several approximate methods for the problem. To evaluate our heuristics, we generate 84 test instances. Computational results demonstrate the performance of our heuristics and can serve as benchmarks for future researchers.
Keywords: Routing; Stochastic demands; Weight-related cost; A priori optimization; Adaptive large neighborhood search (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:85:y:2016:i:c:p:69-89
Ordering information: This journal article can be ordered from
http://www.elsevier. ... 600244/bibliographic
Access Statistics for this article
Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley
More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Dana Niculescu ().