skip to main content
10.1145/1363686.1363691acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

A vehicular waiting time heuristic for dynamic vehicle routing problem

Published: 16 March 2008 Publication History

Abstract

In the last years, the Vehicle Routing Problem (VRP) has been receiving increasing a special attention due its importance in the distribution of products. Considering demands that can appear during the service day, this work solves the Dynamic VRP (DVRP) with support of the environment simulator, capable to emulate the behavior of the vehicular fleet in a geographic 2D space. This work presents two main contributions: (i) the environment simulator that can be used to standardize DVRP test cases; and (ii) a Vehicular Waiting Time Heuristic (VWTH), that delays the attendance of demand with the meaning of reducing the total distance traveled by vehicular fleet. The proposed heuristic is tested by four optimization algorithms (Simulated Annealing, GRASP, Memetic Algorithm and Hill Climbing), and submitted to statistical tests for better conclusions. The tests showed, with 95% of confidence, that the VWTH is able to improve significantly the metaheuristics results.

References

[1]
ALVARENGA, G. B.; Um algoritmo híbrido para os problemas de Roteamento de Veículos Estático e Dinamico com Janela de Tempo. PhD Thesis. Department of Computer Science. Federal University of Minas Gerais. Brazil. 2005.
[2]
DANTZIG, G. B.; RAMSER, R. H.;. The Truck Dispatching Problem. Management Science. 6. 80. 1959.
[3]
HOOVER, S. V.; PERRY, R. F. Simulation: a problem-solving approach. Reading, Massachusetts: Addison-Wesley Longman Publishing Co., Inc. Boston, EUA, 1989.
[4]
KIRKPATRICK, S.; GELLAT, D; VECCHI, M. P.;. Optimizations by Simulated Annealing. Science v. 220, pp. 671--680. 1983.
[5]
MONTEMANNI, R.; GAMBARDELLA, L. M.; RIZZOLI, A. E.; DONAT, A. V. Ant Colony System for a Dynamic Vehicle Routing Problem. Journal of Combinatorial Optimization, 10, 327--343. 2005.
[6]
MOSCATO, P.; "On evolution, search, optimization, GAs and martial arts: toward memetic algorithms," California Inst. Technol., Pasadena, CA, Tech. Rep. Caltech Concurrent Comput. Prog. Rep. 826, 1989.
[7]
POTVIN, J.; XU, Y.; BENYAHIA, I; Vehicle routing and scheduling with dynamic travel times. Computers and Operations Research. no. 33, pp 1129--1137. 2006.
[8]
RESENDE, M. G. C.; Greedy Randomized Adaptive Search Procedures (GRASP). AT&T Labs Research. Technical Report, December, 1998.
[9]
RUSSELL, S. J.; NORVIG, P.; Artificial Intelligence: A Modern Approach. Prentice Hall. 2003.
[10]
SOLOMON, M. M.; Algorithm for the Vehicle Routing Problem and Scheduling Problem with Time Window Constraints. Operational Research, 35, pp. 254--265. 1987.

Cited By

View all
  • (2024)Proactive real-time scheduling method for apron service vehicles based on mixed strategiesComputers & Industrial Engineering10.1016/j.cie.2024.110182192(110182)Online publication date: Jun-2024
  • (2013)Review of the Literature Related to the Considered RDOPG ApplicationsPro-active Dynamic Vehicle Routing10.1007/978-3-642-33472-6_4(93-147)Online publication date: 2013

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '08: Proceedings of the 2008 ACM symposium on Applied computing
March 2008
2586 pages
ISBN:9781595937537
DOI:10.1145/1363686
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 March 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. dynamic vehicle routing problem
  2. heuristic
  3. simulation

Qualifiers

  • Research-article

Conference

SAC '08
Sponsor:
SAC '08: The 2008 ACM Symposium on Applied Computing
March 16 - 20, 2008
Fortaleza, Ceara, Brazil

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25
The 40th ACM/SIGAPP Symposium on Applied Computing
March 31 - April 4, 2025
Catania , Italy

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Proactive real-time scheduling method for apron service vehicles based on mixed strategiesComputers & Industrial Engineering10.1016/j.cie.2024.110182192(110182)Online publication date: Jun-2024
  • (2013)Review of the Literature Related to the Considered RDOPG ApplicationsPro-active Dynamic Vehicle Routing10.1007/978-3-642-33472-6_4(93-147)Online publication date: 2013

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media