Constructive heuristics for team orienteering problems

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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)876-882
Number of pages7
JournalJournal of Applied Sciences
Volume13
Issue number6
DOIs
Publication statusPublished - 2013

Keywords

  • GRASP
  • Greedy heuristic
  • Nearest neighbor
  • Random heuristic
  • Team orienteering problem

ASJC Scopus subject areas

  • General

Cite this

Constructive heuristics for team orienteering problems. / Alkhazaleh, Hamzah Ali; Ayob, Masri; Othman, Zalinda; Ahmad, Zulkifli.

In: Journal of Applied Sciences, Vol. 13, No. 6, 2013, p. 876-882.

Research output: Contribution to journalArticle

Alkhazaleh, Hamzah Ali ; Ayob, Masri ; Othman, Zalinda ; Ahmad, Zulkifli. / Constructive heuristics for team orienteering problems. In: Journal of Applied Sciences. 2013 ; Vol. 13, No. 6. pp. 876-882.
@article{89c87611d9c4478a8ab5726c85e9a64a,
title = "Constructive heuristics for team orienteering problems",
abstract = "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.",
keywords = "GRASP, Greedy heuristic, Nearest neighbor, Random heuristic, Team orienteering problem",
author = "Alkhazaleh, {Hamzah Ali} and Masri Ayob and Zalinda Othman and Zulkifli Ahmad",
year = "2013",
doi = "10.3923/jas.2013.876.882",
language = "English",
volume = "13",
pages = "876--882",
journal = "Journal of Applied Sciences",
issn = "1812-5654",
publisher = "Asian Network for Scientific Information",
number = "6",

}

TY - JOUR

T1 - Constructive heuristics for team orienteering problems

AU - Alkhazaleh, Hamzah Ali

AU - Ayob, Masri

AU - Othman, Zalinda

AU - Ahmad, Zulkifli

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - GRASP

KW - Greedy heuristic

KW - Nearest neighbor

KW - Random heuristic

KW - Team orienteering problem

UR - http://www.scopus.com/inward/record.url?scp=84880151708&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880151708&partnerID=8YFLogxK

U2 - 10.3923/jas.2013.876.882

DO - 10.3923/jas.2013.876.882

M3 - Article

AN - SCOPUS:84880151708

VL - 13

SP - 876

EP - 882

JO - Journal of Applied Sciences

JF - Journal of Applied Sciences

SN - 1812-5654

IS - 6

ER -