4.3 Article

A biased-randomized variable neighborhood search for sustainable multi-depot vehicle routing problems

Journal

JOURNAL OF HEURISTICS
Volume 26, Issue 3, Pages 401-422

Publisher

SPRINGER
DOI: 10.1007/s10732-018-9366-0

Keywords

Sustainability; City logistics; Multi-depot vehicle routing problem; Variable neighborhood search; Biased randomization

Funding

  1. Spanish Ministry of Economy and Competitiveness, FEDER [TRA2013-48180-C3-P, TRA2015-71883-REDT]
  2. Ibero-American Program for Science and Technology for Development [CYTED2014-515RT0489]
  3. Erasmus+ programme [2016-1-ES01-KA108-023465]
  4. UPNA doctoral grants programme

Ask authors/readers for more resources

Urban freight transport is becoming increasingly complex due to a boost in the volume of products distributed and the associated number of delivery services. In addition, stakeholders' preferences and city logistics dynamics affect the freight flow and the efficiency of the delivery process in downtown areas. In general, transport activities have a significant and negative impact on the environment and citizens' welfare, which motivates the need for sustainable transport planning. This work proposes a metaheuristic-based approach for tackling an enriched multi-depot vehicle routing problem in which economic, environmental, and social dimensions are considered. Our approach integrates biased-randomization strategies within a variable neighborhood search framework in order to better guide the searching process. A series of computational experiments illustrates how the aforementioned dimensions can be integrated in realistic transport operations. Also, the paper discusses how the cost values change as different dimensions are prioritized.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.3
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available