Strategy for Exploring Feasible and Infeasible Solution Spaces to Solve a Multiple-Vehicle Bike Sharing System Routing Problem

被引:2
|
作者
Tsushima, Honami [1 ,2 ]
Matsuura, Takafumi [2 ,3 ]
Ikeguchi, Tohru [1 ,4 ]
机构
[1] Tokyo Univ Sci, Grad Sch Engn, Dept Informat & Comp Technol, Katsushika Ku, 6-3-1 Niijuku, Tokyo 1258585, Japan
[2] Nippon Inst Technol, Informat & Media Engn Major, Grad Sch Elect, 4-1 Gakuendai, Miyashiro, Saitama 3458501, Japan
[3] Nippon Inst Technol, Fac Adv Engn, Dept Informat & Comp Technol, 4-1 Gakuendai, Miyashiro, Saitama 3458501, Japan
[4] Tokyo Univ Sci, Fac Engn, Dept Informat & Comp Technol, Katsushika Ku, 6-3-1 Niijuku, Tokyo 1258585, Japan
来源
APPLIED SCIENCES-BASEL | 2021年 / 11卷 / 16期
关键词
bicycle sharing system; heuristic method; tabu search; feasible and infeasible solution; SEARCH;
D O I
10.3390/app11167749
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
In bicycle sharing systems, many vehicles restore bicycles to ports. To construct the shortest tour of these vehicles, in a previous work, we formulated the multiple-vehicle bike sharing system routing problem (mBSSRP) and demonstrated that an optimal solution can be obtained for small-sized instances through a general-purpose mixed-integer linear programming solver. However, for large-sized instances, the optimal solution could not be found in a reasonable time frame. Therefore, to find near-optimal solutions for the mBSSRPs in a short time, in this study, we develop a method with a searching strategy, which explores both the feasible and infeasible solution spaces. To investigate the performance of the proposed method, we solve benchmark problems of mBSSRP. In addition, we compare the proposed method with the method exploring only the feasible solution space, in terms of performance. The results of the numerical experiments demonstrate that the proposed method can reach optimal solutions for almost all small-sized mBSSRP instances and that searching both the feasible and infeasible solution spaces yields good feasible solutions both for small-sized and large-sized instances.
引用
收藏
页数:20
相关论文
共 3 条
  • [1] Searching Strategies with Low Computational Costs for Multiple-Vehicle Bike Sharing System Routing Problem
    Tsushima, Honami
    Matsuura, Takafumi
    Ikeguchi, Tohru
    [J]. APPLIED SCIENCES-BASEL, 2022, 12 (05):
  • [2] Exploring Feasible and Infeasible Regions in the Vehicle Routing Problem with Time Windows Using a Multi-objective Particle Swarm Optimization Approach
    Castro, Juan P.
    Landa-Silva, Dario
    Moreno Perez, Jose A.
    [J]. NICSO 2008: NATURE INSPIRED COOPERATIVE STRATEGIES FOR OPTIMIZATION, 2009, 236 : 103 - +
  • [3] Effective Hierarchical Optimization using Integration of Solution Spaces and its Application to multiple Vehicle Routing Problem
    Ishikawa, S.
    Horio, K.
    Kubota, R.
    [J]. 2015 INTERNATIONAL SYMPOSIUM ON INTELLIGENT SIGNAL PROCESSING AND COMMUNICATION SYSTEMS (ISPACS), 2015, : 406 - 411