-
作者:Osorio, Carolina; Bierlaire, Michel
作者单位:Massachusetts Institute of Technology (MIT); Swiss Federal Institutes of Technology Domain; Ecole Polytechnique Federale de Lausanne
摘要:This paper proposes a simulation-based optimization (SO) method that enables the efficient use of complex stochastic urban traffic simulators to address various transportation problems. It presents a metamodel that integrates information from a simulator with an analytical queueing network model. The proposed metamodel combines a general-purpose component (a quadratic polynomial), which provides a detailed local approximation, with a physical component (the analytical queueing network model), ...
-
作者:Shu, Jia; Chou, Mabel C.; Liu, Qizhang; Teo, Chung-Piaw; Wang, I-Lin
作者单位:Southeast University - China; National University of Singapore; National Cheng Kung University
摘要:We develop practical operations research models to support decision making in the design and management of public bicycle-sharing systems. We develop a network flow model with proportionality constraints to estimate the flow of bicycles within the network and the number of trips supported, given an initial allocation of bicycles at each station. We also examine the effectiveness of periodic redistribution of bicycles in the network to support greater flow, and the impact on the number of docks...
-
作者:Lichtendahl, Kenneth C., Jr.; Grushka-Cockayne, Yael; Pfeifer, Phillip E.
作者单位:University of Virginia
摘要:When several individuals are asked to forecast an uncertain quantity, they often face implicit or explicit incentives to be the most accurate. Despite the desire to elicit honest forecasts, such competition induces forecasters to report strategically and nontruthfully. The question we address is whether the competitive crowd's forecast (the average of strategic forecasts) is more accurate than the truthful crowd's forecast (the average of truthful forecasts from the same forecasters). We analy...
-
作者:He, Ying; Dyer, James S.; Butler, John C.
作者单位:City University of Hong Kong; University of Texas System; University of Texas Austin; University of Texas System; University of Texas Austin
摘要:We propose a preference condition called shifted difference independence to axiomatize a general habit formation and satiation model (GHS). This model allows for a general habit formation and satiation function that contain many functional forms in the literature as special cases. Since the GHS model can be reduced to either a general satiation model (GSa) or a general habit formation model (GHa), our theory also provides approaches to axiomatize both the GSa model and the GHa model. Furthermo...
-
作者:Cire, Andre A.; van Hoeve, Willem-Jan
作者单位:Carnegie Mellon University
摘要:Sequencing problems are among the most prominent problems studied in operations research, with primary application in, e.g., scheduling and routing. We propose a novel approach to solving generic sequencing problems using multivalued decision diagrams (MDDs). Because an MDD representation may grow exponentially large, we apply MDDs of limited size as a discrete relaxation to the problem. We show that MDDs can be used to represent a wide range of sequencing problems with various side constraint...
-
作者:Toriello, Alejandro; Uhan, Nelson A.
作者单位:University System of Georgia; Georgia Institute of Technology; United States Department of Defense; United States Navy; United States Naval Academy
摘要:We consider cooperative traveling salesman games with nonnegative asymmetric costs satisfying the triangle inequality. We construct a stable cost allocation with budget balance guarantee equal to the Held-Karp integrality gap for the asymmetric traveling salesman problem, using the parsimonious property and a previously unknown connection to linear production games. We also show that our techniques extend to larger classes of network design games. We then provide a simple example showing that ...
-
作者:Shapiro, Alexander; Tekaya, Wajdi; Soares, Murilo Pereira; da Costa, Joari Paulo
作者单位:University System of Georgia; Georgia Institute of Technology
摘要:In this paper we discuss multistage programming with the data process subject to uncertainty. We consider a situation where the data process can be naturally separated into two components: one can be modeled as a random process, with a specified probability distribution, and the other one can be treated from a robust (worst-case) point of view. We formulate this in a time consistent way and derive the corresponding dynamic programming equations. To solve the obtained multistage problem, we dev...
-
作者:Dai, Wanyang
作者单位:Nanjing University; Nanjing University
摘要:We design a dynamic rate scheduling policy of Markov type by using the solution (a social optimal Nash equilibrium point) to a utility-maximization problem over a randomly evolving capacity set for a stochastic system of generalized processor-sharing queues in a random environment whose job arrivals to each queue follow a doubly stochastic renewal process (DSRP). Both the random environment and the random arrival rate of each DSRP are driven by a finite state continuous time Markov chain. The ...
-
作者:Deo, Sarang; Iravani, Seyed; Jiang, Tingting; Smilowitz, Karen; Samuelson, Stephen
作者单位:Indian School of Business (ISB); Northwestern University
摘要:This paper studies a model of community-based healthcare delivery for a chronic disease. In this setting, patients periodically visit the healthcare delivery system, which influences their disease progression and consequently their health outcomes. We investigate how the provider can maximize community-level health outcome's through better operational decisions pertaining to capacity allocation across different patients. To do so, we develop an integrated capacity allocation model that incorpo...
-
作者:Jasin, Stefanus; Kumar, Sunil
作者单位:University of Michigan System; University of Michigan; University of Chicago
摘要:We study the performance of two popular and widely used heuristics for revenue management known as the booking limit and bid price controls. In contrast to a recent result in the literature where frequent re-solvings of a certain heuristic are shown to significantly reduce revenue loss, we show that the asymptotic revenue loss of either booking limit or bid price control cannot be reduced regardless of the choice of re-solving times and the frequency of re-solving. Moreover, we also show that ...