.png){kind=icon}
.png){kind=icon}
Return
The location selection problem for the household activity pattern problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.trb.2013.05.003.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, an integrated destination choice model based on routing and scheduling considerations of daily activities is proposed. Extending the Household Activity Pattern Problem (HAPP), the Location Selection Problem (LSP-HAPP) demonstrates how location choice is made as a simultaneous decision from interactions both with activities having predetermined locations and those with many candidate locations. A dynamic programming algorithm, developed for PDPTW, is adapted to handle a potentially sizable number of candidate locations. It is shown to be efficient for HAPP and LSP-HAPP applications. The algorithm is extended to keep arrival times as functions for mathematical programming formulations of activity-based travel models that often have time variables in the objective. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Destination choice
Location selection
Household activity pattern problem
Column generation
Exact dynamic programming for PDPTW
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
3.5K
Citations:
1.9W
