Academic literature on the topic 'Stochastic matching models'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Stochastic matching models.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Stochastic matching models":
1
Dewilde, Patrick. "Stochastic models based on moment matching." Communications in Information and Systems 20, no. 2 (2020): 209–48. http://dx.doi.org/10.4310/cis.2020.v20.n2.a5.
2
Hu, Lin Y., and Sandra Jenni. "History Matching of Object-Based Stochastic Reservoir Models." SPE Journal 10, no. 03 (September 1, 2005): 312–23. http://dx.doi.org/10.2118/81503-pa.
3
Mairesse, Jean, and Pascal Moyal. "Editorial introduction to the special issue on stochastic matching models, matching queues and applications." Queueing Systems 96, no. 3-4 (December 2020): 357–58. http://dx.doi.org/10.1007/s11134-021-09690-2.
4
Comte, Céline. "Stochastic non-bipartite matching models and order-independent loss queues." Stochastic Models 38, no. 1 (October 10, 2021): 1–36. http://dx.doi.org/10.1080/15326349.2021.1962352.
5
Iwata, Tomoharu, Tsutomu Hirao, and Naonori Ueda. "Unsupervised Cluster Matching via Probabilistic Latent Variable Models." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 30, 2013): 445–51. http://dx.doi.org/10.1609/aaai.v27i1.8558.
Abstract:
We propose a probabilistic latent variable model for unsupervised cluster matching, which is the task of finding correspondences between clusters of objects in different domains. Existing object matching methods find one-to-one matching. The proposed model finds many-to-many matching, and can handle multiple domains with different numbers of objects. The proposed model assumes that there are an infinite number of latent vectors that are shared by all domains, and that each object is generated using one of the latent vectors and a domain-specific linear projection. By inferring a latent vector to be used for generating each object, objects in different domains are clustered in shared groups, and thus we can find matching between clusters in an unsupervised manner. We present efficient inference procedures for the proposed model based on a stochastic EM algorithm. The effectiveness of the proposed model is demonstrated with experiments using synthetic and real data sets.
6
Pankov, Vikentii, and Oleg Granichin. "SPSA Algorithm for Matching of Historical Data for Complex Non-Gaussian Geological Models." Cybernetics and Physics, Volume 11, 2022, Number 1 (June 2, 2022): 18–24. http://dx.doi.org/10.35470/2226-4116-2022-11-1-18-24.
Abstract:
History matching is the process of integrating dynamic production data in the reservoir model. It consists in estimation of uncertain model parameters such that oil or water production data from flow simulation become close to observed dynamic data. Various optimization methods can be used to estimate the model parameters. Simultaneous perturbation stochastic approximation (SPSA) is one of the stochastic approximation algorithms. It requires only two objective function measurements for gradient approximation per iteration. Also parameters estimated by this algorithm might converge to their true values under arbitrary bounded additive noise, while many other optimization algorithms require the noise to have zero mean. SPSA algorithm has not been well explored for history matching problems and has been applied only to simple Gaussian models. In this paper, we applied SPSA to history matching of binary channelized reservoir models. We also used SPSA in combination with parameterization method CNN-PCA. And we considered the case of complex noise in observed production data and with objective function that does not require assumptions of normality of the observations, which is common in history matching literature. We experimentally showed that SPSA method can be successfully used for history matching of non-Gaussian geological models with different types of noise in observations and outperforms Particle Swarm Optimization by convergence speed.
7
Zhou, Deng Rong, Jian Chun Gong, and Fang Ling Fan. "A Stochastic Resonance Phenomenon in Linear Models." Applied Mechanics and Materials 401-403 (September 2013): 1301–4. http://dx.doi.org/10.4028/www.scientific.net/amm.401-403.1301.
Abstract:
When there exist certain kinds of matching in an electric system between the nonlinear input and noise, amplifying the input noise may dramatically increase the output SNR other than decrease it. And stochastic resonance is a phenomenon that when noise is input at certain amplitude the output SNR reaches its peak. Generalized stochastic resonance is the kind of nonlinear phenomena that the output (output SNR, output mean value, etc.) is a non-monotonic function of some parameter of noise (amplitude, correlation time) or input (amplitude, frequency). We studied the phenomenon of stochastic resonance in linear models with random parameters. And we discovered that the output amplitude is a non-monotonic function of the noise amplitude, the noise correlation time and the system parameters. The result will be a helpful complement to both the traditional linear system theory and the analysis of RL circuit.
8
Meszáros, András, János Papp, and Miklós Telek. "Fitting traffic traces with discrete canonical phase type distributions and Markov arrival processes." International Journal of Applied Mathematics and Computer Science 24, no. 3 (September 1, 2014): 453–70. http://dx.doi.org/10.2478/amcs-2014-0034.
Abstract:
Abstract Recent developments of matrix analytic methods make phase type distributions (PHs) and Markov Arrival Processes (MAPs) promising stochastic model candidates for capturing traffic trace behaviour and for efficient usage in queueing analysis. After introducing basics of these sets of stochastic models, the paper discusses the following subjects in detail: (i) PHs and MAPs have different representations. For efficient use of these models, sparse (defined by a minimal number of parameters) and unique representations of discrete time PHs and MAPs are needed, which are commonly referred to as canonical representations. The paper presents new results on the canonical representation of discrete PHs and MAPs. (ii) The canonical representation allows a direct mapping between experimental moments and the stochastic models, referred to as moment matching. Explicit procedures are provided for this mapping. (iii) Moment matching is not always the best way to model the behavior of traffic traces. Model fitting based on appropriately chosen distance measures might result in better performing stochastic models. We also demonstrate the efficiency of fitting procedures with experimental results
9
Tsioulou, Alexandra, Alexandros A. Taflanidis, and Carmine Galasso. "Modification of stochastic ground motion models for matching target intensity measures." Earthquake Engineering & Structural Dynamics 47, no. 1 (July 9, 2017): 3–24. http://dx.doi.org/10.1002/eqe.2933.
10
Brignone, Riccardo, Ioannis Kyriakou, and Gianluca Fusai. "Moment-matching approximations for stochastic sums in non-Gaussian Ornstein–Uhlenbeck models." Insurance: Mathematics and Economics 96 (January 2021): 232–47. http://dx.doi.org/10.1016/j.insmatheco.2020.12.002.
Dissertations / Theses on the topic "Stochastic matching models":
1
Tsao, Yu. "An ensemble speaker and speaking environment modeling approach to robust speech recognition." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26540.
Abstract:
Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2009.Committee Chair: Lee, Chin-Hui; Committee Member: Anthony Joseph Yezzi; Committee Member: Biing-Hwang (Fred) Juang; Committee Member: Mark Clements; Committee Member: Ming Yuan. Part of the SMARTech Electronic Thesis and Dissertation Collection.
2
Rahme, Youssef. "Stochastic matching model on the general graphical structures." Thesis, Compiègne, 2021. http://www.theses.fr/2021COMP2604.
Abstract:
Motivé par des applications à large éventail des systèmes d’assemblage à la commande et des systèmes de l’économie collaborative, nous introduisons un modèle d’appariement aléatoire sur les hypergraphes et sur les multigraphes, étendant le modèle par Mairesse et Moyal 2016. Dans cette thèse, le modèle d’appariement aléatoire sur les structures graphiques générales est défini comme suit : étant donné une structure graphique générale de compatibilité S = (V; S) qui est constituée d’un ensemble de nœuds noté par V qui représentent les classes d’éléments et par un ensemble d’arêtes noté par S qui permettent d’apparier entre les différentes classes. Les éléments arrivent au système à un moment aléatoire, par une séquence (supposée être i:i:d:) constituée de différentes classes de V; et demandent d’être appariés selon leur compatibilité dans S: La compatibilité par groupe de deux ou plus (cas hypergraphique) et par groupe de deux avec les possibilités d’apparier entre les éléments de même classe (cas multigraphique). Les éléments, qui ne sont pas appariés, sont stockés dans le système et en attente d’un futur élément compatible et dès qu’ils sont appariés, ils quittent le système ensemble. À l’arrivée, un élément peut trouver plusieurs d’appariements possibles, les éléments qui quittent le système dépendent d’une politique d’appariement Ø à spécifier. Nous étudions la stabilité du modèle d’appariement aléatoire sur l’hypergraphe, pour des différentes topologies hypergraphiques puis, la stabilité du modèle d’appariement aléatoire sur les multigraphes en utilisant son sous-graphe maximal et sur-graphe minimal étendu pour distinguer la zone de stabilitéMotivated by a wide range of assemble-to-order systems and systems of the collaborativeeconomy applications, we introduce a stochastic matching model on hypergraphs and multigraphs, extending the model introduced by Mairesse and Moyal 2016. In this thesis, the stochastic matching model on general graph structures are defined as follows: given a compatibility general graph structure S = (V; S) which of a set of nodes denoted by V that represent the classes of items and by a set of edges denoted by S that allows matching between different classes of items. Items arrive at the system at a random time, by a sequence (assumed to be i:i:d:) that consists of different classes of V; and request to be matched due to their compatibility according to S: The compatibility by groups of two or more (hypergraphical cases) and by groups of two with possibilities of matching between the items of the same classes (multigraphical cases). The unmatched items are stored in the system and wait for a future compatible item and as soon as they are matched they leave it together. Upon arrival, an item may find several possible matches, the items that leave the system depend on a matching policy _ to be specified. We study the stability of the stochastic matching model on hypergraphs, for different hypergraphical topologies. Then, the stability of the stochastic matching model on multigraphs using the maximal subgraph and minimal blow-up to distinguish the zone of stability
3
Begeot, Jocelyn. "Autour de la stabilité de différents modèles d'appariements aléatoires." Electronic Thesis or Diss., Université de Lorraine, 2022. http://www.theses.fr/2022LORR0201.
Abstract:
Les modèles d'appariements aléatoires représentent de nombreux systèmes stochastiques concrets dans lesquels des éléments de différentes classes sont appariés selon des règles de compatibilités spécifiées. Par exemple, on peut citer les systèmes dédiés à l'allocation d'organes, les sites de recherche d'emplois, de logements, etc. De tels modèles sont toujours associés à un triptyque d'éléments : un graphe connexe, dit de compatibilités, dont les sommets représentent les classes des éléments pouvant entrer dans le systèmeet dont chaque arête relie deux classes compatibles, une politique d'appariements permettant de décider, en cas d'incertitude, quels appariements vont s'effectuer à l'intérieur du système, et un taux d'arrivées selon lequel les éléments entrent en son sein. Dans cette thèse, nous considérons des graphes généralisés, c'est-à-dire que l'on autorise l'appariement de deux éléments de la même classe, et nous étendons donc à ce cadre certains résultats déjà connus dans le cas de graphes simples. La stabilité d'un système régi par un modèle d'appariements est une propriété très importante. En effet, elle assure que les admissions au sein du système étudié sont contrôlées de sorte que les éléments ne restent pas bloqués à l'intérieur et que leur nombre n'augmente pas indéfiniment. Il est donc essentiel que le taux d'arrivées des éléments permette au système d'être stable. Dans ce manuscrit, nous caractérisons de manière algébrique cette zone de stabilité pour certains modèles d'appariements (généraux, généraux avec abandons, bipartis, bipartis étendus) ou de files d'attente, dites skill-based. Par ailleurs, nous démontrons que la politique d'appariements dite First Come, First Matched (FCFM) possède la propriété d'être maximale (généralisée), c'est-à-dire que la zone de stabilité du modèle d'appariements général associé à un graphe de compatibilités et à une politique quelconque est toujours incluse dans celle associée à ce même graphe et à FCFM. Notons que cette dernière coïncide alors avec un ensemble de mesures défini par des conditions purement algébriques. Dans ce cas, la question de l'étude des mesures permettant la stabilité des systèmes régis par un modèle d'appariements revient donc à celle, plus élémentaire, de la caractérisation d'un ensemble déterministe. Nous donnons alors un moyen de construction (simple) des mesures appartenant à celui-ci, ce qui peut s'avérer très utile pour calibrer le contrôle d'accès au système. En effet, la vérification algorithmique qu'une mesure quelconque vérifie ces conditions algébriques nécessite un nombre d'opérations polynomial en le nombre de sommets du graphe, et devient donc très coûteuse à mesure que ce cardinal augmente. Nous explicitons également, sous une forme produit, l'expression de la loi stationnaire de l'évolution temporelle du contenu d'un système stable régi par un modèle d'appariements général et sous la politique FCFM, permettant, notamment, de calculer explicitement des caractéristiques à l'équilibre de systèmes concrets et d'estimer leurs performances en temps long. On peut ainsi, par exemple, calculer la taille moyenne à l'équilibre d'une liste d'attente dans le cadre de dons croisés de reins, ou encore, estimer le temps moyen d'attente sur une interface pair-à-pair ou un site de rencontres.Enfin, les taux d'appariements associés à un modèle d'appariements (général ou biparti étendu) stable sont étudiés. Ils sont définis comme étant les fréquences asymptotiques des appariements réalisés et fournissent un critère de performance des systèmes régis par de tels modèles d'appariements, de même que les propriétés de politique-insensibilité et d'équité de ces taux, qui sont également discutéesStochastic matching models represent many concrete stochastic systems in which elements of different classes are matched according to specified compatibility rules. For example, we can cite systems dedicated to organs allocation, job search sites, housing allocation programs, etc. Such models are typically associated to a triplet of elements: a connected graph, called compatibility graph, whose vertices represent the classes of elements that can enter the system and whose edges connect two compatible classes, amatching policy which decides the matches to be concretely executed, in case of multiple choices, and an arrival rate according to which the elements enter within it. In this thesis, we consider generalized graphs, meaning that we allow the matching of two elements of the same class, and we therefore extend to this framework some results already known in the case of simple graphs.The stability of a system governed by a matching model is a very important property. It ensures that the admissions within the system under study, are regulated, so that the elements do not accumulate in the system in the long run. It is therefore essential that the arrival rate of the elements allows the system to be stable. In this manuscript, we characterize, algebraically, this stability region for some matching models (general, general with reneging, bipartite, extended bipartite) or skill-based queueing systems.Moreover, we demonstrate that the matching policy called First Come, First Matched (FCFM) has the property of being (generalized) maximal, meaning that the stability region of the general matching model associated with a compatibility graph and with any policy is always included in the one associated with this same graph and ruled by FCFM. Note that this latter then coincides with a set of measures defined by purely algebraic conditions. In this case, the study of stability of the matching model at hand boils down to the more elementary question of characterizing of a deterministic set of measures. We then givea (simple) way to construct the measures belonging to the latter set. This turns out to be very useful for admission control, as checking the algebraic conditions requires a number of operations which is polynomial in the number of vertices of the considered compatibility graph, and therefore becomes very expensive as the number of vertices grows large.We also give, in a product form, the expression of the stationary distribution of the number-in-system process of a stable system governed by a general matching model and under the FCFM policy, allowing, in particular, to explicitly calculate characteristics at equilibrium of concrete systems and to estimate their long-time performance. We can thus, for example, calculate the size average at equilibrium of a waiting list in the case of cross-donation of kidneys, or even, estimate the average waiting time on a peer-to-peerinterface or on a dating website.Finally, the matching rates associated with a stable matching model (general or extended bipartite) are studied. They are defined as the asymptotic frequencies of the executed respective matchings, and provide an insightful performance criterion for the corresponding matching systems, as well as the policy-insensitivity and fairness properties of the matching rates, which are also discussed
4
Aliou, Diallo Aoudi Mohamed Habib. "Local matching algorithms on the configuration model." Electronic Thesis or Diss., Compiègne, 2023. http://www.theses.fr/2023COMP2742.
Abstract:
Nous proposons une alternative à l’approche prévalente dans les algorithmes de mariage en ligne. Basés sur le choix d’un critère de mariage, nous construisons des algorithmes dits locaux. Ces algorithmes sont locaux dans le sens où chacun des individus est tour à tour soumis au critère de mariage choisi. Ce qui nous amène à démontrer que le nombre de sommets qui finissent mariés lorsque chaque individu adopte une stratégie prédéfinie est solution d’une équation différentielle ordinaire. Grâce à cette approche nous prédisons les performances et comparons deux algorithmes/stratégies. Pour émuler l'asymptotique des graphes, nous utilisons le modèle de configuration basé sur un échantillonnage de la distribution de degré du graphe d'intérêt. Et globalement notre méthode peut être vue comme une généralisation de la Differential Equation Method de Wormald. Il est à noter que l’approche en ligne se concentre principalement sur les graphes bipartisThe present thesis constructs an alternative framework to online matching algorithms on large graphs. Using the configuration model to mimic the degree distributions of large networks, we are able to build algorithms based on local matching policies for nodes. Thus, we are allowed to predict and approximate the performances of a class of matching policies given the degree distributions of the initial network. Towards this goal, we use a generalization of the differential equation method to measure valued processes. Through-out the text, we provide simulations and a comparison to the seminal work of Karp, Vazirani and Vazirani based on the prevailing viewpoint in online bipartite matching
5
Fu, Jianlin. "A markov chain monte carlo method for inverse stochastic modeling and uncertainty assessment." Doctoral thesis, Universitat Politècnica de València, 2008. http://hdl.handle.net/10251/1969.
Abstract:
Unlike the traditional two-stage methods, a conditional and inverse-conditional simulation approach may directly generate independent, identically distributed realizations to honor both static data and state data in one step. The Markov chain Monte Carlo (McMC) method was proved a powerful tool to perform such type of stochastic simulation. One of the main advantages of the McMC over the traditional sensitivity-based optimization methods to inverse problems is its power, flexibility and well-posedness in incorporating observation data from different sources. In this work, an improved version of the McMC method is presented to perform the stochastic simulation of reservoirs and aquifers in the framework of multi-Gaussian geostatistics.
First, a blocking scheme is proposed to overcome the limitations of the classic single-component Metropolis-Hastings-type McMC. One of the main characteristics of the blocking McMC (BMcMC) scheme is that, depending on the inconsistence between the prior model and the reality, it can preserve the prior spatial structure and statistics as users specified. At the same time, it improves the mixing of the Markov chain and hence enhances the computational efficiency of the McMC. Furthermore, the exploration ability and the mixing speed of McMC are efficiently improved by coupling the multiscale proposals, i.e., the coupled multiscale McMC method. In order to make the BMcMC method capable of dealing with the high-dimensional cases, a multi-scale scheme is introduced to accelerate the computation of the likelihood which greatly improves the computational efficiency of the McMC due to the fact that most of the computational efforts are spent on the forward simulations. To this end, a flexible-grid full-tensor finite-difference simulator, which is widely compatible with the outputs from various upscaling subroutines, is developed to solve the flow equations and a constant-displacement random-walk
particle-tracking method, which enhances the comFu, J. (2008). A markov chain monte carlo method for inverse stochastic modeling and uncertainty assessment [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/1969
Palancia
6
Maman, Waziri Khalid. "A stochastic earnings frontier approach to investigating labour market failures." Thesis, Aix-Marseille, 2018. http://www.theses.fr/2018AIXM0164/document.
Abstract:
Cette thèse de doctorat examine les principales défaillances du marché du travail qui entraînent que les travailleurs n’arrivent pas à obtenir la pleine rémunération potentielle qui corresponde à leur capital humain. Il y a « inefficacité salariale » lorsque le salaire obtenu est inférieur au maximum atteignable. Dans un tel cas, les salariés reçoivent un salaire injuste par rapport au capital humain disposé. Cela décourage à investir dans son capital humain ce qui aura tendance à réduire la productivité totale, à affaiblir la compétitivité et à nuire à la croissance économique du pays. La contribution que nous apportons à travers ce travail est de trois ordres. Dans un premier temps, nous proposons un nouveau regard par rapport à l’intégration des jeunes sur le marché du travail. Plutôt que d’examiner si les individus obtiennent un contrat de travail stable ou non, nous adoptons une approche qui s’intéresse à la qualité de l’appariement « emploi – compétences » de jeunes entrant fraîchement dans la vie active. Nos travaux fournissent des résultats empiriques qui mettent en évidence les différentes théories de recherche d’emploi. Dans un second temps, en raison du considérable défi que représente l'identification et l'évaluation des pratiques discriminatoires sur le marché du travail, nous proposons une approche innovatrice et efficace pour examiner le phénomène du plafond de verre (barrière invisible à l’accès des postes de décision mieux rémunérés). Dans la dernière partie de cette thèse, nous proposons un modèle économétrique théorique qui améliore la correction du problème de biais de sélection pour les modèles de frontière stochastiqueThis doctoral thesis addresses issues related to employees’ imperfect information on the labour market and discrimination, generally all direct consequences of labour underpayment or “earnings inefficiency”. Workers are in a situation of earnings inefficiency when they do not receive the full potential remuneration corresponding to their human capital endowment: unfair pay for greater stock of human capital. This situation is problematic from a policy-makers point of view as it could weaken work incentives, discourage investments in human capital, and harm economic growth and competitiveness. It could also widen inequality within the society and contribute to the increase in relative poverty.The contribution we make through this work is threefold. First, we examine the integration of young people into the labour market from a new angle. Instead of examining whether individuals obtain stable employment or not, we use an approach that focuses on the quality of the job matching for young people entering the workforce and lacking labour market information. This first chapter provides empirical evidence on job search theories. In a second chapter, because of the considerable challenge of identifying and assessing discriminatory practices in the labour market, we propose an innovative and effective approach to examine the phenomenon of the glass ceiling (an invisible barrier to management positions associated with higher earnings). Finally, the last part of this doctoral thesis is devoted to improving the econometric approach we use. We propose a theoretical econometric model that improves correction for sample selection bias with stochastic frontier models
7
Chang, Sheng-chieh, and 張聲傑. "A Carpool Matching Model and Solution Algorithms under Stochastic Travel Times." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/80065308173483617182.
Abstract:
碩士國立中央大學
土木工程研究所
98
Respecting traffic volume has significantly grown and private cars become more popular than before in Taiwan. Therefore, carpool that enhances the car occupancy rate can not only relieve traffic congestion, but also reduce the travel cost which comes from the price of global petroleum going up, even save energy. As regards in Taiwan, carpool matching is manually performed by planning personnels with experience in current practice, without a systematic analysis. Such a manual approach is considered to be inefficient and ineffective. In other words, stochastic disturbances arising from variations in car travel times in actual operations are neglected. In the worst scenario, where car travel times fluctuate wildly during operations, the planned schedule could be disturbed enough to lose its optimality. Therefore, focusing on many-to-many origin-destination (OD), we constructed a stochastic carpool matching model that considers the influence of stochastic travel times. The matching model is expected to be an effective tool for the planner to solve carpool members matching. We employed network flow techniques to construct the stochastic carpool matching model, including multiple CVG (a carpool member group who can provide a vehicle) vehicle-flow networks, CVG passenger-flow networks and multiple CNG (a carpool member group who cannot provide any vehicle) passenger-flow networks to formulate the flows of CVGs and CNGs in the dimensions of time and space. Then, we modified the stochastic travel times in the stochastic carpool matching model as an average travel time to develop a deterministic scheduling model. The two models are formulated as special integer multiple commodity network flow problems, which are characterized as NP-hard. Since the problem sizes are expected to be huge in real practice, the models are difficult to be solved in a reasonable time. Therefore, we also developed a heuristic algorithm for efficiently solving matching problems. In addition, to evaluate the stochastic and deterministic carpool matching models, we also developed a simulation-based evaluation method. The performance of the solution method in practice is evaluated by carrying out a case study using real data and suitable assumptions, and then sensitive analysis is performed for different parameters. The test results show the model to be good and that the solution method could be useful in practice.
8
Wu, Yi-siang, and 吳逸祥. "An Integrated Model and Solution Algorithms for Taxipool and Passenger Matching Problems under Stochastic Travel Times." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/34047263389215135662.
Abstract:
碩士國立中央大學
土木工程研究所
97
As the Taiwan urban areas’ traffic volume grew significantly, taxi becomes more popular than before in Taiwan. The low loading factor and use rate become an annoying problem, which should be resolved immediately. The taxipool plan can not only improve its operational performance, but can also relieve the traffic congestion problem. However, most taxi carriers currently use a trial-and-error process, in accordance with the projected taxi travel times, for taxipool matching, which is neither effective nor efficient. In other words, stochastic disturbances arising from variations in taxi travel times in actual operations are neglected. In the worst scenario, where taxi travel times fluctuate wildly during operations, the planned schedule could be disturbed enough to lose its optimality. Therefore, focusing on multiple origin-destination (OD) with advanced-order passenger trips, we constructed a stochastic taxipool matching model that considers the influence of stochastic travel times. The matching model is expected to be an effective tool for the planner to solve passenger matching and fleet scheduling. We employed network flow techniques to construct the stochastic taxipool matching model, including fleet-flow and passenger-flow networks. Then, we modified the stochastic travel times in the stochastic taxipool matching model as an average travel time to develop a deterministic scheduling model. The two models are formulated as special integer multiple commodity network flow problems, which are characterized as NP-hard. Since the problem sizes are expected to be huge in real practice, the models are difficult to be solved in a reasonable time. Therefore, we also developed a heuristic algorithm for efficiently solving passenger matching and fleet scheduling problems. In addition, to evaluate the stochastic and deterministic taxipool matching models, we also developed a simulation-based evaluation method. The performance of the solution method in practice is evaluated by carrying out a case study using real data and suitable assumptions, and then sensitive analysis is performed for different parameters. The test results show the model to be good and that the solution method could be useful in practice.
Book chapters on the topic "Stochastic matching models":
1
Comte, Céline, and Jan-Pieter Dorsman. "Performance Evaluation of Stochastic Bipartite Matching Models." In Lecture Notes in Computer Science, 425–40. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-91825-5_26.
2
Busic, A., and J. M. Fourneau. "Stochastic Matching Model with Returning Items." In Computer Performance Engineering and Stochastic Modelling, 186–200. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43185-2_13.
3
Nakamura, Naoto, Shigeru Takano, and Yoshihiro Okada. "3D Model Search Using Stochastic Attributed Relational Tree Matching." In Lecture Notes in Computer Science, 348–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17829-0_33.
4
Liang, Xue, and Yujuan Wu. "Sensitivity Analysis and Stochastic History Matching of Shale Gas Production Based on Embedded Discrete Fracture Model." In Proceedings of the International Field Exploration and Development Conference 2018, 422–38. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-7127-1_39.
5
Goeree, Jacob K., Charles A. Holt, and Thomas R. Palfrey. "Quantal Response Equilibrium in Normal-Form Games." In Quantal Response Equilibrium. Princeton University Press, 2016. http://dx.doi.org/10.23943/princeton/9780691124230.003.0002.
Abstract:
This chapter lays out the general theory of quantal response equilibrium (QRE) for normal-form games. It starts with the reduced-form approach to QR, based on the direct specification of “regular” quantal or smoothed best-response functions required to satisfy four intuitive axioms of stochastic choice. A simple asymmetric matching pennies game is used to illustrate these ideas and show that QRE imposes strong restrictions on the data, even without parametric assumptions on the quantal response functions. Particular attention is given to the logit QRE, since it is the most commonly used approach taken when QRE is applied to experimental or other data. The discussion includes the topological and limiting properties of logit QRE and connections with refinement concepts. QRE is also related to several other equilibrium models of imperfectly rational behavior in games, including a game-theoretic equilibrium version of Luce's (1959) model of individual choice, Rosenthal's (1989) linear response model, and Van Damme's (1987) control cost model; these connections are explained in the chapter.
Conference papers on the topic "Stochastic matching models":
1
Hu, Lin Y. "History Matching of Object-Based Stochastic Reservoir Models." In Middle East Oil Show. Society of Petroleum Engineers, 2003. http://dx.doi.org/10.2118/81503-ms.
2
Schaaf, T., and B. Coureaud. "Joint Structural and Petrophysical History Matching of Stochastic Reservoir Models." In IOR 2009 - 15th European Symposium on Improved Oil Recovery. European Association of Geoscientists & Engineers, 2009. http://dx.doi.org/10.3997/2214-4609.201404830.
3
Stephen, K. D., and S. Arwini. "Improving Stochastic Inversion Methods in History Matching Using Proxy Models." In 12th European Conference on the Mathematics of Oil Recovery. Netherlands: EAGE Publications BV, 2010. http://dx.doi.org/10.3997/2214-4609.20145008.
4
Yang, Joonhyuk, and Hye Won Chung. "Graph Matching in Correlated Stochastic Block Models for Improved Graph Clustering." In 2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2023. http://dx.doi.org/10.1109/allerton58177.2023.10313461.
5
Schaaf, Thomas, Bertrand Coureaud, and Francois Louis Labaune. "Joint Structural and Petrophysical History Matching Leads to Global Geological Stochastic Reservoir Models." In EUROPEC/EAGE Conference and Exhibition. Society of Petroleum Engineers, 2009. http://dx.doi.org/10.2118/121899-ms.
6
Jenni, Sandra, Lin Y. Hu, Remy Basquet, Ghislain de Marsily, and Bernard Bourbiaux. "History Matching of Stochastic Models of Field-Scale Fractures: Methodology and Case Study." In SPE Annual Technical Conference and Exhibition. Society of Petroleum Engineers, 2004. http://dx.doi.org/10.2118/90020-ms.
7
Ezra, Tomer, Michal Feldman, Nick Gravin, and Zhihao Gavin Tang. "Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models." In EC '20: The 21st ACM Conference on Economics and Computation. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3391403.3399513.
8
Hollenbeck, Derek, and YangQuan Chen. "Digital Twin Behavior Matching of Gas Plumes Using a Fixed Sensor Mesh and Dynamic Mode Decomposition." In ASME 2021 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/detc2021-70708.
Abstract:
Abstract Digital twins (DT) have become a useful tool in smart manufacturing, engineering and controls. Behavior matching of DTs to their physical twin counterparts is essential for capturing the evolution of key system parameters. Given that environmental gas emissions are governed by partial differential equations, the behavior matching optimization can often be ill posed and computationally expensive. Stochastic models have shown good agreement to deterministic models while having a significant computational cost reduction. This work presents a method for solving the source localization problem using a DT implementation of a stochastic point source emission with a fixed-mesh of gas sensors. The DT source localization is determined through behavior matching process with low frequency modes after dynamic mode decomposition using spatial interpolation on measured time series data. That is, the minimization of the mismatch between the DT and the unknown physical model can given an estimate of the source location.
9
Al-Turki, Ali, Obai Alnajjar, Majdi Baddourah, and Babatunde Moriwawon. "Compressed Dimension of Reservoir Models Uncertainty Parameters for Optimized Model Calibration and History Matching Process." In SPE Annual Technical Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/206066-ms.
Abstract:
Abstract The algorithms and workflows have been developed to couple efficient model parameterization with stochastic, global optimization using a Multi-Objective Genetic Algorithm (MOGA) for global history matching, and coupled with an advanced workflow for streamline sensitivity-based inversion for fine-tuning. During parameterization the low-rank subsets of most influencing reservoir parameters are identified and propagated to MOGA to perform the field-level history match. Data misfits between the field historical data and simulation data are calculated with multiple realizations of reservoir models that quantify and capture reservoir uncertainty. Each generation of the optimization algorithms reduces the data misfit relative to the previous iteration. This iterative process continues until a satisfactory field-level history match is reached or there are no further improvements. The fine-tuning process of well-connectivity calibration is then performed with a streamlined sensitivity-based inversion algorithm to locally update the model to reduce well-level mismatch. In this study, an application of the proposed algorithms and workflow is demonstrated for model calibration and history matching. The synthetic reservoir model used in this study is discretized into millions of grid cells with hundreds of producer and injector wells. It is designed to generate several decades of production and injection history to evaluate and demonstrate the workflow. In field-level history matching, reservoir rock properties (e.g., permeability, fault transmissibility, etc.) are parameterized to conduct the global match of pressure and production rates. Grid Connectivity Transform (GCT) was used and assessed to parameterize the reservoir properties. In addition, the convergence rate and history match quality of MOGA was assessed during the field (global) history matching. Also, the effectiveness of the streamline-based inversion was evaluated by quantifying the additional improvement in history matching quality per well. The developed parametrization and optimization algorithms and workflows revealed the unique features of each of the algorithms for model calibration and history matching. This integrated workflow has successfully defined and carried uncertainty throughout the history matching process. Following the successful field-level history match, the well-level history matching was conducted using streamline sensitivity-based inversion, which further improved the history match quality and conditioned the model to historical production and injection data. In general, the workflow results in enhanced history match quality in a shorter turnaround time. The geological realism of the model is retained for robust prediction and development planning.
10
Avalos, Javier, Lanae A. Richter, X. Q. Wang, Raghavendra Murthy, and Marc P. Mignolet. "Stochastic Modal Models of Slender Uncertain Curved Beams Preloaded Through Clamping." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-71169.
Abstract:
This paper addresses the stochastic modeling of the stiffness matrix of slender uncertain curved beams that are forced fit into a clamped-clamped fixture designed for straight beams. Because of the misfit with the clamps, the final shape of the clamped-clamped beams is not straight and they are subjected to an axial preload. Both of these features are uncertain given the uncertainty on the initial, undeformed shape of the beams and affect significantly the stiffness matrix associated with small motions around the clamped-clamped configuration. A modal model using linear modes of the straight clamped-clamped beam with a randomized stiffness matrix is employed to characterize the linear dynamic behavior of the uncertain beams. This stiffness matrix is modeled using a mixed nonparametric-parametric stochastic model in which the nonparametric (maximum entropy) component is used to model the uncertainty in final shape while the preload is explicitly, parametrically included in the stiffness matrix representation. Finally, a maximum likelihood framework is proposed for the identification of the parameters associated with the uncertainty level and the mean model, or part thereof, using either natural frequencies only or natural frequencies and mode shape information of the beams around their final clamped-clamped state. To validate these concepts, a simulated, computational experiment was conducted within Nastran to produce a population of natural frequencies and mode shapes of uncertain slender curved beams after clamping. The application of the above concepts to this simulated data led to a very good to excellent matching of the probability density functions of the natural frequencies and the modal components, even though this information was not used in the identification process. These results strongly suggest the applicability of the proposed stochastic model.
Reports on the topic "Stochastic matching models":
1
Chen, Xin, Yanfeng Ouyang, Ebrahim Arian, Haolin Yang, and Xingyu Ba. Modeling and Testing Autonomous and Shared Multimodal Mobility Services for Low-Density Rural Areas. Illinois Center for Transportation, August 2022. http://dx.doi.org/10.36501/0197-9191/22-013.
Abstract:
Recent developments in transformative technologies hold the promise to provide holistic solutions for affordable transportation services to rural areas and thus greatly alleviate existing social inequality through efficient planning and management of complex transportation systems and systemwide interactions among multiple modes. To realize the promise, many challenging research questions need to be addressed, which often leads to computationally intractable, large-scale, dynamic/stochastic, discrete optimization models. This project proposes to address some of the challenges by building a series of holistic and tractable models on the design of mobility services, capacity planning, dynamic matching, and routing, as well as pricing. The proposed project is expected to create a new series of planning and management models that can support strategical and operational decisions for large-scale autonomous and shared mobility systems in rural areas. The planned case study and simulation for the Village of Rantoul, Illinois, will lay the foundation for future field implementation.
2
Aliprantis, Dionissi, Daniel R. Carroll, and Eric R. Young. The Dynamics of the Racial Wealth Gap. Federal Reserve Bank of Cleveland, November 2022. http://dx.doi.org/10.26509/frbc-wp-201918r.
Abstract:
What drives the dynamics of the racial wealth gap? We answer this question using a dynamic stochastic general equilibrium heterogeneous-agents model. Our calibrated model endogenously produces a racial wealth gap matching that observed in recent decades along with key features of the current cross-sectional distribution of wealth, earnings, intergenerational transfers, and race. Our model predicts that equalizing earnings is by far the most important mechanism for permanently closing the racial wealth gap. One-time wealth transfers have only transitory effects unless they address the racial earnings gap, and return gaps only matter when earnings inequality is reduced.
3
Finkelstein-Shapiro, Alan, and Miguel Sarzosa. Unemployement Protection for Informal Workers in Latin America and the Caribbean. Inter-American Development Bank, September 2012. http://dx.doi.org/10.18235/0011470.
Abstract:
We use a dynamic stochastic general equilibrium search and matching model with salaried employment and informal self-employment to analyze the implications of introducing universal unemployment protection for informal workers through transfers, which are conditional on participation in training programs. We study how changes in unemployment benefits (UB) for unemployed workers in training programs (training UB), modify labor market outcomes for the unemployed. The model suggests that increasing training UB reduces unprotected unemployment and improves labor market outcomes through higher formal salaried employment and lower informal self-employment. Allowing for idiosyncratic quality in these training programs is key for these results. Higher training UB can also reduce total informal employment through a drastic reduction in the share of informal self-employment, without necessarily causing a large increase in total unemployment. Finally, the model suggests that increasing training UB may increase the volatility of unprotected unemployment. The influence of training programs on formal wage-setting is crucial to explain these results.