Um GRASP eficiente para Problemas de Roteamento de uma Frota de Veículos
DOI:
https://doi.org/10.5540/tema.2006.07.01.0149Abstract
Apresentamos neste artigo, uma nova metaheurística híbrida baseada em conceitos de Greedy Randomized Adaptive Search Procedure (GRASP) e Busca Tabu (BT) para a solução do Problema de Roteamento Periódico de Veículos (PRPV). A busca local do algoritmo GRASP é efetuada através de um procedimento BT incorporando estratégias de intensificação e diversificação. Resultados computacionais obtidos de conjuntos de instâncias da literatura mostram que o algoritmo proposto é altamente competitivo quando comparado com as heurísticas e metaheuristicas existentes para o PRPV.References
[1] E. Beltrami, e L. Bodin,, Networks and vehicle routing for Municipal Waste Collection, Networks, 4 (1974), 65-94.
N. Christofides e J. Beasley, The PRP, Networks, 14 (1984), 237-256.
F. Cordeau, M. Gendreau e G. Laporte, A Tabu search heuristic for period reuting problems, Networks, 30 (1997), 105-119.
F. Glover e M. Laguna, “Busca Tabu”. Kluwer Academic Pub. 1998.
B.L. Golden, I.M. Chao e E.Wasil, An improved heuristic for the period vehicle routing problem. Networks, 25-44, (1995).
L.S. Ochi, L.M.A. Drummond, D.S. Vianna e A.O. Victor, A parallel evolutionary algorithm for the VRP, Future Generation Computer Systems Journal, Elsevier Science, 14, (1988), 285-292.
M. Resende, L.S. Pitsoulis, GRASP, in “Handobook of Applied Optimization”, Oxford Univ. Press, pp. 168-182, 2002.
R.A. Russell e D. Gribbin, A multi-phase approach to the period routing problem. Networks, 21 (1991), 747-765.
M. Silva, L. Drummond e L.S. Ochi, Metaheuristics based on GRASP and VNS for solving the Traveling Purchaser Problem, Proc. of the IV Metaheuristic International Conference, 12-17, Porto, Portugal, 2001.
C.C.R. Tan e J.E. Beasley, A heuristic algorithm for the period vehicle routing problem. Omega, 12, No. 5 (1984), 497-504.
Instâncias do PRPV: Disponível em http://mscmga.ms.ic.ac.uk/jeb/orlib/ .
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish in this journal agree to the following terms:
Authors retain copyright and grant the journal the right of first publication, with the work simultaneously licensed under the Creative Commons Attribution License that allows the sharing of the work with acknowledgment of authorship and initial publication in this journal.
Authors are authorized to assume additional contracts separately, for non-exclusive distribution of the version of the work published in this journal (eg, publish in an institutional repository or as a book chapter), with acknowledgment of authorship and initial publication in this journal.
Authors are allowed and encouraged to publish and distribute their work online (eg, in institutional repositories or on their personal page) at any point before or during the editorial process, as this can generate productive changes as well as increase impact and the citation of the published work (See The effect of open access).
This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles, or use them for any other lawful purpose, without asking prior permission from the publisher or the
author. This is in accordance with the BOAI definition of open access
Intellectual Property
All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License under attribution BY.