Search results

The use of queueing network models was stimulated by the appearance (1975) of the exact product form solution of a class of open, closed and mixed queueing networks obeying the local balance principle and solved, a few years later, by the popular mean value analysis algorithm (1980). Since then, research efforts have been produced to approximate solutions for non-exponential services and non-pure random mechanisms in customer processing and routing. The purpose of this paper is to examine the suitability of modeling choices and solution approaches consolidated in other domains with respect to two key logistic processes in container terminals.

In particular, the analytical solution of queueing networks is assessed for the vessel arrival-departure process and the container internal transfer process with respect to a real terminal of pure transshipment.

Numerical experiments show the extent to which a decomposition-based approximation, under fixed or state-dependent arrival rates, may be suitable for the approximate analysis of the queueing network models.

The limitation of adopting exponential service time distributions and Poisson flows is highlighted.

Comparisons with a simulation-based solution deliver numerical evidence on the companion use of simulation in the daily practice of managing operations in a finite-time horizon under complex policies.

Discussion of some open modeling issues and encouraging results provide some guidelines on future research efforts and/or suitable adaption to container terminal logistics of the large body of techniques and algorithms available nowadays for supporting long-run decisions.

An integrated queueing network focused on container storage/retrieval operations occurring on the yard of a transshipment hub is proposed. The purpose of the network is to support decisions related to the organization of the yard area, while also accounting for operations policies and times on the quay.

A discrete-event simulation model is used to reproduce container handling on both the quay and yard areas, along with the transfer operations between the two. The resulting times, properly estimated by the simulation output, are fed to a simpler queueing network amenable to solution via algorithms based on mean value analysis (MVA) for product-form networks.

Numerical results justify the proposed approach for getting a fast, yet accurate analytical solution that allows carrying out performance evaluation with respect to both organizational policies and operations management on the yard area.

Practically, the expected performance measures on the yard subsystem can be obtained avoiding additional time-expensive simulation experiments on the entire detailed model.

As a major takeaway, deepening the MVA for generally distributed service times has proven to produce reliable estimations on expected values for both user- and system-oriented performance metrics.

This paper evaluates an alternative queuing concept for marine container terminals that utilize a truck appointment system (TAS). Instead of having all lanes providing service to trucks with appointments, this study considers the case where walk-in lanes are provided to serve those trucks with no appointments or trucks with appointments but arrived late due to traffic congestion.

To enable the analysis of the proposed alternative queuing strategy, the queuing system is shown mathematically to be stationary. Due to the complexity of the model, a discrete event simulation (DES) model is used to obtain the average waiting number of trucks per lane for both types of service lanes: TAS-lanes and walk-in lanes.

The numerical experiment results indicated that the considered queuing strategy is most beneficial when the utilization of the TAS lanes is expected to be much higher than that of the walk-in lanes.

The novelty of this study is that it examines the scenario where trucks with appointments switch to the walk-in lanes upon arrival if the TAS-lane server is occupied and the walk-in lane server is not occupied. This queuing strategy/policy could reduce the average waiting time of trucks at marine container terminals. Approximation equations are provided to assist practitioners calculate the average truck queue length and the average truck queuing time for this type of queuing system.

Truck appointment systems have been applied in critical container ports in the United States due to their potential to improve handling operations. This paper aims to develop a truck appointment system to optimise the total cost experiencing at the entrance of container terminals by managing truck arrivals and the number of service gates satisfying a given level of service.

The approximation of M_t/G/n_t queuing model is applied and integrated into a cost optimisation model to identify (1) the number of arrival trucks allowed at each time slot and (2) the number of service gates operating at each time slot that ensure the average waiting time is less than a designated time threshold. The optimisation model is solved by the Genetic Algorithm and tested with a case study. Its effectiveness is identified by comparing the model's outcomes with observed data and other recent studies.

The results indicate that the developed truck appointment system can provide more than threefold and twofold reductions of the total cost experiencing at the terminal entrance compared to the actual data and results from previous research, respectively.

The proposed approach provides applicably coordinated truck plans and operating service gates efficiently to decrease congestion, emission and expenses.

Due to the conflicts between left turn traffic and opposite straight-going traffic in urban traffic network, some of the traffic lanes cannot be used to discharge vehicles during its green phases and the intersection capacity can be greatly reduced. This study/paper aims to reduce the effect of conflicts and increase its capacity through the reasonable pre-signal phase time with the exchangeable lanes.

This paper took into consideration various influence factors to intersection capacity and formulated the capacity optimization model based on 0-1 mixed-integer programming model. This model is efficiently solved by standard branch-and-bound algorithms.

The authors took an intersection as an example and solved the optimal signal timing and entrance lane capacity via this model. Then, simulations were carried out to verify the effect of the exchangeable lanes strategy of this intersection through the simulation software VISSIM and take the traffic volume and delay as outputs, which indicated that this model has better performance.

The front-end control strategy can not only exploit the full potential of the intersection but also significantly improve the operational efficiency of the intersection. It plays a positive role in improving urban intersection congestion.

As of December 2022, there were 119,000 gas stations, 10,800 gas stations and 4,488,000 charging piles nationwide, while the number of vehicles reached 312 million, including 11.49 million new energy vehicles. The imbalance between transportation energy supply and energy replenishment demand leads to crowded queues of vehicles at some stations and idle resources in others. How to reduce the phenomenon of large queues and improve the utilization rate of idle resources is the key to alleviating the imbalance between supply and demand.

Therefore, from the perspective of spatio-temporal equilibrium of urban transportation energy supply stations, multi-energy supply station cooperation is established in view of the phenomenon of large spatio-temporal differences among different energy supply stations, and corresponding inducing strategies are adopted for energy supplement vehicles in the road network, so that part of queued users go to energy supply stations with fewer vehicles, so as to balance the supply and demand of transportation energy in the region. On this basis, the income distribution of urban transportation energy supply station is discussed.

The total revenue after the cooperation was 13,095, an increase of 22.9%. Secondly, in terms of distribution rationality, three impact factors are selected and Shapley correction value is used to distribute the total income. Compared with independent operation, both sites have a certain degree of increase.

Traffic congestion at energy supply stations is closely related to the number, location and number of vehicles at energy supply stations. Therefore, using a cooperative approach of energy trading cannot solve the queuing problem. In addition, there are a few research results on the equalization of energy supply station services considering time-of-use pricing. However, these studies do not consider the vehicular grooming at congested stations. As far as the authors know, there are no relevant research results in the research on the service equilibrium of energy supply stations based on cooperative games.

The purpose of this paper is to develop a framework to evaluate and assess the performance of the COVID-19 vaccine distribution process that is sensitive to the unique supply-side and demand-side constraints exhibited in the US vaccine rollout.

A queuing framework that operates under two distinct regimes is formulated to analyze service rates that represent system capacity to vaccinate (under the first regime) and hesitancy-induced throughput (under the second regime). These supply- and hesitancy-constrained regimes form the focus of the present paper, as the former reflects the inherent ability of the nation in its various jurisdictions to mobilize, whereas the latter reflects a critical area for public policy to protect the population’s overall health and safety.

The two-regime framework analysis provides insights into the capacity to vaccinate and hesitancy-constrained demand, which is found to vary across the country primarily by politics and region. The framework also allows analysis of the end-to-end supply chain, where it is found that the ability to vaccinate was likely constrained by last-mile administration issues, rather than the capacity of the manufacturing and transportation steps of the supply chain.

This study presents a new framework to consider end-to-end supply chains as dynamic systems that exhibit different regimes because of unique supply- and demand-side characteristics and estimate rollout capacity and underlying determinants at the national, state and county levels.

This research studies a location-allocation problem considering the m/m/m/k queue model in the blood supply chain network. This supply chain includes three levels of suppliers or donors, main blood centers (laboratories for separation, storage and distribution centers) and demand centers (hospitals and private clinics). Moreover, the proposed model is a multi-objective model including minimizing the total cost of the blood supply chain (the cost of unmet demand and inventory spoilage, the cost of transport between collection centers and the main centers of blood), minimizing the waiting time of donors in blood donating mobile centers, and minimizing the establishment of mobile centers in potential places.

Since the problem is multi-objective and NP-Hard, the heuristic algorithm NSGA-II is proposed for Pareto solutions and then the estimation of the parameters of the algorithm is described using the design of experiments. According to the review of the previous research, there are a few pieces of research in the blood supply chain in the field of design queue models and there were few works that tried to use these concepts for designing the blood supply chain networks. Also, in former research, the uncertainty in the number of donors, and also the importance of blood donors has not been considered.

A novel mathematical model guided by the theory of linear programming has been proposed that can help health-care administrators in optimizing the blood supply chain networks.

By building upon solid literature and theory, the current study proposes a novel model for improving the supply chain of blood.

Avoiding truck congestion and peaks in landside activity is one of the challenges to container terminal managers. The spreading of truck arrivals at terminals can be facilitated by widening the opening hours of terminals at the landside. Israel’s Ministry of Transport has instituted the “Good Night Program”, involving monetary incentives for importers and exporters who deliver containers to ports at night.

This paper aims to quantitatively examine the market utility resulting from shifting traffic from daytime to nighttime, and analyzes customer considerations regarding nighttime transportation.

The external utility found in the traffic-economics model is quite similar to the economic incentive given to customers. Therefore, a significant increase of the incentive is not feasible.

Furthermore, it seems that an incentive method by itself is not effective enough, and does not motivate customers to act and find creative solutions to the obstacles they face. To achieve a considerable change in nighttime transport to Israeli ports, more effective methods should be examined.

This paper considers locating congested fast charging stations (FCSs) and deploying chargers in a stochastic environment, while the related studies have predominantly focused on problems in deterministic environments. Reducing the inconvenience caused by congestion at FCSs is an important challenge for FCS service provider. This is the underlying motivation for this study to consider a problem for FCS network design with the congestion restriction in a stochastic environment. We proposed a maximal coverage problem subject to budget constraints and a congestion restriction in order to maximize the demand coverage. With the derivation of the congestion restriction in the considered stochastic environment, the problem is formulated into an integer programming model. A real-life case study is conducted and managerial implications are drawn from its results.