BDBComp
Parceria:
SBC
Problema de roteirização de veículos com janelas de atendimento, frotas heterogêneas e entregas fracionadas

Marc Antonio Vieira de QueirozPedro Casagrande CamposRodolfo Miranda de BarrosJacques Duílio Brancher

This paper presents a solution to the vehicle routing problem based on the technique of building routes using sequential insertion. The construction of routes is based on savings heuristics which is inspired on classical algorithms, such as developed by Clarke and Wright in 1964. The heuristics employed makes use of four algorithms, Combined Savings (CS), Optimistic Opportunity Savings (OOS), Realistic Opportunity Savings (ROS) and Realistic Opportunity Savings with a route shape parameter (ROS?). The proposed algorithms are tested by a set of benchmarks and presents graphic and numeric solutions.

http://www.lbd.dcc.ufmg.br/colecoes/sbsi/2012/0057.pdf

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD