J. Riera-Ledesma, J. J. Salazar Gonzalez

We consider in this work the Team Orienteering Arc Routing Problem. It is a variation of the well known Team Orienteering Problem where the set of customers is given by a subset of arcs in a directed graph. In this problem a set of vehicles has to mandatorily visit a subset of the customers. There is also a profit associated with the remaining ones, thus, in some circumstances is convenient visiting some of these customers. The time consumed by each vehicle along the route is bounded. We propose a set partitioning formulation for this problem, leading to a column generation algorithm. The performance of this algorithm has been studied on a wide family of benchmark test instances . We have observed that, as the number of vehicles grows, our proposal shows a better performance than other previous exact algorithms in the literature.

Keywords: team orienteering arc routing problem, profits, multivehicle, branch-and-price-and-cut


F1 Routing 1
October 2, 2015  9:00 AM
Salón de actos

Other papers in the same session

Multi-period Vehicle Routing Problem with Due Dates

C. Archetti, O. Jabali, M. G. Speranza

Benders decomposition for the OCSTP

E. Fernández, C. Luna-Mota

Vehicle Routing Problem with Shared Customers

M. Roca-Riu, E. Fernández, G. Speranza

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.