Performance Analysis and Improvement of the Bike Sharing System Using Closed Queuing Networks with Blocking Mechanism

Samet, Bacem; Couffin, Florent; Zolghadri, Marc; Barkallah, Maher; Haddar, Mohamed

doi:10.3390/su10124663

Cited by 12 publications

(5 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Samet et al [55] considered the blocking phenomenon and developed a CQN to model a bike-sharing system. The authors used the maximum entropy method to solve the model and determine the fleet size and parking capacities needed to maintain a satisfactory service level.…”

Section: Fleet Sizing Problems Using Queueing Network Modelsmentioning

confidence: 99%

A Closed Queueing Networks Approach for an Optimal Heterogeneous Fleet Size of an Inter-Facility Bulk Material Transfer System

Amjath,

Kerbache,

Smith

2024

Logistics

View full text Add to dashboard Cite

Background: This study addresses optimising fleet size in a system with a heterogeneous truck fleet, aiming to minimise transportation costs in interfacility material transfer operations. Methods: The material transfer process is modelled using a closed queueing network (CQN) that considers heterogeneous nodes and customised service times tailored to the unique characteristics of various truck types and their transported materials. The optimisation problem is formulated as a mixed-integer nonlinear programming (MINLP), falling into the NP-Hard, making exact solution computation challenging. A numerical approximation method, a modified sequential quadratic programming (SQP) method coupled with a mean value analysis (MVA) algorithm, is employed to overcome this challenge. Validation is conducted using a discrete event simulation (DES) model. Results: The proposed analytical model tested within a steel manufacturing plant’s material transfer process. The results showed that the analytical model achieved comparable optimisation of the heterogeneous truck fleet size with significantly reduced response times compared to the simulation method. Furthermore, evaluating performance metrics, encompassing response time, utilisation rate, and cycle time, revealed minimal discrepancies between the analytical and the simulation results, approximately ±8%, ±8%, and ±7%, respectively. Conclusions: These findings affirm the presented analytical approach’s robustness in optimising interfacility material transfer operations with heterogeneous truck fleets, demonstrating real-world applications.

show abstract

Section: Fleet Sizing Problems Using Queueing Network Modelsmentioning

confidence: 99%

A Closed Queueing Networks Approach for an Optimal Heterogeneous Fleet Size of an Inter-Facility Bulk Material Transfer System

Amjath,

Kerbache,

Smith

2024

Logistics

View full text Add to dashboard Cite

show abstract

“…Sharing systems, such as bike rentals, represent an example of CQN application. For bicycle sharing systems implemented in various regions, such as the Velib program in France, optimization models are available to find the number of bicycles and charging stations (George and Xia (2011); Fan et al (2020); Chen et al (2020); Samet et al (2018)), while optimal node placement models (Mizuno et al (2016(Mizuno et al ( , 2019) are used to select appropriate nodes from a given number of bicycles and potential stations.…”

Section: Related Workmentioning

confidence: 99%

Optimal nodes placement using a closed BCMP queueing network

Mizuno

Ohba

2023

Preprint

View full text Add to dashboard Cite

In this study, a closed BCMP queueing network, which is one of the most flexible queueing models relative to customer class and multiple service types that can be selected, was used for optimal node placement. Although the closed BCMP queueing network offers flexibility, it is computationally expensive when calculating performance evaluation quantities, such as the average number of customers in a system. Thus, the application of the closed BCMP to large-scale problems is considered challenging. In this study, an optimal node placement model, which uses a genetic algorithm to select the nodes where customers are not concentrated and are appropriately distributed, was implemented using a computational engine that calculated the performance evaluation quantity of a closed BCMP queueing network in real time. Two types of objective functions were designed: a penalty type, which applied a penalty when customers were concentrated at a node, and a variance type, which minimized the standard deviation of the average number of customers to equalize the average in the system. The features of this study, including the large-scale application of the closed BCMP queueing network and optimal node placement model, find application as a general-purpose model for node allocation planning in numerous situations and have high academic significance in the application of queueing theory to the real world.

show abstract

“…In this paper, we extend the computation of CQN by applying the MVA and FES algorithms. Further, some other important examples include Zhang et al [22], Fricker et al [23], Mizuno et al [24], Calafiore et al [25], Samet et al [26], Iglesias et al [27], and Vishkaei et al [28].…”

Section: Literature Reviewmentioning

confidence: 99%

Optimization Strategies for Dockless Bike Sharing Systems via two Algorithms of Closed Queuing Networks

Fan

2020

Processes

View full text Add to dashboard Cite

The dockless bike sharing system (DBSS) has been globally adopted as a sustainable transportation system. Due to the robustness and tractability of the closed queuing network (CQN), it is a well-behaved method to model DBSSs. In this paper, we view DBSSs as CQNs and use the mean value analysis (MVA) algorithm to calculate a small size DBSS and the flow equivalent server (FES) algorithm to calculate the larger size DBSS. This is the first time that the FES algorithm is used to study the DBSS, by which the CQN can be divided into different subnetworks. A parking region and its downlink roads are viewed as a subnetwork, so the computation of CQN is reduced greatly. Based on the computation results of the two algorithms, we propose two optimization functions for determining the optimal fleet size and repositioning flow, respectively. At last, we provide numerical experiments to verify the two algorithms and illustrate the optimal fleet size and repositioning flow. This computation framework can also be used to analyze other on-demand transportation networks.

show abstract

Performance Analysis and Improvement of the Bike Sharing System Using Closed Queuing Networks with Blocking Mechanism

Cited by 12 publications

References 46 publications

A Closed Queueing Networks Approach for an Optimal Heterogeneous Fleet Size of an Inter-Facility Bulk Material Transfer System

A Closed Queueing Networks Approach for an Optimal Heterogeneous Fleet Size of an Inter-Facility Bulk Material Transfer System

Optimal nodes placement using a closed BCMP queueing network

Optimization Strategies for Dockless Bike Sharing Systems via two Algorithms of Closed Queuing Networks

Contact Info

Product

Resources

About