title: Iterated local search algorithm for solving the orienteering problem with soft time windows.
abstract: In this paper we study the orienteering problem with time windows (OPTW) and the impact of relaxing the time windows on the profit collected by the vehicle. The way of relaxing time windows adopted in the orienteering problem with soft time windows (OPSTW) that we study in this research is a late service relaxation that allows linearly penalized late services to customers. We solve this problem heuristically by considering a hybrid iterated local search. The results of the computational study show that the proposed approach is able to achieve promising solutions on the OPTW test instances available in the literature, one new best solution is found. On the newly generated test instances of the OPSTW, the results show that the profit collected by the OPSTW is better than the profit collected by the OPTW.
authors: Laboratoire Informatique et Aide à la Décision (LIAD), Département de Mathématiques et Informatique, Faculté des Sciences Aïn Chock, Université Hassan II de Casablanca, Km 8 Route d'El Jadida, 5366 Maarif, 20100 Casablanca, Morocco.
authors: Brahim
authors: B
authors: Aghezzaf
authors: Laboratoire Informatique et Aide à la Décision (LIAD), Département de Mathématiques et Informatique, Faculté des Sciences Aïn Chock, Université Hassan II de Casablanca, Km 8 Route d'El Jadida, 5366 Maarif, 20100 Casablanca, Morocco.
authors: Hassan El
authors: HE
authors: Fahim
keywords: Combinatorial optimization; Iterated local search; Orienteering problem; Soft time window; Variable neighborhood search