Anis Mjirda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
Anis Mjirda has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Nenad Mladenović
GERAD and École des Hautes Études Commerciales
1 shared publication - Pierre Hansen
HEC Montreal
1 shared publication - Raca Todosijević
Univ. Polytechnique Hauts-de-France, LAMIH, CNRS, UMR 8201, Valenciennes, France
1 shared publication - Saïd Hanafi
Université de Valenciennes et du Hainaut-Cambrésis
1 shared publication
Latest Publications
- 6 April 2016
- Published by Wiley in International Transactions in Operational Research
- Vol. 24 (3) , 615-633
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
In a single local search algorithm, several neighborhood structures are usually explored. The simplest way is to define a single neighborhood as the union of all predefined neighborhood structures; the other possibility is to make an order (or sequence) of the predefined neighborhoods, and to use them in the first improvement or the best improvement fashion, following that order. In this work, first we classify possible variants of sequential use of neighborhoods and then, empirically analyze them in solving the classical traveling salesman problem (TSP). We explore the most commonly used TSP neighborhood structures, such as 2‐opt and insertion neighborhoods. In our empirical study, we tested 76 different such heuristics on 15,200 random test instances. Several interesting observations are derived. In addition, the two best of 76 heuristics (used as local searches within a variable neighborhood search) are tested on 23 test instances taken from the TSP library (TSPLIB). It appears that the union of neighborhoods does not perform well.
- 6 April 2016
- Published by Wiley in International Transactions in Operational Research
- Vol. 24 (3) , 615-633
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
In a single local search algorithm, several neighborhood structures are usually explored. The simplest way is to define a single neighborhood as the union of all predefined neighborhood structures; the other possibility is to make an order (or sequence) of the predefined neighborhoods, and to use them in the first improvement or the best improvement fashion, following that order. In this work, first we classify possible variants of sequential use of neighborhoods and then, empirically analyze them in solving the classical traveling salesman problem (TSP). We explore the most commonly used TSP neighborhood structures, such as 2‐opt and insertion neighborhoods. In our empirical study, we tested 76 different such heuristics on 15,200 random test instances. Several interesting observations are derived. In addition, the two best of 76 heuristics (used as local searches within a variable neighborhood search) are tested on 23 test instances taken from the TSP library (TSPLIB). It appears that the union of neighborhoods does not perform well.