The location selection problem for the household activity pattern problem

• Incorporates destination choice in the household activity pattern problem.
• Models destination choice relative to spatio-temporal interactions among activities.
• Develops fast dynamic programming algorithm for HAPP with destination choice.
• Treats objective functions with arrival time variables as well as path sequences.
• Example application to activity-based travel forecasting presented.

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.