Next Article in Journal
An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs
Previous Article in Journal
A Family of Iterative Methods for Solving Systems of Nonlinear Equations Having Unknown Multiplicity
Article Menu

Export Article

Open AccessArticle
Algorithms 2016, 9(1), 6; doi:10.3390/a9010006

Efficient Metaheuristics for the Mixed Team Orienteering Problem with Time Windows

1
Department of Cultural Technology and Communication, University of the Aegean, University Hill, GR 81 100 Mytilini, Lesvos, Greece
2
Computer Technology Institute & Press Diophantus, “D. Maritsas” Building, Nikou Kazantzaki St., University Campus of Patras 265 04 Rion, P.O. Box 1382, Greece
3
Department of Informatics, University of Piraeus, 80, M. Karaoli & A. Dimitriou St., 18534 Piraeus, Greece
4
School of Applied Mathematical and Physical Sciences, National Technical University of Athens, Zografou Campus, Heroon Polytechniou 9, 15780 Zografou, Greece
5
Department of Informatics, Technological Educational Institution of Athens, Ag. Spiridona St., Aigaleo 122 10, Greece
6
School of Electrical and Computer Engineering, National Technical University of Athens, Zografou Campus, Heroon Polytechniou 9, 15780 Zografou, Greece
*
Author to whom correspondence should be addressed.
Academic Editor: Marco Chiarandini
Received: 16 April 2015 / Revised: 16 November 2015 / Accepted: 25 December 2015 / Published: 5 January 2016
View Full-Text   |   Download PDF [412 KB, uploaded 5 January 2016]   |  

Abstract

Given a graph whose nodes and edges are associated with a profit, a visiting (or traversing) time and an admittance time window, the Mixed Team Orienteering Problem with Time Windows (MTOPTW) seeks for a specific number of walks spanning a subset of nodes and edges of the graph so as to maximize the overall collected profit. The visit of the included nodes and edges should take place within their respective time window and the overall duration of each walk should be below a certain threshold. In this paper we introduce the MTOPTW, which can be used for modeling a realistic variant of the Tourist Trip Design Problem where the objective is the derivation of near-optimal multiple-day itineraries for tourists visiting a destination which features several points of interest (POIs) and scenic routes. Since the MTOPTW is a NP-hard problem, we propose the first metaheuristic approaches to tackle it. The effectiveness of our algorithms is validated through a number of experiments on POI and scenic route sets compiled from the city of Athens (Greece). View Full-Text
Keywords: Iterated Local Search; Simulated Annealing; Team Orienteering Problem; Arc Orienteering Problem Iterated Local Search; Simulated Annealing; Team Orienteering Problem; Arc Orienteering Problem
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Gavalas, D.; Konstantopoulos, C.; Mastakas, K.; Pantziou, G.; Vathis, N. Efficient Metaheuristics for the Mixed Team Orienteering Problem with Time Windows. Algorithms 2016, 9, 6.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top