nested logit
Recently Published Documents


TOTAL DOCUMENTS

311
(FIVE YEARS 56)

H-INDEX

41
(FIVE YEARS 3)

2022 ◽  
Vol 11 (2) ◽  
Author(s):  
Yu Morimoto ◽  
Takeshi Koide ◽  
Takeshi Koide ◽  
Yuko Sugiura

This research investigates whether passengers living in a city with a local public airport have an attachment to that airport and tend to use it. Focusing on the greater Kansai area with its three airports and Kobe, which owns one of them, Kobe Airport, as an example, an empirical analysis was conducted using a nested logit model and micro data. The result of the basic model shows that passengers living in Kobe prefer the Kobe Airport when compared to passengers living in other cities. An additional analysis based on a questionnaire survey revealed that a certain percentage of respondents choose Kobe Airport because they love it, meaning that the non-economic factor of attachment influences passengers’ decisions. The results of this research suggest that enhancing attachment to an airport might be a possible idea for policy makers of airport cities to increase their passengers.


2021 ◽  
Author(s):  
Antoine Désir ◽  
Vineet Goyal ◽  
Jiawei Zhang

Assortment optimization is an important problem arising in various applications. In many practical settings, the assortment is subject to a capacity constraint. In “Capacitated Assortment Optimization: Hardness and Approximation,” Désir, Goyal, and Zhang study the capacitated assortment optimization problem. The authors first show that adding a general capacity constraint makes the problem NP-hard even for the simple multinomial logit model. They also show that under the mixture of multinomial logit model, even the unconstrained problem is hard to approximate within any reasonable factor when the number of mixtures is not constant. In view of these hardness results, the authors present near-optimal algorithms for a large class of parametric choice models including the mixture of multinomial logit, Markov chain, nested logit, and d-level nested logit choice models. In fact, their approach extends to a large class of objective functions that depend only on a small number of linear functions.


Author(s):  
Zhenjun Zhu ◽  
Jun Zeng ◽  
Xiaolin Gong ◽  
Yudong He ◽  
Shucheng Qiu

With the continuous improvement of the operation line network of urban rail transit, analyzing influencing factors of transfer passenger flow of urban rail transit is critical to improve the transfer demand analysis of urban rail transit. Using data collected from questionnaires, transfer passenger flow surveys and smart cards, this study proposes an approach base on nested logit passenger flow assignment model considering transfer choice behaviours of passengers. The transfer passenger flow at seven transfer stations in Nanjing is obtained. Subsequently, this study investigates the potential influencing factors of transfer passenger flow, including the node degree, geographic location (located in the city center, urban fringe, suburbs or suburban fringe), economic location (distance from the city center) and transportation locations (if it is close to a transportation hub or in combination with the hub) of rail transit transfer stations. The results indicate that a positive correlation between the transfer passenger flow and the node degrees of transfer stations. However, the relationship between transfer passenger flow and the economic, geographic, and transportation locations of transfer stations is not clear. The finding have reference value for the network design of rail transit transfer stations and transfer facilities, and provide reference for the analysis of passenger flow under network operation.


2021 ◽  
pp. 1-41
Author(s):  
Arthur Yip ◽  
Jeremy J. Michalek ◽  
Kate Whitefoot

Abstract Design optimization studies that model competition with other products in the market often use a small set of products to represent all competitors. We investigate the effect of competitor product representation on profit-maximizing design solutions. Specifically, we study the implications of replacing a large set of disaggregated elemental competitor products with a subset of competitor products or composite products. We derive first-order optimality conditions and show that optimal design (but not price) is independent of competitors when using logit and nested logit models (where preferences are homogeneous). However, this relationship differs in the case of random-coefficients logit models (where preferences are heterogeneous), and we demonstrate that profit-maximizing design solutions using latent-class or mixed-logit models can (but need not always) depend on the representation of competing products. We discuss factors that affect the magnitude of the difference between models with elemental and composite representations of competitors, including preference heterogeneity, cost function curvature, and competitor set specification. We present correction factors that ensure models using subsets or composite representation of competitors have optimal design solutions that match those of disaggregated elemental models. While optimal designs using logit and nested logit models are not affected by ad-hoc modeling decisions of competitor representation, the independence of optimal designs from competitors when using these models raises questions of when these models are appropriate to use.


Author(s):  
David Müller ◽  
Yurii Nesterov ◽  
Vladimir Shikhman

We derive new prox-functions on the simplex from additive random utility models of discrete choice. They are convex conjugates of the corresponding surplus functions. In particular, we explicitly derive the convexity parameter of discrete choice prox-functions associated with generalized extreme value models, and specifically with generalized nested logit models. Incorporated into subgradient schemes, discrete choice prox-functions lead to a probabilistic interpretations of the iteration steps. As illustration, we discuss an economic application of discrete choice prox-functions in consumer theory. The dual averaging scheme from convex programming adjusts demand within a consumption cycle.


2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Dongmei Yan ◽  
Yang Yang

The cumulative prospect theory provides a better description for route choice behavior of the travelers in an uncertain road network environment. In this study, we proposed a multiclass cumulative prospect value- (CPV-) based cross-nested logit (CNL) stochastic user equilibrium (SUE) model. For this model, an equivalent variational inequality (VI) model is provided, and the existence and equivalence of the model solutions are also proved. The method of successive averages (MSA), method of successive weighted averages (MSWA), and self-regulated averaging (SRA) method are designed and compared. In addition, the proposed multiclass CPV-based CNL SUE model is also compared with the multiclass utility value- (UV-) based CNL SUE model. The results show that the path flow assigned by the multiclass CPV-based CNL SUE model is more consistent with the actual situation. The impact of different model parameters on the cumulative prospect value (CPV) is investigated.


2021 ◽  
Vol 291 (3) ◽  
pp. 830-845
Author(s):  
Laurent Alfandari ◽  
Alborz Hassanzadeh ◽  
Ivana Ljubić

2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Seungkyu Ryu ◽  
Anthony Chen ◽  
Songyot Kitthamkesorn

This study provides a gradient projection (GP) algorithm to solve the combined modal split and traffic assignment (CMSTA) problem. The nested logit (NL) model is used to consider the mode correlation under the user equilibrium (UE) route choice condition. Specifically, a two-phase GP algorithm is developed to handle the hierarchical structure of the NL model in the CMSTA problem. The Seoul transportation network in Korea is adopted to demonstrate an applicability in a large-scale multimodal transportation network. The results show that the proposed GP solution algorithm outperforms the method of the successive averages (MSA) algorithm and the classical Evan’s algorithm.


2021 ◽  
Vol 145 ◽  
pp. 324-341
Author(s):  
Sepehr Ghader ◽  
Carlos Carrion ◽  
Liang Tang ◽  
Arash Asadabadi ◽  
Lei Zhang

Sign in / Sign up

Export Citation Format

Share Document