2026-09-19T03:41:55Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1232082021-07-05T14:03:20Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Moshe Ben-Akiva and Patrick Jaillet.
Aboutaleb, Youssef Medhat.
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2019-12-13T18:41:03Z
2019-12-13T18:41:03Z
2019
2019
https://hdl.handle.net/1721.1/123208
1129597025
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Thesis: S.M. in Transportation, Massachusetts Institute of Technology, Department of Civil and Environmental Engineering, 2019
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 67-68).
This work is about developing an estimation procedure for nested logit models that optimizes over the nesting structure in addition to the model parameters. Current estimation practices require an a priori specification of a nesting structure. We formulate the problem of learning an optimal nesting structure as a mixed integer nonlinear programming (MINLP) optimization problem and solve it using a variant of the linear outer approximation algorithm. We demonstrate that it is indeed possible to recover the nesting structure directly from the data by applying our method to synthetic and real datasets.
by Youssef Medhat Aboutaleb.
S.M. in Transportation
S.M.
S.M.inTransportation Massachusetts Institute of Technology, Department of Civil and Environmental Engineering
S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
68 pages
eng
Massachusetts Institute of Technology
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
http://dspace.mit.edu/handle/1721.1/7582
Civil and Environmental Engineering.
Electrical Engineering and Computer Science.
Learning structure in nested logit models
Thesis
application/pdf
2019-12-13T18:41:03Z
Publication
Master
CivEng
EECS
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="52b570b1-1ae9-4a87-8ae1-54544318db95">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Learning structure in nested logit models</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2019</PublicationDate>
<Authors>
<Author>
<DisplayName>Aboutaleb, Youssef Medhat.</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Civil and Environmental Engineering.</Keyword>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>This work is about developing an estimation procedure for nested logit models that optimizes over the nesting structure in addition to the model parameters. Current estimation practices require an a priori specification of a nesting structure. We formulate the problem of learning an optimal nesting structure as a mixed integer nonlinear programming (MINLP) optimization problem and solve it using a variant of the linear outer approximation algorithm. We demonstrate that it is indeed possible to recover the nesting structure directly from the data by applying our method to synthetic and real datasets.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>