Publication Type

Journal Article

Version

submittedVersion

Publication Date

6-2024

Abstract

In many choice modeling applications, consumer demand is frequently characterized as multiple discrete, which means that consumer choose multiple items simultaneously. The analysis and prediction of consumer behavior in multiple discrete choice situations pose several challenges. In this paper, to address this, we propose a random utility maximization (RUM) based model that considers each subset of choice alternatives as a composite alternative, where individuals choose a subset according to the RUM framework. While this approach offers a natural and intuitive modeling approach for multiple-choice analysis, the large number of subsets of choices in the formulation makes its estimation and application intractable. To overcome this challenge, we introduce directed acyclic graph (DAG) based representations of choices where each node of the DAG is associated with an elemental alternative and additional information such as the number of selected elemental alternatives. Our innovation is to show that the multi-choice model is equivalent to a recursive route choice model on the DAG, leading to the development of new efficient estimation algorithms based on dynamic programming. In addition, the DAG representations enable us to bring some advanced route choice models to capture the correlation between subset choice alternatives. Numerical experiments based on synthetic and real datasets show many advantages of our modeling approach and the proposed estimation algorithms.

Keywords

Multiple discrete choice, Network-based representation, Recursive route choice model

Discipline

Operations Research, Systems Engineering and Industrial Engineering | OS and Networks | Transportation

Research Areas

Intelligent Systems and Optimization

Publication

Transportation Research Part B: Methodological

Volume

184

First Page

1

Last Page

22

ISSN

0191-2615

Identifier

10.1016/j.trb.2024.102948

Publisher

Elsevier

Copyright Owner and License

Authors

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Additional URL

https://doi.org/10.1016/j.trb.2024.102948

Share

COinS