A matheuristic approach to the orienteering problem with service time dependent profits

Qinxiao Yu, Kan Fang, Ning Zhu and Shoufeng Ma

European Journal of Operational Research, 2019, vol. 273, issue 2, 488-503

Abstract: This paper addresses the orienteering problem with service time dependent profits (OPSTP), in which the profit collected at each vertex is characterized by a nonlinear function of service time, and the objective is to maximize the total profits by determining a subset of the vertices to be visited and assigning appropriate service time to each of them within a given time budget. To solve this problem, a mixed integer nonlinear programming model is formulated, and a two-phase matheuristic algorithm that consists of a tabu search method and a nonlinear programming is implemented. Extensive computational experiments are conducted on both randomly generated instances and instances that are adapted from the TSPLIB. The results show that our proposed matheuristic algorithm could be quite effective in finding good-quality solutions.

Keywords: Routing; Orienteering problem; Service time dependent profits; Matheuristic algorithm; Nonlinear programming (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221718306842
Full text for ScienceDirect subscribers only

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:eee:ejores:v:273:y:2019:i:2:p:488-503

DOI: 10.1016/j.ejor.2018.08.007

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().