Uma abordagem heurística para o problema de roteamento DIAL-A-RIDE.

• Ano de defesa: 2013
• Autor(a) principal: Costa, Daniel Leite Viana
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal da Paraí­ba; BR; Informática; Programa de Pós Graduação em Informática; UFPB
• Palavras-chave em Português: Informática; Ciência da computação; Metaheurística; Iterated Local Search; Dial-a-Ride Problem; Metaheuristic; Variable Neighborhood Search; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
• Link de acesso: https://repositorio.ufpb.br/jspui/handle/tede/6083

Problems of traffic jam, lack of vacancies in garages and cars underutilized are part of the current scenario of big cities. In this work is created a module for creating efficient routes for a system using the approach Dial-a-Ride Problem. The DARP is a vehicle routing problem that belongs to NP-complete class. It aims is to minimize operating costs while maintaining quality of service to the client. It is presented an algorithm that uses the metaheuristics Iterated Local Search with the Variable Neighborhood Search to solve the DARP. Compared to related work in the area, the results were better regarding to distance traveled and average travel time of customers.