China
Africa
Explore chapters and articles related to this topic
Introduction
Published in Randall L. Eubank, Ana Kupresanin, Statistical Computing in C++ and R, 2011
Randall L. Eubank, Ana Kupresanin
The vector class is an implementation of a dynamic array ADT. The name deque stands for “double-ended queue”. Thus, as might be expected, objects can be inserted or removed from either end of this container. The random access that deque provides to its contents as well as other features make it a dynamic array rather than a queue in the usual first-in firstout sense of the term. The list container is a doubly-linked list class. The map container is a dictionary where the objects in the container have both a key and a data component. For map the keys must be unique while multimap allows for repeated keys. The set containers are simplified versions of map containers where objects have a single member that serves as both the key and data component.
Equilibrium and socially optimal strategies of a double-sided queueing system with two-mass point matching time
Published in Quality Technology & Quantitative Management, 2023
Zhen Wang, Cheryl Yang, Yiqiang Q. Zhao
The transferability of the airport to the arriving passengers is one of the main factors for the performance evaluation of the airport. The taxis stay in the concentrated area at the airport always with a limited capacity. This area usually has some distance from the terminal, which makes an immediate transportation for passengers not always possible. So, there is a random variable matching time between matching-passengers and taxis. As there are many means of transportation at the airport, taking a taxi is not the only choice for arriving passengers. Therefore, it is worth exploring whether the arriving passengers would join the taxi queues with a non-zero matching time. The model considered in this paper is based on observations at the John F. Kennedy International Airport (JFK) in New York City. Until now, the airport taxi pickup scenario has not been studied as a double-ended queue with non-zero matching time. Curry et al. (1978) studied an airport pickup scenario with a single-ended queue and public transport competitions. Bu et al. (2019) compared airport taxi transfer models through simulation. Conway et al. (2012) summarized the taxi structure of several airports, focusing on the centralized taxi area and scheduling program of the JFK International Airport in New York City. Anil Yazici et al. (2016) further elaborated the structure of the JFK Airport, putting forward some policy suggestions by using the method of equilibrium strategy, and analyzed the logistic regression model of taxi decision-making. It is worth noting that these models do not consider the double-sided queues between passengers and taxis. Of course, the airport pickup scenario can be extended to the case of ride-hailing apps. After receiving the order, the driver needs to drive some distance from the current locations to pick up area.
Incorporating within link dynamics in an agent-based computationally faster and scalable queue model
Published in Transportmetrica A: Transport Science, 2018
Amit Agarwal, Gregor Lämmel, Kai Nagel
Given the above-stated equivalence between KWM, double-ended queue model, and queue model with holes, the present study extends and investigates the queue model with holes for mixed traffic conditions. Going beyond the work by Agarwal, Lämmel, and Nagel (2016), this study provides information on (1) the sensitivity of the proposed model, (2) spatio-temporal plots for the proposed queue model and (3) comparison of the computational performances between different link and traffic dynamics of the queue model.