Forthcoming articles

International Journal of Metaheuristics

International Journal of Metaheuristics (IJMHeur)

These articles have been peer-reviewed and accepted for publication 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.

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

Open AccessArticles 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.
We also offer which provide timely updates of tables of contents, newly published articles and calls for papers.

International Journal of Metaheuristics (6 papers in press)

Regular Issues

  • 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.

  • Solving high dimensional multimodal continuous optimization problems using hybridization between particle swarm optimization variants   Order a copy of this article
    by Hugo Deschenes, Caroline Gagne 
    Abstract: This paper presents a comparison between three new hybridizations using three Particle Swarm Optimization (PSO) variants: The Barebones PSO (BPSO), the Comprehensive Learning PSO (CLPSO) and the Cooperative Learning PSO (CoLPSO). The goal of these hybridizations is to improve the exploration and the exploitation of the search space from these three variants and contributes to PSO on high scale continuous optimization problems. The performance of these three new hybrids, named HCLBPSO-Half, HBPSO+CL and HCoCLPSO, are compared with the original methods on which they are based. The comparison is done using 6 classical continuous optimization functions with dimensions set to 50, 100 and 200, and all 15 continuous optimization functions from the CEC15 benchmark with dimensions set to 10, 30, 50 and 100. The results are compared using the mean and median of executions.
    Keywords: metaheuristics; continuous optimization; particle swarm optimization; hybridization; variants; high dimensional problems.

  • Shuffled Teaching Learning Based Algorithm for solving Robot Path Planning Problem   Order a copy of this article
    by Geetanjali Singh, Nirmala Sharma, Harish Sharma 
    Abstract: To evade the big and destructive obstacles in the real world scenario, such as bomb blast, nuclear activities, and fire breakdowns, robots are necessary. Robot Path Planning (RPP) problem (finding the optimal traveling path between source to destination) is one of the interesting NP-hard problems in the world of robotics. The RPP problem can be dealt with, using swarm intelligence (SI) based optimization algorithms. Teaching Learning Based Optimization (TLBO) algorithm is a very efficient and reliable swarm intelligence based algorithm in the history of optimization. This paper proposed a hybridized version of TLBO with shuffled frog leaping algorithm (SFLA) to improve the efficiency in terms of exploitation and to overcome the slow convergence rate. The proposed variant is named as Shuffled Teaching Learning Based Optimization (STLBO) algorithm. For checking the efficiency and accuracy of the proposed STLBO, it is applied to 12 continuous benchmark functions and compared with different nature-inspired algorithms (NIA), namely TLBO, SFLA, particle swarm optimization (PSO), gravitational search algorithm (GSA), covariance matrix adaptation evolution strategy (CMAES), and biogeography based optimization (BBO). To check the robustness of the propounded STLBO, it is implemented to solve the problem of path planning of the robots starting from the source node to the destination node. Through simulation results and statistical analyses, the effectiveness of the proposed STLBO is proved in the field of SI based algorithms.
    Keywords: Teaching learning based optimization; Shuffled frog leaping algorithm; Robot path planning; Swarm intelligence based algorithm; Optimization.

  • An Adaptive Optimization Algorithm Based on Modified Whale Optimization Algorithm and Laplace Crossover   Order a copy of this article
    by Lamiaa El Bakrawy 
    Abstract: Whale optimization algorithm (WOA) is a new bio-inspired algorithm which mimics the hunting behavior of humpback whale in nature. Standard WOA is easily trapped in local optima, provide slow convergence rate and lack of diversity, as the dimension of the search space expansion. In this paper, modified whale optimization algorithm (MWOA) is proposed to improve the the quality of standard WOA algorithm performance. Moreover, an adaptive optimization algorithm based on modified whale optimization algorithm and Laplace Crossover (ALMWOA) is presented in this paper to increase the diversity of search space and enhance the capability to avoid local optimal solutions. The proposed MWOA and ALMWOA algorithms are tested on a set of twenty three benchmark functions and the results are compared with standard WOA and other well-known metaheuristic optimization algorithms. Experimental results show that MWOA and ALMWOA can significantly outperform other optimization algorithms in most of benchmark functions.
    Keywords: Whale Optimization Algorithm; Benchmark Functions; Meta- Heuristic Optimization Algorithms; Laplace Crossover.

  • Solving Crew Rostering Using Metaheuristics, A Case Study in Indonesia   Order a copy of this article
    by Budi Santosa, Maria Krisnawati, Ahmad Rusdiansyah 
    Abstract: This paper presents the application of metaheuristics to solve crew rostering problem in an airline company. Many optimization methods have been developed to improve both roster quality and computational time in the similar case. This paper proposes simple iterative mutation (SIMA) method to solve real airline crew rostering problem in Indonesia Merpati Airlines (MNA). The proposed method is originated from genetic algorithm. Unlike genetics algorithm which is commonly used, the proposed method consists of only three steps including initialization, selection, and mutation.. To evaluate the performance of the proposed method, the results are compared to those of cross entropy, differential evolution, genetic algorithm and MOSI (method used by the airline) in minimizing number of assigned crews to cover all of scheduled flights. From the experiments, SIMA method produced better results in term of roster quality and computational time.
    Keywords: airline crew; cross entropy; differential evolution; rostering; genetic algorithm; roster quality.

Special Issue on: Analysis and Implementation of Nature-Inspired Algorithms

  • Twitter Sentiment analysis using hybrid Grey Wolf Optimizer method   Order a copy of this article
    by Rekha Kushwaha 
    Abstract: In recent years, the use of social media has increased excessively. A large amount of data expressing the feelings of millions of people is available on social media. Sentiment Analysis (SA) is one of the mechanisms to analyze these feelings. It is an outstanding field of data mining which concerns the recognition and interpretation of sentiments available on social media. This paper is concerned about the extraction of sentiments from the well known social media website, Twitter. On Twitter, people can express their opinions in the term of tweets. Tweets can be either a review or a comment possibly, which can be +ve, -ve or neutral. Because of the subjective behaviour of tweets, sentiments analysis is considered as a complex problem that is very difficult to deal with the available conventional strategies. In this paper, a hybrid mechanism is introduced, namely Hybrid Grey-Wolf-Optimizer with K-means clustering (GWOK) to find the optimal heads of the clusters of the available dataset. The accuracy and efficiency of the proposed mechanism are analyzed on two datasets: sander2 and twitter dataset. The obtained outcomes of the proposed mechanism are compared with some state-of-art approaches of Nature-Inspired algorithms such as Particle-Swarm algorithm, Genetic-Algorithm, Cuckoo-Search, and Differential Evolution. These outcomes prove the efficiency and accuracy of the proposed mechanism to solve the Twitter sentiment analysis problem.
    Keywords: Sentiment-Analysis (SA); Twitter; Nature-Inspired-Algorithm; Machine learning techniques; Optimization; K-means clustering; Grey-Wolf-Optimizer;.