Submit Manuscript

Journal of Applied Sciences

Year: 2013 | Volume: 13 | Issue: 6 | Page No.: 876-882
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 359

Search

Authors

Hamzah Ali Alkhazaleh

Masri Ayob

Zalinda Othman

Zulkifli Ahmad

Keywords

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

Leave a Comment

Your email address will not be published. Required fields are marked *