An exact algorithm for the static rebalancing problem arising in bicycle sharing systems.
European Journal of Operational Research(2015)
摘要
•A routing optimization problem arising in bicycle sharing systems is studied.•The first exact algorithm for the problem is proposed.•The underlying formulation is developed using a variable transformation from general integer to binary variables.•The algorithm is a branch-and-cut algorithm that uses combinatorial Benders’ cuts.•Instances with up to 60 stations are solved to optimality.
更多查看译文
关键词
Bicycle sharing systems,Pickup and delivery,Multiple visits,Branch-and-cut
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络