Abstract: A multi-day and multi-person trip planning system comprises a planning graph of nodes interconnected by transit arcs which both have associated time-variable costs and time. A user specifies user objectives within trip destinations and customizes a plurality of user preferences for a multi-day, multi-person, multi-modal trip. An optimizer compiles a plurality of permutations of visiting plans within the planning graph which satisfy the specified user objectives including routing to a plurality of trip destinations. The optimizer compares the permutations using mixed integer programming or constraint programming to identify at least one optimized visiting plan having a lowest aggregate associated cost or shortest travel time that also satisfies a plurality of constraints determined by the customizable user preferences or environment condition. Then the user interface presents at least one optimized visiting plan to a user or route related coupons.

Abstract: A multi-day and multi-person trip planning system comprises a planning graph of nodes interconnected by transit arcs which both have associated time-variable costs and time. A user specifies user objectives within trip destinations and customizes a plurality of user preferences for a multi-day, multi-person, multi-modal trip. An optimizer compiles a plurality of permutations of visiting plans within the planning graph which satisfy the specified user objectives including routing to a plurality of trip destinations. The optimizer compares the permutations using mixed integer programming or constraint programming to identify at least one optimized visiting plan having a lowest aggregate associated cost or shortest travel time that also satisfies a plurality of constraints determined by the customizable user preferences or environment condition. Then the user interface presents at least one optimized visiting plan to a user or route related coupons.