A Tabu Search Algorithm Based on Density Peak Clustering to Solve VRPTW

Aiming at the problem that the efficiency and quality of traditional heuristic algorithm for vehicle routing problem will decrease with the increase of problem size, a tabu search (TS) algorithm based on density peak clustering (DPC/TS) is proposed to solve vehicle routing problem with time window (...

Full description

Saved in:
Bibliographic Details
Published inInternational Conference on Big Data and Information Analytics (Online) pp. 472 - 478
Main Authors Zhang, Zhiwei, Dou, Yajie, Cheng, Wei, Xu, Xiangqian, Jiang, Jiang, Tan, Yuejin
Format Conference Proceeding
LanguageEnglish
Published IEEE 24.08.2022
Subjects
Big Data
Clustering algorithms
density peak clustering (DPC)
Heuristic algorithms
Search problems
tabu search (TS)
time window
Vehicle dynamics
Vehicle routing
vehicle routing problem with time window (VRPTW)
Online AccessGet full text
ISSN2771-6902
DOI10.1109/BigDIA56350.2022.9874007

Cover

Abstract Aiming at the problem that the efficiency and quality of traditional heuristic algorithm for vehicle routing problem will decrease with the increase of problem size, a tabu search (TS) algorithm based on density peak clustering (DPC/TS) is proposed to solve vehicle routing problem with time window (VRPTW). In this algorithm, the density peak clustering algorithm (DPC) is used to cluster the customer points, and the VRPTW problem is divided into small sub-problems, and then the tabu search algorithm is used to solve the sub-problem. The results show that the proposed algorithm has better problem solving quality and faster problem solving efficiency.
AbstractList Aiming at the problem that the efficiency and quality of traditional heuristic algorithm for vehicle routing problem will decrease with the increase of problem size, a tabu search (TS) algorithm based on density peak clustering (DPC/TS) is proposed to solve vehicle routing problem with time window (VRPTW). In this algorithm, the density peak clustering algorithm (DPC) is used to cluster the customer points, and the VRPTW problem is divided into small sub-problems, and then the tabu search algorithm is used to solve the sub-problem. The results show that the proposed algorithm has better problem solving quality and faster problem solving efficiency.
Author Jiang, Jiang
Dou, Yajie
Tan, Yuejin
Zhang, Zhiwei
Cheng, Wei
Xu, Xiangqian
Author_xml – sequence: 1
  givenname: Zhiwei
  surname: Zhang
  fullname: Zhang, Zhiwei
  email: zhangzhiwei1019@163.com
  organization: College of Systems Engineering, National University of Defense Technology,Changsha,China,410003
– sequence: 2
  givenname: Yajie
  surname: Dou
  fullname: Dou, Yajie
  email: yajiedou_nudt@163.com
  organization: College of Systems Engineering, National University of Defense Technology,Changsha,P. R. China
– sequence: 3
  givenname: Wei
  surname: Cheng
  fullname: Cheng, Wei
  email: chengwei073022@163.com
  organization: School of Management & Engineering, Nanjing University,Nanjing,China,210093
– sequence: 4
  givenname: Xiangqian
  surname: Xu
  fullname: Xu, Xiangqian
  email: xuxiangqian18@163.com
  organization: College of Systems Engineering, National University of Defense Technology,Changsha,China,410003
– sequence: 5
  givenname: Jiang
  surname: Jiang
  fullname: Jiang, Jiang
  email: jiangjiangnudt@163.com
  organization: College of Systems Engineering, National University of Defense Technology,Changsha,China,410003
– sequence: 6
  givenname: Yuejin
  surname: Tan
  fullname: Tan, Yuejin
  email: yuejintan@nudt.edu.cn
  organization: College of Systems Engineering, National University,Changsha,China,410003
BookMark eNotz81OwkAUQOHRaCIiT-BmXqB457-zLEWQhEQiqEty296W0dKatpjw9i5kdXZfcu7ZTdM2xBgXMBUC_NMsVPNVYqwyMJUg5dTHTgO4KzbxLhbWGh07b-U1G0nnRGQ9yDs26fsvAFASNBg5YsuE7zA78S1hlx94UldtF4bDkc-wp4K3DZ9T04fhzDeE3zytT_1AXWgqPrR829a_xD_eNrvPB3ZbYt3T5NIxe18879KXaP26XKXJOgpCqSHSQuaxh8whUWY0YqZ16ZVUmBstEHIbF2iKvBSFL8rCSWEsal9mxnnKdanG7PHfDUS0_-nCEbvz_rKu_gDvnE98
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/BigDIA56350.2022.9874007
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781665487962
1665487968
EISSN 2771-6902
EndPage 478
ExternalDocumentID 9874007
Genre orig-research
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 71901214
  funderid: 10.13039/501100001667
GroupedDBID 6IE
6IF
6IL
6IN
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
OCL
RIE
RIL
ID FETCH-LOGICAL-i133t-412c890b7aeeb54aab44f9323ac541a0c68da5dcf1d9dfd72156a49fb579ec4f3
IEDL.DBID RIE
IngestDate Wed Aug 27 02:19:03 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i133t-412c890b7aeeb54aab44f9323ac541a0c68da5dcf1d9dfd72156a49fb579ec4f3
PageCount 7
ParticipantIDs ieee_primary_9874007
PublicationCentury 2000
PublicationDate 2022-Aug.-24
PublicationDateYYYYMMDD 2022-08-24
PublicationDate_xml – month: 08
  year: 2022
  text: 2022-Aug.-24
  day: 24
PublicationDecade 2020
PublicationTitle International Conference on Big Data and Information Analytics (Online)
PublicationTitleAbbrev BIGDIA
PublicationYear 2022
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0003204052
Score 2.209428
Snippet Aiming at the problem that the efficiency and quality of traditional heuristic algorithm for vehicle routing problem will decrease with the increase of problem...
SourceID ieee
SourceType Publisher
StartPage 472
SubjectTerms Big Data
Clustering algorithms
density peak clustering (DPC)
Heuristic algorithms
Search problems
tabu search (TS)
time window
Vehicle dynamics
Vehicle routing
vehicle routing problem with time window (VRPTW)
Title A Tabu Search Algorithm Based on Density Peak Clustering to Solve VRPTW
URI https://ieeexplore.ieee.org/document/9874007
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1bT8IwGG2QJ59QwXhPH3x0Y5d2Wx-5iGiCIQrKG-kVCbgZspnor7fdxozGB9-WLWuadu3Z9_Wc8wFwGUShoL5LLQchZqGQCYsggiyFcaT0wsQCGXHy6D4YTtHdDM9q4KrSwkgpc_KZtM1lfpYvEp6ZVFmbmPpxRjq-E0ZBodWq8im-pz9HXJF1HNLuLhf92w7WiOroONDz7PL1H3VUchgZNMBo24GCPbKys5TZ_POXN-N_e7gHWt-CPTiuoGgf1GR8ABrbig2wXMBNcNOBE8oyWJCMYWe9SDbL9OUVdjWYCZjEsG8I7ekH1FvlCvbWmfFR0E3CNIGPyfpdwqeH8eS5BaaD60lvaJWlFKylDkJTC7kej4jDQiolw4hShpDSv24-5Ri51OFBJCgWXLmCCCV0WIgDiohiOCSSI-UfgnqcxPIIQMH1E8QY4QE25oLEZ8bxxXWU43I_9I9B04zL_K1wy5iXQ3Ly9-1TsGvmxmRpPXQG6ukmk-ca5lN2kc_vFwjZpf0
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1JT8JAGJ0QPOjJBYy7c_Boocs3befIIoICIQrKjcxWJGBrSGuiv94ZNqPx4K1pk8lklr75vnnvfQhd-WEgmecwywbgFgRcWhQoWBEhYaQ3JpFgxMmdrt8cwN2QDHPoeqOFUUotyGeqZB4Xd_kyEZlJlZWpqR9npONbBADIUq21yah4rl6QZEPXsWm5OhnXWxWiMdXWkaDrllYN_KiksgCSxi7qrLuw5I9MS1nKS-Lzlzvjf_u4h4rfkj3c24DRPsqp-ADtrms24NUWLqDbCu4znuElzRhXZuNkPklfXnFVw5nESYzrhtKefmD9s5zi2iwzTgq6SZwm-DGZvSv89NDrPxfRoHHTrzWtVTEFa6LD0NQCxxUhtXnAlOIEGOMAkT68eUwQcJgt_FAyIkXkSCojqQND4jOgEScBVQIi7xDl4yRWRwhLob8A51T4xNgLUo8bzxfHjmxHeIF3jApmXEZvS7-M0WpITv5-fYm2m_1Oe9Rude9P0Y6ZJ5OzdeEM5dN5ps416Kf8YjHXX-uSqUo
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%3Abook&rft.genre=proceeding&rft.title=International+Conference+on+Big+Data+and+Information+Analytics+%28Online%29&rft.atitle=A+Tabu+Search+Algorithm+Based+on+Density+Peak+Clustering+to+Solve+VRPTW&rft.au=Zhang%2C+Zhiwei&rft.au=Dou%2C+Yajie&rft.au=Cheng%2C+Wei&rft.au=Xu%2C+Xiangqian&rft.date=2022-08-24&rft.pub=IEEE&rft.eissn=2771-6902&rft.spage=472&rft.epage=478&rft_id=info:doi/10.1109%2FBigDIA56350.2022.9874007&rft.externalDocID=9874007