Solving the Traveling Thief Problem Based on Item Selection Weight and Reverse-Order Allocation

doi:10.1109/ACCESS.2021.3070204

CORC > 自动化研究所 > 中国科学院自动化研究所 > 精密感知与控制研究中心 > 人工智能与机器学习

	Solving the Traveling Thief Problem Based on Item Selection Weight and Reverse-Order Allocation
	Zhang, Zitong 4; Yang, Lei 3,4; Kang, Peipei 1; Jia, Xiaotian 4; Zhang, Wensheng 2
刊名	IEEE ACCESS
	2021
卷号	9 页码:54056-54066
关键词	Urban areas Heuristic algorithms Resource management Optimization Mathematical model Benchmark testing Approximation algorithms Traveling thief problem interdependence item selection weight reverse order allocation
ISSN号	2169-3536
DOI	10.1109/ACCESS.2021.3070204
通讯作者	Yang, Lei(yanglei_s@scau.edu.cn)
英文摘要	The traveling thief problem (TTP) is a challenging combinatorial optimization problem that has attracted many scholars, the problem interconnects two well-known NP-hard problems: the traveling salesman problem and the 0-1 knapsack problem. Various approaches have increasingly been proposed to solve this novel problem that combines two interdependent subproblems. In this paper, the TTP is investigated theoretically and empirically. This paper proposed an approach based on item selection weight and reverse-order allocation. A novel method to calculate the score value of each item for item selection, which expands the effect of the item's weight, was introduced. Furthermore, the approach adopted reverse-order allocation, which selects items in an inverse order according to the traveling route. Different approaches for solving the TTP are compared and analyzed. The experimental investigations suggest that our proposed approach is competitive for many instances of various sizes and types compared to other heuristics.
资助项目	Natural Science Foundation of Guangdong Province of China[2020A1515010691] ; Science and Technology Project of Guangdong Province of China[2018A0124] ; Guangdong Provincial Key Laboratory of Food Quality and Safety[2020B1212060059] ; National Natural Science Foundation of China[61573157] ; National Natural Science Foundation of China[61703170]
WOS研究方向	Computer Science ; Engineering ; Telecommunications
语种	英语
出版者	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
WOS记录号	WOS:000641004700001
资助机构	Natural Science Foundation of Guangdong Province of China ; Science and Technology Project of Guangdong Province of China ; Guangdong Provincial Key Laboratory of Food Quality and Safety ; National Natural Science Foundation of China
内容类型	期刊论文
源URL	[http://ir.ia.ac.cn/handle/173211/44184]
专题	精密感知与控制研究中心_人工智能与机器学习
通讯作者	Yang, Lei
作者单位	1.Guangdong Univ Technol, Coll Comp, Guangzhou 510006, Peoples R China 2.Chinese Acad Sci, Inst Automat, Beijing 100190, Peoples R China 3.South China Agr Univ, Guangdong Prov Key Lab Food Qual & Safety, Guangzhou 510642, Peoples R China 4.South China Agr Univ, Coll Math & Informat, Guangzhou 510642, Peoples R China
推荐引用方式 GB/T 7714	Zhang, Zitong,Yang, Lei,Kang, Peipei,et al. Solving the Traveling Thief Problem Based on Item Selection Weight and Reverse-Order Allocation[J]. IEEE ACCESS,2021,9:54056-54066.
APA	Zhang, Zitong,Yang, Lei,Kang, Peipei,Jia, Xiaotian,&Zhang, Wensheng.(2021).Solving the Traveling Thief Problem Based on Item Selection Weight and Reverse-Order Allocation.IEEE ACCESS,9,54056-54066.
MLA	Zhang, Zitong,et al."Solving the Traveling Thief Problem Based on Item Selection Weight and Reverse-Order Allocation".IEEE ACCESS 9(2021):54056-54066.