Forthcoming articles


International Journal of Metaheuristics


These articles have been peer-reviewed and accepted for publication in IJMHeur, but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.


Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.


Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.


Articles marked with this Open Access icon are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.


Register for our alerting service, which notifies you by email when new issues of IJMHeur are published online.


We also offer RSS feeds which provide timely updates of tables of contents, newly published articles and calls for papers.


International Journal of Metaheuristics (5 papers in press)


Regular Issues


  • Solution attractor of local search in traveling salesman problem (part 2): computational study   Order a copy of this article
    by Weiqi Li, Xue Li 
    Abstract: This paper is the second part of our study. In the first part, we introduce the concept of solution attractor of local search system for the Traveling Salesman Problem (TSP), describe a procedure for constructing the solution attractor, and present an attractor-based search system to solve the dynamic multi-objective TSP. In this paper, we report the results of our recent empirical study on some important properties of the solution attractor of local search system for the TSP. These properties include the nature of convergence of local search trajectories, the size of the constructed solution attractor, the relationship between the size of the problem and the size of the constructed solution attractor, the best tour in the solution attractor, and computational complexity in the attractor-based search system.
    Keywords: traveling salesman problem; global optimization; analysis of heuristics; convergence of local search; solution attractor.

  • A Structural Taxonomy for Metaheuristic Optimization Search Methods   Order a copy of this article
    by Raymond R. Hill, Edward Pohl 
    Abstract: Metaheuristic search algorithms have become ubiquitous in the applied optimization world. Various works have appeared classifying and improving these algorithms and the particular processes embedded within the algorithms. Successful metaheuristic approaches have a common general structure to their search processes. To this end, we offer a structural taxonomy of metaheuristic search methods. This taxonomy serves as a framework for constructing and evaluating metaheuristic approaches from a general structural perspective as well as for conducting empirical research regarding the effectiveness of more detailed structural components. Implementation mechanisms of the detailed components within each structural component is left for future taxonomy research and development.
    Keywords: heuristic optimization; taxonomy; metaheuristics; intensification; diversification; adaptive memory.

  • Solving the maximum clique problem with a hybrid algorithm   Order a copy of this article
    by Derek Smith, Stephanie Perkins, Roberto Montemanni 
    Abstract: A hybrid algorithm for the maximum clique problem is presented. A heuristic is used to generate cliques and these are improved by some simple optimizations and tabu search. All components of the algorithm make use of a pseudoexact algorithm, which is an exact algorithm with some specialized pruning. Preprocessing is useful for some instances. The algorithm is shown to be successful using standard and new benchmarks.
    Keywords: combinatorial optimization; maximum clique; hybrid algorithm; tabu search; pseudoexact algorithm; preprocessing; benchmarks.

  • Bio-inspired Metaheuristics for the Generalized Discrete Cost Multicommodity Network Design Problem   Order a copy of this article
    Abstract: We investigate a new variant of Network Design Problems (NDPs) called the Generalized Discrete Cost Multicommodity Network Design Problem (GDCMNDP) that arises in a wide variety of real-life situations such as transportation, telecommunication and logistics. The problem consists on identifying the optimal capacitated network by choosing the connections to be installed in order to satisfy partially or totally the multicommodity demands. The objective is to minimize the total system cost, computed as the sum of fixed network costs and penalty costs due to the unrouted demands while installing at most one facility/connection on each edge. For the GDCMNDP, we propose a compact mixed integer linear programming formulation that we solve exactly by a commercial MIP solver. Moreover, we develop three basic greedy heuristics and tow bio-inspired metaheuristics: a basic genetic algorithm, a hybrid genetic algorithm via a variable neighbourhood search procedure and a biogeography-based optimization heuristic. To assess the performance of the proposed approaches, computational results are reported using real-world and benchmark instances from the literature. Computational results show that our hybrid genetic algorithm performs well by obtaining very good final solutions in reasonable times.
    Keywords: Network Design Problems; Metaheuristics; Hybrid Genetic Algorithm; Biogeography-Based Optimization.

Special Issue on: Randomised Heuristics for Communication Networks

  • A Tabu Search Approach for a Virtual Networks Splitting Strategy Across Multiple Cloud Providers   Order a copy of this article
    by Marieme Diallo, Alejandro Quintero, Samuel Pierre 
    Abstract: This paper addresses the problem of computational and networking resources embedding across multiple independent cloud providers (CPs). We focus on the splitting phase problem by proposing a virtual network requests (VNRs) splitting strategy, which aims at improving the performance and the quality of service (QoS) of resulting mapped VNR segments. We formalize our splitting strategy as a mathematical maximization problem with constraints by using an Integer Linear Program (ILP). Since the VNRs splitting process is classified as an NP-hard problem, we propose a metaheuristic approach based on the Tabu Search (TS), in order to find good feasible solutions in polynomial solving time. The simulations results obtained show the efficiency of the proposed algorithm, in comparison with the exact method and an other baseline approach. Solution costs are on average close to the upper bounds, with an average gap ranging from 0% to a maximum of 2.97%, performed in a highly reduced computing time.
    Keywords: Cloud computing; virtualized network infrastructures; resource splitting; optimization; metaheuristics; Tabu Search.