The bi-team orienteering problem with time window

Amirhossein Karimi and Mahdi Bashiri

International Journal of Services and Operations Management, 2018, vol. 30, issue 2, 203-225

Abstract: 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.

Keywords: team orienteering; time window; bi-objective; GRASP; NSGA-II; greedy algorithm. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=91906 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:30:y:2018:i:2:p:203-225

Access Statistics for this article

More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().