Informática

URI Permanente desta comunidade

http://repositorio.ufes.br/handle/10/17625
Programa de Pós-Graduação em Informática

Centro: CT
Telefone: (27) 4009 2324 R*5126
URL do programa: http://www.informatica.ufes.br/pt-br/pos-graduacao/PPGI

Navegar

Navegando Informática por Assunto "3L VRPTWH"

Agora exibindo 1 - 1 de 1
  • Imagem de Miniatura
    Item
    Heurística híbrida para o problema de roteamento de veículos com carregamento tridimensional, janelas de tempo e objetivos hierárquicos
    (Universidade Federal do Espírito Santo, 2025-11-10) Pimentel, Wesley Pereira; Amaral, André Renato Sales; https://orcid.org/0000-0001-7344-3994; http://lattes.cnpq.br/4695002674556067; https://orcid.org/0000-0002-2847-4078; http://lattes.cnpq.br/9868402229168513; Boeres, Maria Claudia Silva ; https://orcid.org/0000-0001-9801-2410; http://lattes.cnpq.br/0528154281423964; Lorenzoni, Luciano Lessa; https://orcid.org/0000-0003-4859-7750; http://lattes.cnpq.br/7959495705859101
    This work introduces and formalizes the Three-Dimensional Loading Vehicle Routing Problem with Time Windows and Hierarchical Objectives (3L-VRPTWH). The singularity of the problem lies in its lexicographical objective function, which successively prioritizes the minimization of the number of vehicles, total distance, and waiting time, and in the integration of a robust set of operational constraints. Such constraints include meeting pre-defined time windows, vehicle weight capacity, LIFO (Last In, First Out) unloading policy, and load stability requirements, such as minimum support area and maximum stackable weight. The proposed method consists of a two-stage hybrid heuristic: a pre packing phase with Simulated Annealing to estimate the length space occupied by each customer, followed by an Adaptive Large Neighborhood Search for route optimization. The approach is enhanced by mechanisms such as Adaptive Container Length and the Total Compaction Algorithm, which intensify the search for solutions with more customers per route. Computational experiments, carried out on a set of instances adapted from the literature, confirmed the relevance of the hierarchical formulation, evidencing consistent trade-offs between objectives. The results demonstrate that the method is capable of generating robust and adaptable solutions, reconciling operational efficiency and practical feasibility in complex logistical scenarios. The main contribution of this work is, therefore, the formalization as an optimization problem and the proposal of a solution method, offering a robust tool for logistical scenarios that demand the optimization of multiple criteria with well-defined strategic priorities.