Clustering and heuristics algorithm for the vehicle routing problem with time windows
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 obje...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2022-01-01
|
| Series: | International Journal of Industrial Engineering Computations |
| Online Access: | http://www.growingscience.com/ijiec/Vol13/IJIEC_2021_32.pdf |
| _version_ | 1818891869501784064 |
|---|---|
| author | Andrés Felipe León Villalba Elsa Cristina González La Rotta |
| author_facet | Andrés Felipe León Villalba Elsa Cristina González La Rotta |
| author_sort | Andrés Felipe León Villalba |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-19T17:47:40Z |
| format | Article |
| id | doaj.art-1eff0a1390034e87a85060e9be62fae6 |
| institution | Directory Open Access Journal |
| issn | 1923-2926 1923-2934 |
| language | English |
| last_indexed | 2024-12-19T17:47:40Z |
| publishDate | 2022-01-01 |
| publisher | Growing Science |
| record_format | Article |
| series | International Journal of Industrial Engineering Computations |
| spelling | doaj.art-1eff0a1390034e87a85060e9be62fae62022-12-21T20:12:00ZengGrowing ScienceInternational Journal of Industrial Engineering Computations1923-29261923-29342022-01-0113216518410.5267/j.ijiec.2021.12.002Clustering and heuristics algorithm for the vehicle routing problem with time windowsAndrés Felipe León VillalbaElsa Cristina González La RottaThis 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.http://www.growingscience.com/ijiec/Vol13/IJIEC_2021_32.pdf |
| spellingShingle | Andrés Felipe León Villalba Elsa Cristina González La Rotta Clustering and heuristics algorithm for the vehicle routing problem with time windows International Journal of Industrial Engineering Computations |
| title | Clustering and heuristics algorithm for the vehicle routing problem with time windows |
| title_full | Clustering and heuristics algorithm for the vehicle routing problem with time windows |
| title_fullStr | Clustering and heuristics algorithm for the vehicle routing problem with time windows |
| title_full_unstemmed | Clustering and heuristics algorithm for the vehicle routing problem with time windows |
| title_short | Clustering and heuristics algorithm for the vehicle routing problem with time windows |
| title_sort | clustering and heuristics algorithm for the vehicle routing problem with time windows |
| url | http://www.growingscience.com/ijiec/Vol13/IJIEC_2021_32.pdf |
| work_keys_str_mv | AT andresfelipeleonvillalba clusteringandheuristicsalgorithmforthevehicleroutingproblemwithtimewindows AT elsacristinagonzalezlarotta clusteringandheuristicsalgorithmforthevehicleroutingproblemwithtimewindows |