Article
The capacitated vehicle routing problem (CVRP) is one of the most challenging problems in the optimization of distribution. Most approaches can solve case studies involving less than 100 nodes to optimality, but time-consuming. To overcome the limitation, this paper presents a novel two-phase heuristic approach for the capacitated vehicle routing problem. Phase I aims to identifying sets of cost-effective feasible clusters through an improved density-based clustering algorithm. Phase II assigns
Jiashan Zhang
International Journal of Advanced Network, Monitoring and Controls , ISSUE 4, 161–165
Research Article
Bogna MRÓWCZYŃSKA
Transport Problems , ISSUE 3, 141–152
Research Article
Biljana GRGUROVIC,
Slavica STRBAC,
Jelena MILUTINOVIC,
Mirjana POPOVIC
Transport Problems , ISSUE 1, 17–22
Article
Paweł DROŹDZIEL,
Monika WIŃSKA,
Radovan MADLEŇÁK,
Paweł SZUMSKI
Transport Problems , ISSUE 3, 43–50