Travellers have to make some decisions for each trip, and one of them is the choice of departure time. Discrete choice models have been employed as an approach to departure time modelling by many researchers. In this method, preparing choice set is a primary challenge which involves the definition of some departure periods to be selected by the traveller. In this research, choice sets were formed by applying the clustering methods on departure times. Afterwards, we developed Multinomial Logit (MNL) models on different choice sets and compared the models. The data used throughout this research belonged to Mashhad City. Research results indicated that Ward’s hierarchical clustering method is improper for time discretization; furthermore, the K-means clustering method is more efficient than the expectation maximization and K-medoids methods in the time discretization for MNL modelling. The developed model (based on K-means clustering method) accurately predicts departure time for 58% of persons within the test group, which reflects the effectiveness of the resulting model compared to the 36% which is obtained without the model.
Using Clustering Methods in Multinomial Logit Model for Departure Time Choice
2020
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
The constrained multinomial logit: A semi-compensatory choice model
Online Contents | 2009
|The constrained multinomial logit: A semi-compensatory choice model
Online Contents | 2009
|The constrained multinomial logit: A semi-compensatory choice model
Elsevier | 2008
|Modeling dominated choice alternatives using the constrained multinomial logit
British Library Conference Proceedings | 2008
|Bayesian Multinomial Logit: Theory and Route Choice Example
Online Contents | 2009
|