- Ines Sbai, Saoussen Krichen, Olfa Limam. Solving the capacitated vehicle routing problem with two-dimensional loading constraints using a parallel VNS approach. IJMHeur, 8(1):51-78, 2022.
- Sarah Madi, Ahmed Riadh Baba-Ali. A multi-stage genetic algorithm for instance selection dedicated to k nearest neighbours classification: application to robot wall following problem. IJMHeur, 8(1):79-96, 2022.
- Håkon Bentsen, Lars Magnus Hvattum. Variable neighbourhood search for binary integer programming problems. IJMHeur, 8(1):1-26, 2022.
- Ali Kansou, Bilal Kanso. Hybrid metaheuristics for the periodic open arc routing problem. IJMHeur, 8(1):27-50, 2022.
- Geetanjali Singh, Nirmala Sharma, Harish Sharma. Shuffled teaching learning-based algorithm for solving robot path planning problem. IJMHeur, 7(3):265-283, 2020.
- Hugo Deschênes, Caroline Gagné. Solving high dimensional multimodal continuous optimisation problems using hybridisation between particle swarm optimisation variants. IJMHeur, 7(3):239-264, 2020.
- Paulo Neis, Rhyd Lewis. Evaluating the influence of parameter setup on the performance of heuristics for the graph colouring problem. IJMHeur, 7(4):352-378, 2020.
- Marieme Diallo, Alejandro Quintero, Samuel Pierre. A Tabu search approach for a virtual networks splitting strategy across multiple cloud providers. IJMHeur, 7(3):197-238, 2020.
- Amaro de Sousa, Gabriela Gallo, Santiago Gutierrez, Franco Robledo, Pablo Rodríguez-Bocca, Pablo Romero. A tree-block decomposition-based heuristic for the minimum broadcast time. IJMHeur, 7(4):379-401, 2020.
- Dylan Gaspar, Yun Lu, Myung Soon Song, Francis J. Vasko. Simple population-based metaheuristics for the multiple demand multiple-choice multidimensional knapsack problem. IJMHeur, 7(4):330-351, 2020.