A cluster first-route second approach for a capacitated vehicle routing problem : a case study
Year of publication: |
2018
|
---|---|
Authors: | Comert, Serap Ercan ; Yazgan, Harun Resit ; Kır, Sena ; Yener, Furkan |
Published in: |
International journal of procurement management. - Genève : Inderscience Enterprises Ltd., ISSN 1753-8432, ZDB-ID 2422777-8. - Vol. 11.2018, 4, p. 399-419
|
Subject: | capacitated vehicle routing problem | CVRP | k-means clustering algorithm | K-medoids clustering algorithm | random clustering algorithm | branch and bound algorithm | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Regionales Cluster | Regional cluster | Clusteranalyse | Cluster analysis | Heuristik | Heuristics | Branch-and-Bound | Branch and Bound | Theorie | Theory |
-
Algorithms based on branch and bound for the flying sidekick traveling salesman problem
Dell'Amico, Mauro, (2021)
-
Jin, Bo, (2023)
-
Automatic clustering for generalised cell formation using a hybrid particle swarm optimisation
Kao, Yucheng, (2014)
- More ...
-
A new collecting and management proposal under Logistics 4.0 and green concept
Yazgan, Harun Resit, (2021)
-
Kır, Sena, (2019)
-
A novel heuristic algorithm for capacitated vehicle routing problem
Kır, Sena, (2017)
- More ...