Resumo

MONTES-OROZCO, Edwin et al. Matheuristics for solving the vehicle routing problem with time windows. Rev. Mat [online]. 2020, vol.27, n.2, pp.305-332. ISSN 1409-2433.  http://dx.doi.org/10.15517/rmta.v27i2.37889artículo.

In this work, we present two matheuristic techniques based on two heuristic techniques: Ant system (AS), method of musical composition (MMC) and two exact methods: Primal-dual algorithm (PDA) and dual simplex algorithm (DSA). These techniques are denoted as DS-AS-PDA and DS-MMC-AS and are characterized by taking advantage of the information of the structure and characteristics of the mathematical model for the vehicle routing problem with time windows (VRP-TW). In order to characterize the behavior of the techniques proposed in this work, we use 29 test instances for the VRP-TW. The numerical results show that DS-AS-PDA and DS-MMC-AS exhibit robust behavior and are capable of generating the best solutions reported in the literature with a smaller number of calls to the objective function.

Palavras-chave : heuristics; optimization; hybrid algorithms; logistic..

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )