Proposição de uma heurística utilizando busca-tabu para resolução do problema de escalonamento de veículos com múltiplas garagens

Revista Produção Online

Denis Borenstein²  Gabriel Machado Braido¹  Gilmar D'Agostini Oliveira Casalinho² 

[1] UNIVATES;Universidade Federal do Rio Grande do Sul

关键词: Avaliação de desempenho;    Portfólio de Produtos;    Bibliometria;    Seleção de referencial teórico;    Decisão;   

DOI  :  

学科分类：社会科学、人文和艺术（综合）

来源: Associacao Brasileira de Engenharia de Producao (A B E P R O)

【 摘 要 】

Currently the logistical problems are relying quite significantly on Operational Research in order to achieve greater efficiency in their operations. Among the problems related to the vehicles scheduling in a logistics system, the Multiple Depot Vehicle Scheduling Problem (MDVSP) has been addressed in several studies. The MDVSP presupposes the existence of depots that affect the planning of sequences to which travel must be performed. Often, exact methods cannot solve large instances encountered in practice and in order to take them into account, several heuristic approaches are being developed. The aim of this study was thus to solve the MDVSP using a meta-heuristic based on tabu-search method. The main motivation for this work came from the indication that only recently the use of meta-heuristics is being applied to MDVSP context (Pepinet al.2008) and, also, the limitations listed by Rohde (2008) in his study, which used the branch-and-bound in one of the steps of the heuristic presented to solve the problem, which has increased the time resolution. The research method for solving this problem was based on adaptations of traditional techniques of Operational Research, and provided resolutions presenting very competitive results for the MDVSP such as the cost of the objective function, number of vehicles used and computational time.

【 授权许可】

Unknown