Hybrid approach for the public transportation time dependent orienteering problem with time windows

Authors:
Ander Garcia;Olatz Arbelaitz;Pieter Vansteenwegen;Wouter Souffriau;Maria Teresa Linaza
Affiliations:
Vicomtech, Spain;University of the Basque Country, Spain;Katholieke Universiteit Leuven, Belgium;Katholieke Universiteit Leuven, Belgium;Vicomtech, Spain
Venue:
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Year:
2010

Citing 10
Cited 2

Approximation algorithms for time-dependent orienteering

Information Processing Letters
A Multi-Modal Agent Based Mobile Route Advisory System for Public Transport Network

HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 3 - Volume 03
Efficient models for timetable information in public transportation systems

Journal of Experimental Algorithmics (JEA)
Finding time-dependent shortest paths over large graphs

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming

Computers and Operations Research
Designing Multimodal Freight Transport Networks: A Heuristic Approach and Applications

Transportation Science
Iterated local search for the team orienteering problem with time windows

Computers and Operations Research
Heuristics for the multi-period orienteering problem with multiple time windows

Computers and Operations Research
ROSE: assisting pedestrians to find preferred events and comfortable public transport connections

Mobility '09 Proceedings of the 6th International Conference on Mobile Technology, Application & Systems
Algorithms for Itinerary Planning in Multimodal Transportation Networks

IEEE Transactions on Intelligent Transportation Systems

Personalized tourist route generation

ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
A genetic algorithm vs. local search methods for solving the orienteering problem in large networks

KES'12 Proceedings of the 16th international conference on Knowledge Engineering, Machine Learning and Lattice Computing with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Time Dependent Orienteering Problem with Time Windows (TDOPTW) consists of a set of locations with associated time windows and scores Visiting a location allows to collect its score as a reward Traveling time between locations varies depending on the leave time The objective is to obtain a route that maximizes the obtained score within a limited amount of time In this paper we target the use of public transportation in a city, where users may move on foot or by public transportation The approach can also be applied to the logistic sector, for example to the multimodal freight transportation We apply an hybrid approach to tackle the problem Experimental results for the city of San Sebastian show we are able to obtain valid routes in real-time.