The bi-team orienteering problem with time window

Amirhossein Karimi, Mahdi Bashiri

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


In this paper three algorithms are designed to solve the bi-team orienteering problem with time window (BTOPTW) in which the aim is to minimise the total travel cost as well as maximising the score gained by the salesmen. In one of them, a greedy algorithm tries to select the best solution from the initial solutions by a greedy procedure. The other algorithm constructs a solution by the GRASP and searches its neighbour solutions. The last algorithm is an extended version of previous algorithm augmented by the NSGA-II. Evaluation of the algorithms performances is done by comparing the results of the algorithm with the result of the improved augmented epsilon constraint (AUGMECON2) approach by some measures such as non-dominated Pareto size (NPS), spacing metric (SM), generational distance (GD), inverse generational distance (IGD) and set coverage metric (CS). The results confirm that NSGA-II algorithm has got satisfactory efficiency in an acceptable computational time.

Original languageEnglish
Pages (from-to)203-225
Number of pages23
JournalInternational Journal of Services and Operations Management
Issue number2
Publication statusPublished - 10 May 2018
Externally publishedYes


  • Bi-objective
  • Greedy algorithm
  • Team orienteering
  • Time window

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Management of Technology and Innovation
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'The bi-team orienteering problem with time window'. Together they form a unique fingerprint.

Cite this