E. Fernández Aréizaga, G. Laporte, G. Reinelt, J. Rodríguez Pereira
Target Visitation problems combine features from Linear Ordering and Vehicle Routing. There exist profits (targets) associated with the relative order in which demand requests are served, as well as costs incurred by the routes defined to provide service.
We study a Target Visitation problem where demand is located at some edges of a given graph and targets correspond to the components induced by demand edges. Furthermore, it is imposed that, once a component is visited, all demand edges in the component are served before leaving it.
The problem is formally introduced and a mathematical programming formulation that exploits some optimality conditions is given. We also present several families of valid inequalities as well as separation procedures for the families of constraints of exponential size. A branch-and-cut solution algorithm is proposed and the results of computational experiments are presented and analyzed.
Palabras clave / Keywords: target visitation, vehicle routing, linear ordering
Programado
Sesión bilateral SEIO-SMIO: Optimización Discreta en Logística y Transporte (Organizadores: Juan Antonio Díaz García y Elena Fernández)
30 de mayo de 2018 10:50
Sala Cristal
