An Efficient Density-Based Clustering Algorithm for the Capacitated Vehicle Routing Problem

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 heuris...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal of advanced network, monitoring, and controls Ročník 2; číslo 4; s. 161 - 165
Hlavný autor: Zhang, Jiashan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Xi'an Sciendo 01.01.2017
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Predmet:
CVRP
Density-based clustering algorithm
Max-min ant system
Two-phase heuristic
ISSN:2470-8038
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract 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 clusters to vehicles and sequences them on each tour. Max-min ant system is used to order nodes within clusters . The simulation results indicate efficiency of the proposed algorithm.
AbstractList 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 clusters to vehicles and sequences them on each tour. Max-min ant system is used to order nodes within clusters . The simulation results indicate efficiency of the proposed algorithm.
Author Zhang, Jiashan
Author_xml – sequence: 1
  givenname: Jiashan
  surname: Zhang
  fullname: Zhang, Jiashan
  email: zh_jiashan@163.com
  organization: Chongqing vocational institute of engineering, Chongqing, 402260, China
BookMark eNpFkM1LwzAUwIMoOOfOXgOeO_OSNk3By6zzAwaKDC8eSpa8bhk1nW2K7L83c4Kn93j83tfvgpz61iMhV8CmHATLb5wxHvWUM8inhTwhI57mLFFMqHMy6fstY4yDLDIQI_Ix83Re18449IHeo-9d2Cd3ukdLy2boA3bOr-msWbedC5tPWrcdDRukpd5p44IOEXzHjTMN0rd2CAf6tWtXDX5ekrNaNz1O_uKYLB_my_IpWbw8PpezRbJTAIlRKccUFAOV2VppC6t4OSBPeQYFgoIaV9xKIfPCWMF1nVtppGaxIjJbiDG5Po7dde3XgH2otu3Q-bixEpDFLkgzEanbI_Wtm_iUxXU37GPyDwOrfv1VR3_VwV9VSJ6CBPEDyxVpJQ
ContentType Journal Article
Copyright 2017. This work is published under http://creativecommons.org/licenses/by/4.0 (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2017. This work is published under http://creativecommons.org/licenses/by/4.0 (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID ABUWG
AFKRA
AZQEC
BENPR
CCPQU
DWQXO
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
DOI 10.21307/iccnea.2017.96
DatabaseName ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
AUTh Library subscriptions: ProQuest Central
ProQuest One Community College
ProQuest Central Korea
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DatabaseTitle Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2470-8038
EndPage 165
ExternalDocumentID 10_21307_iccnea_2017_9624161
GroupedDBID ADBBV
AFFHD
AFKRA
AHGSO
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BENPR
CCPQU
EBS
IAO
M~E
OK1
PHGZM
PHGZT
PIMPY
SLJYH
ABUWG
AZQEC
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-p811-c842e4180185df8ad1b2011e242519e181feb2d63679cd32af7d6c6a063635d93
IEDL.DBID BENPR
IngestDate Sun Oct 19 01:30:24 EDT 2025
Sat Nov 29 01:28:48 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License This work is licensed under the Creative Commons Attribution 4.0 International License.
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-p811-c842e4180185df8ad1b2011e242519e181feb2d63679cd32af7d6c6a063635d93
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/3156791453?pq-origsite=%requestingapplication%
PQID 3156791453
PQPubID 6762062
PageCount 5
ParticipantIDs proquest_journals_3156791453
walterdegruyter_journals_10_21307_iccnea_2017_9624161
PublicationCentury 2000
PublicationDate 2017-01-01
20170101
PublicationDateYYYYMMDD 2017-01-01
PublicationDate_xml – month: 01
  year: 2017
  text: 2017-01-01
  day: 01
PublicationDecade 2010
PublicationPlace Xi'an
PublicationPlace_xml – name: Xi'an
PublicationTitle International journal of advanced network, monitoring, and controls
PublicationYear 2017
Publisher Sciendo
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Publisher_xml – name: Sciendo
– name: De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
SSID ssj0002169513
Score 1.9734364
Snippet The capacitated vehicle routing problem (CVRP) is one of the most challenging problems in the optimization of distribution. Most approaches can solve case...
SourceID proquest
walterdegruyter
SourceType Aggregation Database
Publisher
StartPage 161
SubjectTerms CVRP
Density-based clustering algorithm
Max-min ant system
Two-phase heuristic
Title An Efficient Density-Based Clustering Algorithm for the Capacitated Vehicle Routing Problem
URI https://reference-global.com/article/10.21307/iccnea.2017.96
https://www.proquest.com/docview/3156791453
Volume 2
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  databaseCode: M~E
  dateStart: 20160101
  customDbUrl:
  isFulltext: true
  eissn: 2470-8038
  dateEnd: 99991231
  titleUrlDefault: https://road.issn.org
  omitProxy: false
  ssIdentifier: ssj0002169513
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: ProQuest Central
  databaseCode: BENPR
  dateStart: 20160101
  customDbUrl:
  isFulltext: true
  eissn: 2470-8038
  dateEnd: 99991231
  titleUrlDefault: https://www.proquest.com/central
  omitProxy: false
  ssIdentifier: ssj0002169513
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  databaseCode: PIMPY
  dateStart: 20160101
  customDbUrl:
  isFulltext: true
  eissn: 2470-8038
  dateEnd: 99991231
  titleUrlDefault: http://search.proquest.com/publiccontent
  omitProxy: false
  ssIdentifier: ssj0002169513
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NT8IwFG8UPXgBPyOKpgevE9p9nwwgRBMliyEG42EZbQckOBCGhv_e97ZOogcvnpYlL-3W1_b3e--17xFyZbvKEgA8xhD4rWHJhmcMfe6CzePEQ6shXW5nF4Uf3F7PGwz8QDvclvpYZbEnZhu1nAn0kddNMDRcn1m2eTN_N7BqFEZXdQmNbbKDmcpgnu-0Or3g6dvLwpkDFMLMc_pw2K_d-kSIRGHGIeZe-84PYln-zELUUo0Wq3VahEQzpOlW_vuN-6SsOSZt5pPigGyp5JBUivoNVC_nI_LaTGgnSyEByENv8Sh7ujZagGuStqcrTKEAwEab0xF0ko7fKBBcCoSRtgFhBV5OA8FnNcZeKB4tQukgr1BzTPrdTr99Z-hiC8bcY8wQnsWVxQCvPFvGXiTZEKmBQouE-Qp4QAw2uHRM-EEhTR7FrnSEEwHDAcoiffOElJJZok4JVTG3RYypxeLY8pQAxgFAbHN4YZGK7CqpFaMX6gWzDDdDVyX2LzVspMBiyZQY5koMUYmh73C00s7-bvac7KF07j2pkVK6WKkLsis-0slycannDTyD-8fg5QsOi9Co
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V07T8MwED6hggRLeYvy9ABjKHbeA0KlFFG1VB0qBGKIUtsBJEhLm4L6o_iP3OUBgoGtA2MkJ5Zzn-77zj7fARzarrYkEo_RR31rWOrEM_q-cDHmcaK-daJcYacXhdtup-Pd3vrdOfgo7sJQWmXhE1NHrQaS9sirJgYars8t2zwbvhrUNYpOV4sWGhksWnr6jiHb-LR5gfY9EuKy0atfGXlXAWPocW5IzxLa4uiYPVtFXqh4nzhQk_TmvkbCizDYVI6Js0llijBylSOdEKkcuVlR7SX0-PMWYb0E893mdffua1NHcAcVi5mVEBJID271ScpYU4Ej7h77zg8dW35PT8SVfhhNpklxApsS2-XyP_slK1DOFTSrZZBfhTkdr8Fy0Z2C5c5qHe5rMWukBTKQV9kFJeonU-McWVux-vOECkQgbbPa8wOuKXl8YSjfGcphVkf9IOnqHQ680Y80C6PEKRrdzfrvbEBvFivchFI8iPUWMB0JW0ZUOC2KLE9L1FMoM2yBDzzUoV2B3cJYQe4OxsG3pSpg_7L69yiMx1LMBBlmAsJM4DuCYtDtvz97AItXvet20G52WjuwRG9m-0S7UEpGE70HC_IteRqP9nPIMghmjIhPShko0Q
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Efficient+Density-Based+Clustering+Algorithm+for+the+Capacitated+Vehicle+Routing+Problem&rft.jtitle=International+journal+of+advanced+network%2C+monitoring%2C+and+controls&rft.au=Zhang%2C+Jiashan&rft.date=2017-01-01&rft.pub=De+Gruyter+Brill+Sp.+z+o.o.%2C+Paradigm+Publishing+Services&rft.eissn=2470-8038&rft.volume=2&rft.issue=4&rft.spage=161&rft.epage=165&rft_id=info:doi/10.21307%2Ficcnea.2017.96