Research on the station location problem for public bicycle systems under dynamic demand

作     者：Cao, Jin Xin Xue, Cong Cong Jian, Mei Ying Yao, Xue Ru 

作者机构：Inner Mongolia Univ Inst Traff Engn Hohhot Peoples R China Inner Mongolia Engn Res Ctr Urban Transportat Dat Hohhot Peoples R China Inner Mongolia Univ Sch Math Sci Hohhot Peoples R China 

出 版 物：《COMPUTERS & INDUSTRIAL ENGINEERING》 (计算机与工业工程)

年 卷 期：2019年第127卷

页      面：971-980页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Natural Science Foundation of China Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry Young Talent on Science and Technology Program of University in Inner Mongolia [NJYT-12-B02] Natural Science Foundation of Inner Mongolia [2016MS0501] 

主　　题：Public bicycle system Facility location problem Mixed integer programming Genetic algorithm Variable neighborhood search algorithm 

摘      要：This paper proposes a station location problem for public bicycle systems under a zoning scheme with consideration for multi-period demand. The objective of the problem is to minimize the fixed construction costs and variable operational costs of the public bicycle stations. A mixed integer programming model is formulated for the problem. Owing to the computational intractability of the problem under study, a genetic algorithm and a variable neighborhood search algorithm are developed to solve the problem. Comprehensive computational experiments are conducted to illustrate the effectiveness and efficiency of the proposed approach.