.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Destination choice
Location selection
Household activity pattern problem
Column generation
Exact dynamic programming for PDPTW
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
3.6K
被引数:
1.9W
机构
引用论文
.png){kind=icon}
Stock market reactions to dividend announcements: Empirical evidence from the Austrian stock market
PREAI
分享收藏
查看更多内容