Paper Info
Title
A Partitioning Algorithm for Solving Capacitated Arc Routing Problem in Ways of Ranking First Cutting Second.
Abstract
Capacitated Arc Routing Problem CARP is one of the hot issues of logistics research. Specifically, Ranking First Cutting Second RFCS could be used. This research proposed a novel partitioning algorithm - the Multi-Label algorithm which obtained better TSP paths meeting the backpack limit on the basis of a complete TSP return. In addition, by experimental verification on questions in the standard question database, the experimental results showed that compared with general partitioning algorithms, for the same complete TSP return, many TSP paths with the shortest total length could be obtained by the Multi-Label algorithm.
Year
DOI
Venue
2015
10.1007/978-3-319-25159-2_67
KSEM
Keywords
Field
DocType
Partitioning algorithm,Capacitated arc routing problem,Ranking first cutting second
Arc routing,Mathematical optimization,Ranking,Computer science,Algorithm
Conference
Volume
ISSN
Citations 
9403
0302-9743
0
PageRank 
References 
Authors
0.34
7
5
Name
Order
Citations
PageRank
Wei Zhang101.69
Lining Xing2168.51
Ting Xi300.34
Lei He485467.22
Jinyuan Liu500.34