Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Hybrid algorithm for the solution of the periodic vehicle routing problem with variable service frequency

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • Additional Information
    • Publication Information:
      Growing Science, 2022.
    • Publication Date:
      2022
    • Collection:
      LCC:Industrial engineering. Management engineering
      LCC:Production management. Operations management
    • Abstract:
      This document addresses the problem of scheduling and routing a specific number of vehicles to visit a set of customers in specific time windows during a planning horizon. The vehicles have a homogeneous limited capacity and have their starting point and return in a warehouse or initial node, in addition, multiple variants of the classic VRP vehicle routing problem are considered, where computational complexity increases with the increase in the number of customers to visit, as a characteris-tic of an NP-hard problem. The solution method used consists of two connected phases, the first phase makes the allocation through a mixed-integer linear programming model, from which the visit program and its frequency in a determined plan-ning horizon are obtained. In the second phase, the customers are grouped through an unsupervised learning algorithm, the routing is carried out through an Ant Colony Optimization metaheuristic that includes local heu-ristics to make sure com-pliance with the restrictive factors. Finally, we test our algorithm by performance measures using instances of the literature and a comparative model, and we prove the effectiveness of the proposed algorithm.
    • File Description:
      electronic resource
    • ISSN:
      1923-2926
      1923-2934
    • Relation:
      http://www.growingscience.com/ijiec/Vol13/IJIEC_2021_26.pdf; https://doaj.org/toc/1923-2926; https://doaj.org/toc/1923-2934
    • Accession Number:
      10.5267/j.ijiec.2021.10.001
    • Accession Number:
      edsdoj.985aaf07e5f400a970ac37c83fbd62f