版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Cent South Univ Sch Traff & Transportat Engn Changsha 410075 Hunan Peoples R China Cent South Univ Forestry & Technol Coll Logist & Transportat Changsha 410004 Hunan Peoples R China Natl Univ Def Technol Coll Syst Engn Changsha 410073 Hunan Peoples R China Rail Data Res & Applicat Key Lab Hunan Prov Changsha 410075 Hunan Peoples R China Smart Transport Key Lab Hunan Prov Changsha 410075 Hunan Peoples R China
出 版 物:《COMPUTERS & OPERATIONS RESEARCH》 (计算机与运筹学研究)
年 卷 期:2020年第123卷
页 面:105035-105035页
核心收录:
学科分类:1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:National Natural Science Foundation of China [71672193, 71371181] Graduate education reform project of Central South University [2018JG13]
主 题:Bike-sharing system Bike repositioning and recycling problem Adaptive tabu search algorithm BRRP solver
摘 要:The bike repositioning and recycling problem (BRRP) is significant to develop a sustainable bike-sharing system and can effectively reduce the imbalance between demand and supply. This study investigates the static repositioning and recycling problem of a bike-sharing system, which is formulated as an integer linear programming model. The BRRP is a variant of the multi-depot simultaneous pickup and delivery problem with multi-commodity demand. To solve the proposed model, an adaptive tabu search (ATS) algorithm combined with six neighborhood structures is developed. Moreover, an iterated local search (ILS) and a route elimination operator are both embedded to reduce the number of routes. The performance of the proposed ATS is evaluated by comparing it with tabu search (TS) and variable neighborhood search (VNS). The experimental results show that the proposed algorithm performs better than TS and VNS in terms of the solution quality. The proposed ATS was used to analyze the bicycle system in New York City. Finally, a free solver is developed for the bike repositioning and recycling problem, which is named the BRRP Solver. (C) 2020 Elsevier Ltd. All rights reserved.