Next Article in Journal
Anthropometric Ratios for Lower-Body Detection Based on Deep Learning and Traditional Methods
Previous Article in Journal
A White-Box Sociolinguistic Model for Gender Detection
 
 
Article

Searching Strategies with Low Computational Costs for 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
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
3
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. 2022, 12(5), 2675; https://doi.org/10.3390/app12052675
Received: 26 January 2022 / Revised: 25 February 2022 / Accepted: 2 March 2022 / Published: 4 March 2022
(This article belongs to the Section Computing and Artificial Intelligence)
We have already proposed a multiple-vehicle bike sharing system routing problem (mBSSRP) to adjust the number of bicycles at each port using multiple vehicles in short time. However, there are many strict constraints in the mBSSRP, thus it is difficult to obtain feasible solutions of the mBSSRP for some instances. To obtain feasible solutions of the mBSSRP, we have proposed a mBSSRP with soft constraints (mBSSRP-S) that removes some constraints from mBSSRP and appends violations to an objective function as penalties, and a searching strategy that explores both the feasible and infeasible solution spaces. Numerical experiments indicated that solving mBSSRP-S to obtain feasible solutions of mBSSRP results in better performance than solving mBSSRP directly. However, mBSSRP-S includes infeasible solutions of mBSSRP, thus the neighborhood solutions and computational costs increase. In this study, we propose search strategies with low computational costs while maintaining performance. In particular, we propose two search strategies: the first one is to reduce neighborhood solutions to obtain a feasible solution in a short time before finding a feasible solution of the mBSSRP, and the second one is to change the problem to be solved (mBSSRP or mBSSRP-S) after a feasible solution is obtained and to search good near-optimal solutions in a short time. As the first search strategy, we propose two search methods for reducing the number of neighborhood solutions in the Or-opt and the CROSS-exchange and compare their performance with our previous results. From numerical experiments, we confirmed that a feasible solution can be obtained within a short time by exploring only the normal order insertion of the Or-opt and the normal order exchange of the CROSS-exchange as the neighborhood solutions. Next, as the second search strategy after a feasible solution of mBSSRP is obtained, we propose four search methods and compare their performance with our previous results. Numerical experiments show that the search method that only searches for the normal order insertion of the Or-opt and the normal order exchange of the CROSS-exchange with hard constraints after obtaining a feasible solution can obtain short tours within a short time. View Full-Text
Keywords: bicycle sharing system; combinatorial optimization problem; tabu search; low computational costs; Or-opt; CROSS-exchange bicycle sharing system; combinatorial optimization problem; tabu search; low computational costs; Or-opt; CROSS-exchange
Show Figures

Figure 1

MDPI and ACS Style

Tsushima, H.; Matsuura, T.; Ikeguchi, T. Searching Strategies with Low Computational Costs for Multiple-Vehicle Bike Sharing System Routing Problem. Appl. Sci. 2022, 12, 2675. https://doi.org/10.3390/app12052675

AMA Style

Tsushima H, Matsuura T, Ikeguchi T. Searching Strategies with Low Computational Costs for Multiple-Vehicle Bike Sharing System Routing Problem. Applied Sciences. 2022; 12(5):2675. https://doi.org/10.3390/app12052675

Chicago/Turabian Style

Tsushima, Honami, Takafumi Matsuura, and Tohru Ikeguchi. 2022. "Searching Strategies with Low Computational Costs for Multiple-Vehicle Bike Sharing System Routing Problem" Applied Sciences 12, no. 5: 2675. https://doi.org/10.3390/app12052675

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