A theoretical analysis of the cross-nested logit model

The emergence of Intelligent Transportation Systems and the associated technologies has increased the need for complex models and algorithms. Namely, real-time information systems, directly influencing transportation demand, must be supported by detailed behavioral models capturing travel and driving decisions. Discrete choice models methodology provide an appropriate framework to capture such behavior. Recently, the Cross-Nested Logit (CNL) model has received quite a bit of attention in the literature to capture decisions such as mode choice, departure time choice and route choice. %The CNL model is an extension of the Nested Logit model, providing %more flexibility at the cost of some complexity in the model formulation. In this paper, we develop on the general formulation of the Cross Nested Logit model proposed by Ben-Akiva and Bierlaire (1999) and based on the Generalized Extreme Value (GEV) model. We show that it is equivalent to the formulations byby Papola (2004) and Wen and Koppelman (2001). We also show that the formulations by Small(1987) and Vovsha(1997) are special cases of this formulation. We formally prove that the Cross-Nested Logit model is indeed a member of the GEV models family. In doing so, we clearly distinguish between conditions that are necessary to prove consistency with the GEV theory, from normalization conditions. Finally, we propose to estimate the model with non-linear programming algorithms, instead of heuristics proposed in the literature. In order to make it operational, we provide the first derivatives of the log-likelihood function, which are necessary to such optimization procedure

The robust single machine scheduling problem with uncertain release and processing times

In this work, we study the single machine scheduling problem with uncertain release times and processing times of jobs. We adopt a robust scheduling approach, in which the measure of robustness to be minimized for a given sequence of jobs is the worst-case objective function value from the set of all possible realizations of release and processing times. The objective function value is the total flow time of all jobs. We discuss some important properties of robust schedules for zero and non-zero release times, and illustrate the added complexity in robust scheduling given non-zero release times. We propose heuristics based on variable neighborhood search and iterated local search to solve the problem and generate robust schedules. The algorithms are tested and their solution performance is compared with optimal solutions or lower bounds through numerical experiments based on synthetic data

Choice probability generating functions

This paper establishes that every random utility discrete choice model (RUM) has a representation that can be characterized by a choice-probability generating function (CPGF) with specific properties, and that every function with these specific properties is consistent with a RUM. The choice probabilities from the RUM are obtained from the gradient of the CPGF. Mixtures of RUM are characterized by logarithmic mixtures of their associated CPGF. The paper relates CPGF to multivariate extreme value distributions, and reviews and extends methods for constructing generating functions for applications. The choice probabilities of any ARUM may be approximated by a cross-nested logit model. The results for ARUM are extended to competing risk survival models.Discrete choice; random utility; mixture models; duration models; logit; generalised extreme value; multivariate extreme value

A Simulation-Based Optimization Framework for Urban Transportation Problems

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), which provides tractable analytical and global information. This combination leads to an SO framework that is computationally efficient and suitable for complex problems with very tight computational budgets. We integrate this metamodel within a derivative-free trust region algorithm. We evaluate the performance of this method considering a traffic signal control problem for the Swiss city of Lausanne, different demand scenarios, and tight computational budgets. The method leads to well-performing signal plans. It leads to reduced, as well as more reliable, average travel times

A tractable analytical model for large-scale congested protein synthesis networks

This paper presents an analytical model, based on finite capacity queueing network theory, to evaluate congestion in protein synthesis networks. These networks are modeled as a set of single server bufferless queues in a tandem topology. This model proposes a detailed state space formulation, which provides a fine description of congestion and contributes to a better understanding of how the protein synthesis rate is deteriorated. The model approximates the marginal stationary distributions of each queue. It consists of a system of linear and quadratic equations that can be decoupled. The numerical performance of this method is evaluated for networks with up to 100,000 queues, considering scenarios with various levels of congestion. It is a computationally efficient and scalable method that is suitable to evaluate congestion for large-scale networks. Additionally, this paper generalizes the concept of blocking: blocking events can be triggered by an arbitrary set of queues. This generalization allows for a variety of blocking phenomena to be modeled.Swiss National Science Foundation (Grant 205320-117581

A practical test for the choice of mixing distribution in a discrete choice model

The choice of a specific distribution for random parameters of a discrete choice model is a critical issue in transportation analysis. Indeed, various pieces of research have demonstrated that an inappropriate choice of the distribution may lead to serious biases in model forecast and in the estimated means of random parameters. In this paper we propose a practical test, based on seminonparametric techniques. The test is analyzed both on synthetic and real data, and is shown to be simple and powerful.Seminonparametric, discrete choice, mixed logit, value of time

Choice probability generating functions

This paper establishes that every random utility discrete choice model (RUM) has a representation that can be characterized by a choice-probability generating function (CPGF) with specific properties, and that every function with these specific properties is consistent with a RUM. The choice probabilities from the RUM are obtained from the gradient of the CPGF. Mixtures of RUM are characterized by logarithmic mixtures of their associated CPGF. The paper relates CPGF to multivariate extreme value distributions, and reviews and extends methods for constructing generating functions for applications. The choice probabilities of any ARUM may be approximated by a cross-nested logit model. The results for ARUM are extended to competin