Heuristics for rich profitable tour problems

Rahma Lahyani (1) , Mahdi Khemakhem (2) , Frédéric Semet (1)

1 LAGIS-OSL
2 LOGIQ

We present a Rich variant of the Profitable Tour Problem (RPTP) arising when customer requests involve several products and multi-compartment vehicles are used. The RPTP addressed may be considered as a variant of the capacitated profitable tour problem with time windows and incompatibility constraints. We propose a Variable Neighborhood Search Algorithm embedded with an Adaptive Large Neighborhood Search for the RPTP. This method includes a perturbation phase based on the Ruin and Recreate paradigm. The efficiency of the proposed algorithm is assessed by solving the instances of the Orienteering Problem with Time Windows.

Domaines: Recherche opérationnelle [math.OC]

Rahma Lahyani, Mahdi Khemakhem, Frédéric Semet. Heuristics for rich profitable tour problems. Proceedings of the 5th International Conference on Modeling, Simulation and Applied Optimization, IEEE International Conference, Apr 2013, HAMMAMET, Tunisia. pp.978-1-4673-5814-9/13/$31.00 2013 IEEE. ⟨hal-00828971⟩