Selective vehicle routing problems under uncertainty without recourse

Mahdieh Allahviranloo, Joseph Ying Jun Chow, Will W. Recker

Research output: Contribution to journalArticle

Abstract

We argue that the selective vehicle routing problem is more appropriate than the conventional VRP in handling uncertainty with limited resources. However, previous formulations of selective VRPs have all been deterministic. Three new formulations are proposed to account for different optimization strategies under uncertain demand (or utility) level: reliable, robust, and fuzzy selective vehicle routing problems. Three parallel genetic algorithms (PGAs) and a classic genetic algorithm are developed and compared to the deterministic solution. PGAs differ based on their communication strategies and diversity in sub-populations. Results show that a PGA, wherein communication between demes, or subpopulations, occurs in every generation and does not eliminate repeated chromosomes, outperforms other algorithms at the cost of higher computation time. A faster variation of PGA is used to solve the non-convex reliable selective VRP, robust selective VRP and the large-scale fuzzy selective VRP, consisting of 200 nodes. Large scale application demonstrates the value of fuzzy selective vehicle routing problem FSVRP in humanitarian logistics.

Original languageEnglish (US)
Pages (from-to)68-88
Number of pages21
JournalTransportation Research Part E: Logistics and Transportation Review
Volume62
DOIs
StatePublished - Feb 2014

Fingerprint

Vehicle routing
recourse
Parallel algorithms
Genetic algorithms
uncertainty
Communication
Chromosomes
communication
Logistics
Uncertainty
Genetic algorithm
Vehicle routing problem
logistics
demand
resources
Values

Keywords

  • Fuzzy optimization
  • Humanitarian logistics
  • Parallel genetic algorithm
  • Reliability
  • Robust optimization
  • Selective vehicle routing problem
  • Stochastic optimization

ASJC Scopus subject areas

  • Business and International Management
  • Management Science and Operations Research
  • Transportation

Cite this

Selective vehicle routing problems under uncertainty without recourse. / Allahviranloo, Mahdieh; Chow, Joseph Ying Jun; Recker, Will W.

In: Transportation Research Part E: Logistics and Transportation Review, Vol. 62, 02.2014, p. 68-88.

Research output: Contribution to journalArticle

@article{0170103e39f34f58908843cf4025f8dd,
title = "Selective vehicle routing problems under uncertainty without recourse",
abstract = "We argue that the selective vehicle routing problem is more appropriate than the conventional VRP in handling uncertainty with limited resources. However, previous formulations of selective VRPs have all been deterministic. Three new formulations are proposed to account for different optimization strategies under uncertain demand (or utility) level: reliable, robust, and fuzzy selective vehicle routing problems. Three parallel genetic algorithms (PGAs) and a classic genetic algorithm are developed and compared to the deterministic solution. PGAs differ based on their communication strategies and diversity in sub-populations. Results show that a PGA, wherein communication between demes, or subpopulations, occurs in every generation and does not eliminate repeated chromosomes, outperforms other algorithms at the cost of higher computation time. A faster variation of PGA is used to solve the non-convex reliable selective VRP, robust selective VRP and the large-scale fuzzy selective VRP, consisting of 200 nodes. Large scale application demonstrates the value of fuzzy selective vehicle routing problem FSVRP in humanitarian logistics.",
keywords = "Fuzzy optimization, Humanitarian logistics, Parallel genetic algorithm, Reliability, Robust optimization, Selective vehicle routing problem, Stochastic optimization",
author = "Mahdieh Allahviranloo and Chow, {Joseph Ying Jun} and Recker, {Will W.}",
year = "2014",
month = "2",
doi = "10.1016/j.tre.2013.12.004",
language = "English (US)",
volume = "62",
pages = "68--88",
journal = "Transportation Research, Part E: Logistics and Transportation Review",
issn = "1366-5545",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Selective vehicle routing problems under uncertainty without recourse

AU - Allahviranloo, Mahdieh

AU - Chow, Joseph Ying Jun

AU - Recker, Will W.

PY - 2014/2

Y1 - 2014/2

N2 - We argue that the selective vehicle routing problem is more appropriate than the conventional VRP in handling uncertainty with limited resources. However, previous formulations of selective VRPs have all been deterministic. Three new formulations are proposed to account for different optimization strategies under uncertain demand (or utility) level: reliable, robust, and fuzzy selective vehicle routing problems. Three parallel genetic algorithms (PGAs) and a classic genetic algorithm are developed and compared to the deterministic solution. PGAs differ based on their communication strategies and diversity in sub-populations. Results show that a PGA, wherein communication between demes, or subpopulations, occurs in every generation and does not eliminate repeated chromosomes, outperforms other algorithms at the cost of higher computation time. A faster variation of PGA is used to solve the non-convex reliable selective VRP, robust selective VRP and the large-scale fuzzy selective VRP, consisting of 200 nodes. Large scale application demonstrates the value of fuzzy selective vehicle routing problem FSVRP in humanitarian logistics.

AB - We argue that the selective vehicle routing problem is more appropriate than the conventional VRP in handling uncertainty with limited resources. However, previous formulations of selective VRPs have all been deterministic. Three new formulations are proposed to account for different optimization strategies under uncertain demand (or utility) level: reliable, robust, and fuzzy selective vehicle routing problems. Three parallel genetic algorithms (PGAs) and a classic genetic algorithm are developed and compared to the deterministic solution. PGAs differ based on their communication strategies and diversity in sub-populations. Results show that a PGA, wherein communication between demes, or subpopulations, occurs in every generation and does not eliminate repeated chromosomes, outperforms other algorithms at the cost of higher computation time. A faster variation of PGA is used to solve the non-convex reliable selective VRP, robust selective VRP and the large-scale fuzzy selective VRP, consisting of 200 nodes. Large scale application demonstrates the value of fuzzy selective vehicle routing problem FSVRP in humanitarian logistics.

KW - Fuzzy optimization

KW - Humanitarian logistics

KW - Parallel genetic algorithm

KW - Reliability

KW - Robust optimization

KW - Selective vehicle routing problem

KW - Stochastic optimization

UR - http://www.scopus.com/inward/record.url?scp=84891422367&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84891422367&partnerID=8YFLogxK

U2 - 10.1016/j.tre.2013.12.004

DO - 10.1016/j.tre.2013.12.004

M3 - Article

AN - SCOPUS:84891422367

VL - 62

SP - 68

EP - 88

JO - Transportation Research, Part E: Logistics and Transportation Review

JF - Transportation Research, Part E: Logistics and Transportation Review

SN - 1366-5545

ER -