A model for solving the dynamic vehicle dispatching problem with customer uncertainty and time dependent link travel time

Shan Huen Huang, Carola Alejandro Blazquez

Resultado de la investigación: Article

3 Citas (Scopus)

Resumen

In a real world case scenario, customer demands are requested at any time of the day requiring services that are not known in advance such as delivery or repairing equipment. This is called Dynamic Vehicle Routing (DVR) with customer uncertainty environment. The link travel time for the roadway network varies with time as traffic fluctuates adding an additional component to the dynamic environment. This paper presents a model for solving the DVR problem while combining these two dynamic aspects (customer uncertainty and link travel time). The proposed model employs Greedy, Insertion, and Ant Colony Optimization algorithms. The Greedy algorithm is utilized for constructing new routes with existing customers, and the remaining two, algorithms are employed for rerouting as new customer demands appear. A real world application is presented to simulate vehicle routing in a dynamic environment for the city of Taipei, Taiwan. The simulation shows that the model can successfully plan vehicle routes to satisfy all customer demands and help managers in the decision making process.

Idioma originalEnglish
Páginas (desde-hasta)163-174
Número de páginas12
PublicaciónRevista Facultad de Ingenieria
N.º64
EstadoPublished - sep 2012

Huella dactilar

Travel time
Vehicle routing
Ant colony optimization
Managers
Decision making
Uncertainty

ASJC Scopus subject areas

  • Engineering(all)

Citar esto

@article{d59571ab70d24ba3ae61b496727455b5,
title = "A model for solving the dynamic vehicle dispatching problem with customer uncertainty and time dependent link travel time",
abstract = "In a real world case scenario, customer demands are requested at any time of the day requiring services that are not known in advance such as delivery or repairing equipment. This is called Dynamic Vehicle Routing (DVR) with customer uncertainty environment. The link travel time for the roadway network varies with time as traffic fluctuates adding an additional component to the dynamic environment. This paper presents a model for solving the DVR problem while combining these two dynamic aspects (customer uncertainty and link travel time). The proposed model employs Greedy, Insertion, and Ant Colony Optimization algorithms. The Greedy algorithm is utilized for constructing new routes with existing customers, and the remaining two, algorithms are employed for rerouting as new customer demands appear. A real world application is presented to simulate vehicle routing in a dynamic environment for the city of Taipei, Taiwan. The simulation shows that the model can successfully plan vehicle routes to satisfy all customer demands and help managers in the decision making process.",
keywords = "Customer uncertainty, Dynamic vehicle routing, Heuristics, Vehicle routing problem",
author = "Huang, {Shan Huen} and Blazquez, {Carola Alejandro}",
year = "2012",
month = "9",
language = "English",
pages = "163--174",
journal = "Revista Facultad de Ingenieria",
issn = "0120-6230",
publisher = "Universidad de Antioquia",
number = "64",

}

TY - JOUR

T1 - A model for solving the dynamic vehicle dispatching problem with customer uncertainty and time dependent link travel time

AU - Huang, Shan Huen

AU - Blazquez, Carola Alejandro

PY - 2012/9

Y1 - 2012/9

N2 - In a real world case scenario, customer demands are requested at any time of the day requiring services that are not known in advance such as delivery or repairing equipment. This is called Dynamic Vehicle Routing (DVR) with customer uncertainty environment. The link travel time for the roadway network varies with time as traffic fluctuates adding an additional component to the dynamic environment. This paper presents a model for solving the DVR problem while combining these two dynamic aspects (customer uncertainty and link travel time). The proposed model employs Greedy, Insertion, and Ant Colony Optimization algorithms. The Greedy algorithm is utilized for constructing new routes with existing customers, and the remaining two, algorithms are employed for rerouting as new customer demands appear. A real world application is presented to simulate vehicle routing in a dynamic environment for the city of Taipei, Taiwan. The simulation shows that the model can successfully plan vehicle routes to satisfy all customer demands and help managers in the decision making process.

AB - In a real world case scenario, customer demands are requested at any time of the day requiring services that are not known in advance such as delivery or repairing equipment. This is called Dynamic Vehicle Routing (DVR) with customer uncertainty environment. The link travel time for the roadway network varies with time as traffic fluctuates adding an additional component to the dynamic environment. This paper presents a model for solving the DVR problem while combining these two dynamic aspects (customer uncertainty and link travel time). The proposed model employs Greedy, Insertion, and Ant Colony Optimization algorithms. The Greedy algorithm is utilized for constructing new routes with existing customers, and the remaining two, algorithms are employed for rerouting as new customer demands appear. A real world application is presented to simulate vehicle routing in a dynamic environment for the city of Taipei, Taiwan. The simulation shows that the model can successfully plan vehicle routes to satisfy all customer demands and help managers in the decision making process.

KW - Customer uncertainty

KW - Dynamic vehicle routing

KW - Heuristics

KW - Vehicle routing problem

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

M3 - Article

AN - SCOPUS:84870358053

SP - 163

EP - 174

JO - Revista Facultad de Ingenieria

JF - Revista Facultad de Ingenieria

SN - 0120-6230

IS - 64

ER -