TY - GEN
T1 - Heuristics for rich profitable tour problems
AU - Lahyani, Rahma
AU - Khemakhem, Mahdi
AU - Semet, Frederic
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84881407574
U2 - 10.1109/ICMSAO.2013.6552660
DO - 10.1109/ICMSAO.2013.6552660
M3 - Conference contribution
AN - SCOPUS:84881407574
SN - 9781467358149
T3 - 2013 5th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2013
BT - 2013 5th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2013
T2 - 2013 5th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2013
Y2 - 28 April 2013 through 30 April 2013
ER -