Search results

1 – 3 of 3
Per page
102050
Citations:
Loading...
Access Restricted. View access options
Article
Publication date: 26 March 2021

Raja Masadeh, Nesreen Alsharman, Ahmad Sharieh, Basel A. Mahafzah and Arafat Abdulrahman

Sea Lion Optimization (SLnO) algorithm involves the ability of exploration and exploitation phases, and it is able to solve combinatorial optimization problems. For these reasons…

148

Abstract

Purpose

Sea Lion Optimization (SLnO) algorithm involves the ability of exploration and exploitation phases, and it is able to solve combinatorial optimization problems. For these reasons, it is considered a global optimizer. The scheduling operation is completed by imitating the hunting behavior of sea lions.

Design/methodology/approach

Cloud computing (CC) is a type of distributed computing, contributory in a massive number of available resources and demands, and its goal is sharing the resources as services over the internet. Because of the optimal using of these services is everlasting challenge, the issue of task scheduling in CC is significant. In this paper, a task scheduling technique for CC based on SLnO and multiple-objective model are proposed. It enables decreasing in overall completion time, cost and power consumption; and maximizes the resources utilization. The simulation results on the tested data illustrated that the SLnO scheduler performed better performance than other state-of-the-art schedulers in terms of makespan, cost, energy consumption, resources utilization and degree of imbalance.

Findings

The performance of the SLnO, Vocalization of Whale Optimization Algorithm (VWOA), Whale Optimization Algorithm (WOA), Grey Wolf Optimization (GWO) and Round Robin (RR) algorithms for 100, 200, 300, 400 and 500 independent cloud tasks on 8, 16 and 32 VMs was evaluated. The results show that SLnO algorithm has better performance than VWOA, WOA, GWO and RR in terms of makespan and imbalance degree. In addition, SLnO exhausts less power than VWOA, WOA, GWO and RR. More precisely, SLnO conserves 5.6, 21.96, 22.7 and 73.98% energy compared to VWOA, WOA, GWO and RR mechanisms, respectively. On the other hand, SLnO algorithm shows better performance than the VWOA and other algorithms. The SLnO algorithm's overall execution cost of scheduling the cloud tasks is minimized by 20.62, 39.9, 42.44 and 46.9% compared with VWOA, WOA, GWO and RR algorithms, respectively. Finally, the SLnO algorithm's average resource utilization is increased by 6, 10, 11.8 and 31.8% compared with those of VWOA, WOA, GWO and RR mechanisms, respectively.

Originality/value

To the best of the authors’ knowledge, this work is original and has not been published elsewhere, nor is it currently under consideration for publication elsewhere.

Details

International Journal of Web Information Systems, vol. 17 no. 2
Type: Research Article
ISSN: 1744-0084

Keywords

Access Restricted. View access options
Article
Publication date: 12 February 2025

Ruizhi Li, Fangzhou Wang, Siqi Liu, Ruiqi Xu, Minghao Yin and Shuli Hu

Maximum k vertex cover problem is a significant combinatorial optimization problem with various applications, such as transportation planning, social networks and sensor…

8

Abstract

Purpose

Maximum k vertex cover problem is a significant combinatorial optimization problem with various applications, such as transportation planning, social networks and sensor placement. Up to now, no practical algorithm has ever been proposed to solve this problem. Therefore, this paper aims to present an efficient local search algorithm LSKVC combining three methods for it.

Design/methodology/approach

First, the quick incremental evaluation method is proposed to update the related vertex scores following each addition or removal incrementally rather than recalculating them, which can speed up the algorithm. Second, the configuration checking method forbids vertices whose configuration has not changed since the last removal from being added into the candidate solution again, which can avoid the cycling problem effectively. Third, the two-stage exchange method swaps the pairs of inside and outside vertices separately rather than simultaneously, which can guarantee the tradeoff between the accuracy and complexity of the algorithm.

Findings

The proposed algorithm LSKVC is compared with the traditional GRASP algorithm and the well-known commercial solver CPLEX on DIMACS and BHOSLIB benchmarks. For the best solutions, the LSKVC algorithm is significantly superior to GRASP and CPLEX on DIMACS instances and the CPLEX solver fails, and the LSKVC algorithm slightly outperforms GRASP on the BHOSLIB instances. In addition, we undertake comparative studies of the offered methodologies and demonstrate their efficacy.

Originality/value

In previous research, the focus on the maximum k-vertex cover problem primarily centered around exact algorithms and approximation algorithms, with limited application of heuristic algorithms. While heuristic algorithms have been well-explored for the closely related Minimum Vertex Cover problem, they have seen limited application in the context of the maximum k-vertex cover problem. Consequently, existing algorithms designed for the Minimum Vertex Cover problem do not exhibit satisfactory performance when applied to the maximum k-vertex cover problem. In response to this challenge, we have undertaken algorithmic improvements specifically tailored to address this issue.

Details

Data Technologies and Applications, vol. ahead-of-print no. ahead-of-print
Type: Research Article
ISSN: 2514-9288

Keywords

Access Restricted. View access options
Article
Publication date: 4 January 2019

Fernanda Gonzalez-Lopez and Guillermo Bustos

The purpose of this paper is to describe the current state of the research field of business process architecture (BPA) and its design methodologies.

1929

Abstract

Purpose

The purpose of this paper is to describe the current state of the research field of business process architecture (BPA) and its design methodologies.

Design/methodology/approach

A systematic literature review (SLR) was conducted using meta- and content-based perspectives.

Findings

From over 6,000 candidate studies, 89 were selected. A fifth of these primary works corresponded to BPA design methodologies. Though the BPA research field remains in an early stage of development, it bears promising growth potential. Regarding BPA design methodologies, the following aspects susceptible for further research were detected: identification and modeling of business process relationships; specification of inputs; standardization of models, notations and tool support; consideration of managerial concerns; integration of knowledge from other areas; and validation of methodological and product quality aspects.

Research limitations/implications

The main limitation of the work lies in not being fully reproducible due to the fixed number of data sources and their digital nature, together with subjective decisions in work selection, data extraction and data analysis.

Originality/value

To the best of the authors’ knowledge no study has yet analyzed the BPA research field by means of an SLR. This study will benefit practitioners and research groups working on this topic by allowing them to get a rigorous overview of the BPA research field with an emphasis on available BPA design methodologies, and become aware of research gaps within the BPA field to position further research.

Details

Business Process Management Journal, vol. 25 no. 6
Type: Research Article
ISSN: 1463-7154

Keywords

1 – 3 of 3
Per page
102050