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

Clustering and heuristics algorithm for the vehicle routing problem with time windows

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 article presents a novel algorithm based on the cluster first-route second method, which executes a solution through K-means and Optics clustering techniques and Nearest Neighbor and Local Search 2-opt heuristics, for the solution of a vehicle routing problem with time windows (VRPTW). The objective of the problem focuses on reducing distances, supported by the variables of demand, delivery points, capacities, time windows and type of fleet in synergy with the model's taxonomy, based on data referring to deliveries made by a logistics operator in Colombia. As a result, good solutions are generated in minimum time periods after fulfilling the agreed constraints, providing high performance in route generation and solutions for large customer instances. Similarly, the algorithm demonstrates efficiency and competitiveness compared to other methods detailed in the literature, after being benchmarked with the Solomon instance data set, exporting even better results.
    • File Description:
      electronic resource
    • ISSN:
      1923-2926
      1923-2934
    • Relation:
      http://www.growingscience.com/ijiec/Vol13/IJIEC_2021_32.pdf; https://doaj.org/toc/1923-2926; https://doaj.org/toc/1923-2934
    • Accession Number:
      10.5267/j.ijiec.2021.12.002
    • Accession Number:
      edsdoj.1eff0a1390034e87a85060e9be62fae6