Roteamento de veículos com base em sistemas de informação geográfica
Authors:
Open Access
- 1 August 1997
- journal article
- Published by FapUNIFESP (SciELO) in Gestão & Produção
- Vol. 4 (2) , 159-174
Abstract
Um algoritmo para roteamento de veículos é integrado a um Sistema de Informação Geográfica, de cuja base de dados obtém as informações necessárias para o roteamento e no qual mostra as rotas resultantes. O algoritmo de roteamento utilizado tem como base a metaheurística de simulated annealing, que apresenta neste caso resultados computacionais de boa qualidade. Descrevemos a interface do algoritmo com um SIG específico e a aplicação do sistema resultante a um programa de entregas simulado, no bairro de Copacabana, no Rio de Janeiro.Keywords
This publication has 21 references indexed in Scilit:
- A Tabu Search Heuristic for the Vehicle Routing ProblemManagement Science, 1994
- The control of helicopter operations in the Brazilian oil industry: Issues in the design and implementation of a computerized systemEuropean Journal of Operational Research, 1990
- Simulated annealing: A tool for operational researchEuropean Journal of Operational Research, 1990
- Route first—Cluster second methods for vehicle routingOmega, 1983
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- Implementing vehicle routing algorithmsNetworks, 1977
- A Heuristic Algorithm for the Vehicle-Dispatch ProblemOperations Research, 1974
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969
- Bases for Vehicle Fleet SchedulingJournal of the Operational Research Society, 1967
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964