Next Article in Journal
Microstructural Characterization of a Single Crystal Copper Rod Using Monochromatic Neutron Radiography Scan and Tomography: A Test Experiment
Previous Article in Journal
Silver-Nanowire-Based Localized-Surface-Plasmon-Assisted Transparent Conducting Electrode for High-Efficiency Light-Emitting Diode
 
 
Article

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

1
Department of Information and Computer Technology, Graduate School of Engineering, Tokyo University of Science, 6-3-1 Niijuku, Katsushika-ku, Tokyo 125-8585, Japan
2
Graduate School of Electronics, Information and Media Engineering Major, Nippon Institute of Technology, 4-1 Gakuendai, Miyashiro-machi, Minamisaitama-gun, Saitama 345-8501, Japan
3
Department of Information and Computer Technology, Faculty of Advanced Engineering, Nippon Institute of Technology, 4-1 Gakuendai, Miyashiro-machi, Minamisaitama-gun, Saitama 345-8501, Japan
4
Department of Information and Computer Technology, Faculty of Engineering, Tokyo University of Science, 6-3-1 Niijuku, Katsushika-ku, Tokyo 125-8585, Japan
*
Author to whom correspondence should be addressed.
Academic Editor: Seong-Ik Han
Appl. Sci. 2021, 11(16), 7749; https://doi.org/10.3390/app11167749
Received: 6 July 2021 / Revised: 19 August 2021 / Accepted: 19 August 2021 / Published: 23 August 2021
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. View Full-Text
Keywords: bicycle sharing system; heuristic method; tabu search; feasible and infeasible solution bicycle sharing system; heuristic method; tabu search; feasible and infeasible solution
Show Figures

Figure 1

MDPI and ACS Style

Tsushima, H.; Matsuura, T.; Ikeguchi, T. Strategy for Exploring Feasible and Infeasible Solution Spaces to Solve a Multiple-Vehicle Bike Sharing System Routing Problem. Appl. Sci. 2021, 11, 7749. https://doi.org/10.3390/app11167749

AMA Style

Tsushima H, Matsuura T, Ikeguchi T. Strategy for Exploring Feasible and Infeasible Solution Spaces to Solve a Multiple-Vehicle Bike Sharing System Routing Problem. Applied Sciences. 2021; 11(16):7749. https://doi.org/10.3390/app11167749

Chicago/Turabian Style

Tsushima, Honami, Takafumi Matsuura, and Tohru Ikeguchi. 2021. "Strategy for Exploring Feasible and Infeasible Solution Spaces to Solve a Multiple-Vehicle Bike Sharing System Routing Problem" Applied Sciences 11, no. 16: 7749. https://doi.org/10.3390/app11167749

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop