Heuristics for rich profitable tour problems

Rahma Lahyani; Mahdi Khemakhem; Frédéric Semet

Back

Conference proceeding

Heuristics for rich profitable tour problems

Rahma Lahyani, Mahdi Khemakhem and Frédéric Semet

ICMSAO'13, pp.978-1-4673-5814-9/13/$31.00 2013 IEEE

Proceedings of the 5th International Conference on Modeling, Simulation and Applied Optimization, IEEE International Conference

29/04/2013

Abstract

Computer Science

Operations Research

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.

Metrics

1 Record Views

Details

Title: Heuristics for rich profitable tour problems
Creators - without role: Rahma Lahyani - LAGIS-OSL
Mahdi Khemakhem - Logiq
Frédéric Semet - LAGIS-OSL
Publication Details: ICMSAO'13, pp.978-1-4673-5814-9/13/$31.00 2013 IEEE
Conference: Proceedings of the 5th International Conference on Modeling, Simulation and Applied Optimization, IEEE International Conference
Identifiers: 9913867908331
Academic Unit: Alfaisal University
Language: English
Resource Type: Conference proceeding