The bi-team orienteering problem with time window Online publication date: Mon, 21-May-2018
by Amirhossein Karimi; Mahdi Bashiri
International Journal of Services and Operations Management (IJSOM), Vol. 30, No. 2, 2018
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services and Operations Management (IJSOM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook