A hybrid large neighborhood search for the static multi-vehicle bike-repositioning problem

详细信息    查看全文

• 作者：Sin C. Ho^a ; ^c ; ^sinho@hku.hk ; W.Y. Szeto ; ^b ; ^c ; ^{ceszeto@hku.hk}
• 关键词：Bike-sharing ; Bike-repositioning ; Pick-up and delivery routing ; Large neighborhood search ; Tabu search
• 刊名：Transportation Research Part B: Methodological
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：95
• 期：Complete
• 页码：340-363
• 全文大小：851 K
• 卷排序：95

文摘

This paper proposes a hybrid large neighborhood search to solve the multi-vehicle static repositioning problem. Several removal and insertion operators are proposed to diversify and intensify the search. A simple tabu search is further applied to the most promising solutions. Results show that the heuristic outperforms both the CPLEX and the math heuristic by Forma et al. (2015) [Transportation Research Part B 71: 230–247]. The average improvement over the math heuristic is 1.06% using only a small fraction of computing time.