The period vehicle routing problem. / O problema de roteirização periódica de veículos.

AUTOR(ES)

Luciele Wu

DATA DE PUBLICAÇÃO

2007

RESUMO

The period vehicle routing problem can be viewed as a generalization of the classic vehicle routing problem due to two singular features: a planning period longer than one day in which vehicles make several trips and frequencies of visit associated to points to be serviced. This type of problem may arise in different practical applications. Nowadays, some Brazilian automaker industries are already utilizing a collect system based on the idea of the period routing in order to reduce parts inventory. Similarly to the original vehicle routing problem, the period vehicle routing problem is also hard to solve, making it impossible to use exact in order to obtain an optimal solution for problem sizes found in practice. This motivated this research study, which directed its efforts to the exploration of new strategies of solution through new reasoning, leading to an increase in the quality of the solution and a decrease in the computational processing time. The proposed heuristics are composed of three consecutive stages: (i) assigning customers to days of visit while respecting their given frequencies, (ii) building routes that serve all customers assigned to each day of the planning horizon, and (iii) improving the obtained solution. Despite the distinction between the stages, we managed to take into consideration the integration among the three decisions. Two different procedures were proposed to the assignment of customers to days of visit: a sequential insertion heuristic that aims to balance the workload among different days in the time horizon, and a heuristic based on genetic algorithms. The daily routes are then constructed by using the Clarke and Wrights savings algorithm, which allows good solutions to be obtained in short processing times. Computational experiments are made in order to evaluate the efficiency of each proposed heuristic using both benchmark problem sets from the literature and randomly generated problems as well, and the results are compared to the previously reported in the literature.

ASSUNTO(S)

logistics (supply chain) roteirização periódica transportation period routing heuristic heurística logística (administração de materiais) transportes

Documentos Relacionados

• Algoritmos genéticos híbridos sem delimitadores de rotas para problemas de roteirização de veículos.
• Uma abordagem híbrida ao problema de roteirização dinâmica de veículos com janela de tempo
• APPRAISAL OF VEHICLE ROUTING SYSTEM IMPLEMENTATION
• Busca tabu aplicada ao problema de roteamento periodico de veiculos
• AN ALGORITHM WITH COLUMN AND CUT GENERATION FOR THE CAPACITATED VEHICLE ROUTING PROBLEM