A heuristic algorithm for a single vehicle static bike sharing rebalancing problem

详细信息    查看全文

• 作者：Fá ; bio Cruz^a ; ^{fabiocba@di.ufpb.br} ; Anand Subramanian^a ; ^{anand@ci.ufpb.br} ; Bruno P. Bruck^b ; ^{bruno.p.bruck@gmail.com} ; Manuel Iori^b ; ^{manuel.iori@unimore.it}
• 关键词：Bike-sharing ; Vehicle routing ; Split pickup and delivery ; Iterated local search
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：79
• 期：Complete
• 页码：19-33
• 全文大小：1501 K
• 卷排序：79

文摘

We propose an efficient hybrid heuristic algorithm for a single-vehicle SBRP. The heuristic found 97% of proven optimal solutions. The open instances were improved in 90% of the cases. Our algorithm outperformed the best known heuristics from the literature.