Previously, a theory of activity-travel rescheduling decisions was developed. This theory left open the problem of how individuals deal with the combinatorial problem of a very large solution space. Based on the argument that an appropriate algorithm should also be interpreted as a representation of an actual decision-making process, such an algorithm for activity-travel rescheduling is proposed here. Details are described, and a numerical illustration is provided to explore the face validity of the proposed algorithm.
No takes yet. Share an insight, caveat, or question.
Joh et al. (2002) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: