Constrained Clustering for the Capacitated Vehicle Routing Problem (CC-CVRP)
eCommerce, postal and logistics’ planners require to solve large-scale capacitated vehicle routing problems (CVRPs) on a daily basis. CVRP problems are NP-Hard and cannot be easily solved for large problem instances. Given their complexity, we propose a methodology to reduce the size of CVRP problem...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2022-12-01
|
| Series: | Applied Artificial Intelligence |
| Online Access: | http://dx.doi.org/10.1080/08839514.2021.1995658 |