solving the capacitated vehicle routing problem based on improved ant-clustering algorithm
Clicks: 154
ID: 209022
2015
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
154 views
21 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #184 of 435 articles by views in acta botânica brasílica
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 435 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
The capacitated vehicle routing problems (CVRP) are NP-hard. Most approaches can solve small-scale case studies to optimality. Furthermore, they are time-consuming. To overcome the limitation, this paper presents a novel three-phase heuristic approach for the capacitated vehicle routing problem. The first phase aims to identify sets of cost-effective feasible clusters through an improved ant-clustering algorithm, in which the adaptive strategy is adopted. The second phase assigns clusters to vehicles and sequences them on each tour. The third phase orders nodes within clusters for every tour and genetic algorithm is used to order nodes within clusters. The simulation indicates the algorithm attains high quality results in a short time.
| Reference Key |
jiashan2015matecsolving
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Zhang Jiashan;Lin Xiaoqun;Jun Yi;Li Qiang |
| Journal | acta botânica brasílica |
| Year | 2015 |
| DOI |
10.1051/matecconf/20152203022
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.