Skip to Main content Skip to Navigation
Conference papers

Behaviour of a Hybrid ILS Heuristic on the Capacitated Profitable Tour Problem

Hayet Chentli Rachid Ouafi Wahiba Ramdane Cherif-Khettaf 1
1 OPTIMIST - OPTImisation Methods for Integrated SysTems
LORIA - NSS - Department of Networks, Systems and Services
Abstract : In the present paper, we study the behaviour of a hybrid Iterative Local Search heuristic (ILS). A Large Neighborhood Search heuristic (LNS) and a Variable Neighborhood Descent with Random neighborhood ordering (RVND) are used in the local search phase of the proposed ILS. The approach is evaluated on a well-known variant of the Vehicle Routing Problem (VRP) called Capacitated Profitable Tour Problem (CPTP). In this variant, the vehicles are no longer required to visit all the customers. However, a specific profit is obtained each time a customer is visited. The goal of the CPTP is to design routes with maximum difference between collected profits and routing costs, which satisfy the capacity constraint of the vehicles. The experimental study consists in comparing different combinations of ILS, LNS and RVND. The computational results show that the hybridization of the three heuristics leads to better solutions. Furthermore, comparisons with a Variable Neighborhood Search and two Tabu Searches from the literature indicates that our hybrid approach is competitive
Document type :
Conference papers
Complete list of metadatas

https://hal.univ-lorraine.fr/hal-02982814
Contributor : Wahiba Ramdane Cherif-Khettaf <>
Submitted on : Thursday, October 29, 2020 - 2:10:27 AM
Last modification on : Friday, October 30, 2020 - 3:29:44 AM

Links full text

Identifiers

Citation

Hayet Chentli, Rachid Ouafi, Wahiba Ramdane Cherif-Khettaf. Behaviour of a Hybrid ILS Heuristic on the Capacitated Profitable Tour Problem. 7th International Conference on Operations Research and Enterprise Systems, Jan 2018, Funchal, Portugal. pp.115-123, ⟨10.5220/0006630401150123⟩. ⟨hal-02982814⟩

Share

Metrics

Record views

13