Scenic Routes Now: Efficiently Solving the Time- Dependent Arc Orienteering Problem

10/04/2017
1:30 pm - 4:00 pm
Expo Hall/Career Fair

Objective: Inspiration
Audience Level: All
Session Type: Poster

A new problem called Twofold Time-Dependent AOP(2TD-AOP) is proposed. Given a time-dependent road network, 2TD-AOP finds a path from a source to a destination maximizing the accumulated value(e.g.,attractiveness) while not exceeding a time budget. The challenge is how to solve 2TD-AOP (NP-hard) on a large network efficiently. A metaheuristic approach is provided achieving 60% accuracy in 2 secs.

Speaker(s)

, Ph. D. candidate, University of Southern California