The bike rebalancing problem is one of the major operational challenges in the urban bike-sharing system, which involves the redistribution of bikes among stations to prevent stations from being empty or overloaded. This paper investigates a new bike rebalancing problem, which considers the collection of broken bikes in the multi-depot system. The proposed problem can be classified as a two-commodity vehicle routing problem with pick-up and delivery. An integer programming model is formulated to find the optimal vehicle assignment and visiting sequences with the minimum total working time and fixed cost of vehicles. A hybrid heuristic algorithm integrating variable neighborhood search and dynamic programming is proposed to solve the problem. The computational results show that the proposed method can find 26 best solutions out of 36 instances, while the CPLEX obtains 16 best solutions. Impact of broken bikes collection and distribution of depots is examined. Comparison of different practical strategies indicates that the number of vehicles can be significantly reduced by allowing multiple visits to depots. Allowing vehicles to return to different depots can help reduce the total working time.
6 July 2025 in Simulation Modelling Practice and Theory
This study aims to solve a one-dimensional multi-period cutting stock production replanning problem encountered in manufacturing industry cutting departments, considering pattern-setup costs. For operational purposes, long-term coordinated production and cutting plans are often created based on predicted demand. However, real demand may differ from predictions, and replanning may be warranted by changing conditions. A mixed-integer mathematical model was proposed by minimizing both the production cost and the cost of deviating from established plans. In addition, a hybrid dynamic programming-based heuristic was proposed. Extensive experiments were conducted on randomly generated instances. The influences on the solutions are analysed by varying the holding cost per unit and the deviation cost. Finally, the proposed heuristic is applied to enterprise practice, and the results indicate that the total cost can be expected to be reduced by 14.55% on average.
Drawing on the Emerging Technology Acceptance Model, this study integrates perceived benefits and perceived risks into a unified analytical framework to examine public acceptance of generative artificial intelligence (GenAI). Using three scenario-based survey experiments, the study shows that perceived usefulness and perceived ease of use significantly promote GenAI acceptance, whereas perceived social welfare loss, personal property loss, and technical–ethical conflict all significantly reduce acceptance. The negative effects of these three risk scenarios also differ in magnitude, with personal property loss exerting the strongest inhibitory effect. Heterogeneity analyses further indicate that technology usage behavior moderates these relationships selectively rather than universally, with stronger evidence on the risk side than on the benefit side. In addition, lower confidence in regulatory oversight is more clearly associated with stronger risk sensitivity, whereas evidence for stronger benefit sensitivity under higher regulatory trust remains weak. These findings deepen understanding of the differentiated benefit–risk trade-offs shaping attitudes toward emerging AI technologies among Chinese internet users in an online survey context.