元启发式
旅行商问题
邻里(数学)
计算机科学
数学优化
度量(数据仓库)
利润(经济学)
运筹学
数学
数据挖掘
经济
数学分析
微观经济学
作者
Hongtao Lei,Gilbert Laporte,Yajie Liu,Tao Zhang
标识
DOI:10.1016/j.cor.2014.11.008
摘要
We introduce the Multiple Traveling Salesmen and Districting Problem with Multi-periods and Multi-depots. In this problem, the compactness of the subdistricts, the dissimilarity measure of districts and an equity measure of salesmen profit are considered as part of the objective function, and the salesman travel cost on each subdistrict is approximated by the Beardwood–Halton–Hammersley formula. An adaptive large neighbourhood search metaheuristic is developed for the problem. It was tested on modified Solomon and Gehring & Homberger instances. Computational results confirm the effectiveness of the proposed metaheuristic.
科研通智能强力驱动
Strongly Powered by AbleSci AI