Subscribe Now Subscribe Today
Science Alert
Curve Top
Journal of Applied Sciences
  Year: 2013 | Volume: 13 | Issue: 6 | Page No.: 876-882
DOI: 10.3923/jas.2013.876.882
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Constructive Heuristics for Team Orienteering Problems

Hamzah Ali Alkhazaleh, Masri Ayob, Zalinda Othman and Zulkifli Ahmad

This work investigates different constructive heuristics to initial trial solutions for Team Orienteering Problem (TOP). The goal of TOP is to build a particular number of routes that visit some points to maximize the sum of the score, while the route’s length does not exceeding the time budget. The initial solutions were constructed by random generation methods, nearest neighbor greedy heuristic, randomly selection method (random generation methods and nearest neighbor greedy heuristic) and two type of Greedy Random Adaptive Search Procedures (GRASP) (cardinality-based criteria (greedy value) and value-based criteria (threshold value)). These constructive heuristics were tested using few instances on benchmark datasets. Results were compared among each other based on solutions’ quality value and diversity value. The comparison of results concludes that the nearest neighbor greedy heuristic gain better initial solutions that balanced between solution quality and solution diversity.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

Hamzah Ali Alkhazaleh, Masri Ayob, Zalinda Othman and Zulkifli Ahmad, 2013. Constructive Heuristics for Team Orienteering Problems. Journal of Applied Sciences, 13: 876-882.

DOI: 10.3923/jas.2013.876.882






Curve Bottom