Search results

The human resource (HR) allocation problem is one of the critical dimensions of the project management process. Due to this nature of the problem, researchers are continually optimizing one or more critical scheduling and allocation challenges in different ways. This study aims to optimize two goals, increasing customer satisfaction and reducing costs using the imperialist competitive algorithm.

Cloud-based e-commerce applications are preferred to conventional systems because they can save money in many areas, including resource use, running expenses, capital costs, maintenance and operation costs. In web applications, its core functionality of performance enhancement and automated device recovery is important. HR knowledge, expertise and competencies are becoming increasingly valuable carriers for organizational competitive advantage. As a result, HR management is becoming more relevant, as it seeks to channel all of the workers’ energy into meeting the organizational strategic objectives. The allocation of resources to maximize benefit or minimize cost is known as the resource allocation problem. Since discovering solutions in polynomial time is complicated, HR allocation in cloud-based e-commerce is an Nondeterministic Polynomial time (NP)-hard problem. In this paper, to promote the respective strengths and minimize the weaknesses, the imperialist competitive algorithm is suggested to solve these issues. The imperialist competitive algorithm is tested by comparing it to the literature’s novel algorithms using a simulation.

Empirical outcomes have illustrated that the suggested hybrid method achieves higher performance in discovering the appropriate HR allocation than some modern techniques.

The paper presents a useful method for improving HR allocation methods. The MATLAB-based simulation results have indicated that costs and waiting time have been improved compared to other algorithms, which cause the high application of this method in practical projects.

The main novelty of this paper is using an imperialist competitive algorithm for finding the best solution to the HR allocation problem in cloud-based e-commerce.

Load balancing is an important issue for a heterogeneous distributed computing system environment that has been proven to be a nondeterministic polynomial time hard problem. This paper aims to propose a resource-aware load balancing (REAL) model for a batch of independent tasks with a centralized load balancer to make the solution appropriate for a practical heterogeneous distributed environment having a migration cost with the objective of maximizing the level of load balancing considering bandwidth requirements for migration of the tasks.

To achieve the effective schedule, load balancing issues should be addressed and tackled through efficient workload distribution. In this approach, the migration has been carried out in two phases, namely, initial migration and best-fit migration. Using the best-fit policy in migrations helps in the possible performance improvement by minimizing the remaining idle slots on underloaded nodes that remain unentertained during the initial migration.

The experimental results reveal that the proposed model exhibits a superior performance among the other strategies on considered parameters such as makespan, average utilization and level of load balancing under study for a heterogeneous distributed environment.

Design of the REAL model and a comparative performance evaluation with LBSM and ITSLB have been conducted by using MATLAB 8.5.0.

The Web is the largest repository of information. Personal information is usually scattered on various pages of different websites. Search engines have made it easier to find personal information. An attacker may collect a user's scattered information together via search engines, and infer some privacy information. The authors call this kind of privacy attack “Privacy Inference Attack via Search Engines”. The purpose of this paper is to provide a user‐side automatic detection service for detecting the privacy leakage before publishing personal information.

In this paper, the authors propose a user‐side automatic detection service. In the user‐side service, the authors construct a user information correlation (UICA) graph to model the association between user information returned by search engines. The privacy inference attack is mapped into a decision problem of searching a privacy inferring path with the maximal probability in the UICA graph and it is proved that it is a nondeterministic polynomial time (NP)‐complete problem by a two‐step reduction. A Privacy Leakage Detection Probability (PLD‐Probability) algorithm is proposed to find the privacy inferring path: it combines two significant factors which can influence the vertexes' probability in the UICA graph and uses greedy algorithm to find the privacy inferring path.

The authors reveal that privacy inferring attack via search engines is very serious in real life. In this paper, a user‐side automatic detection service is proposed to detect the risk of privacy inferring. The authors make three kinds of experiments to evaluate the seriousness of privacy leakage problem and the performance of methods proposed in this paper. The results show that the algorithm for the service is reasonable and effective.

The paper introduces a new family of privacy attacks on the Web: privacy inferring attack via search engines and presents a privacy inferring model to describe the process and principles of personal privacy inferring attack via search engines. A user‐side automatic detection service is proposed to detect the privacy inference before publishing personal information. In this user‐side service, the authors propose a Privacy Leakage Detection Probability (PLD‐Probability) algorithm. Extensive experiments show these methods are reasonable and effective.

This paper follows a systematic literature review (SLR) method covering the published studies until March 2021. The authors have extracted the related studies from different online databases utilizing quality-assessment-criteria. In order to review high-quality studies, 32 papers have been chosen through the paper selection process. The selected papers have been categorized into three main groups, decision-making methods (17 papers), meta-heuristic methods (8 papers) and fuzzy-based methods (7 papers). The existing methods in each group have been examined based on important qualitative parameters, namely, time, cost, scalability, efficiency, availability and reliability.

Cloud computing is known as one of the superior technologies to perform large-scale and complex computing. With the growing tendency of network service users to utilize cloud computing, web service providers are encouraged to provide services with various functional and non-functional features and supply them in a service pool. In this regard, choosing the most appropriate services to fulfill users' requirements becomes a challenging problem. Since the problem of service selection in a cloud environment is known as a nondeterministic polynomial time (NP)-hard problem, many efforts have been made in recent years. Therefore, this paper aims to study and assess the existing service selection approaches in cloud computing.

The obtained results indicate that in decision-making methods, the assignment of proper weights to the criteria has a high impact on service ranking accuracy. Also, since service selection in cloud computing is known as an NP-hard problem, utilizing meta-heuristic algorithms to solve this problem offers interesting advantages compared to other approaches in discovering better solutions with less computational effort and moving quickly toward very good solutions. On the other hand, since fuzzy-based service selection approaches offer search results visually and cover quality of service (QoS) requirements of users, this kind of method is able to facilitate enhanced user experience.

Although the current paper aimed to provide a comprehensive study, there were some limitations. Since the authors have applied some filters to select the studies, some effective works may have been ignored. Generally, this paper has focused on journal papers and some effective works published in conferences. Moreover, the works published in non-English formats have been excluded. To discover relevant studies, the authors have chosen Google Scholar as a popular electronic database. Although Google Scholar can offer the most valid approaches, some suitable papers may not be observed during the process of article selection.

The outcome of the current paper will be useful and valuable for scholars, and it can be a roadmap to help future researchers enrich and improve their innovations. By assessing the recent efforts in service selection in cloud computing and offering an up-to-date comparison of the discussed works, this paper can be a solid foundation for understanding the different aspects of service selection.

Although service selection approaches have essential impacts on cloud computing, there is still a lack of a detailed and comprehensive study about reviewing and assessing existing mechanisms in this field. Therefore, the current paper adopts a systematic method to cover this gap. The obtained results in this paper can help the researchers interested in the field of service selection. Generally, the authors have aimed to specify existing challenges, characterize the efficient efforts and suggest some directions for upcoming studies.

This paper aims to study a generalized type of mixed-model assembly line with multi-manned workstations where multiple workers simultaneously perform different tasks on the same product. This special kind of assembly line is usually utilized to assemble different models of large products, such as buses and trucks, on the same production line.

To solve the mixed-model multi-manned assembly line balancing problem optimally, a new mixed-integer-programming (MIP) model is presented. The proposed MIP model is nondeterministic polynomial-time (NP)-hard, and as a result, a simulated annealing (SA) algorithm is developed to find the optimal or near-optimal solution in a small amount of computation time.

The performance of the proposed algorithm is examined for several test problems in terms of solution quality and running time. The experimental results show that the proposed algorithm has a satisfactory performance from computational time efficiency and solution accuracy.

This research is the very first study that minimizes the number of workers and workstations simultaneously, with a higher priority set for the number of workers, in a mixed-model multi-manned assembly line setting using a novel MIP model and an SA algorithm.

Conventional diagnostic techniques, on the other hand, may be prone to subjectivity since they depend on assessment of motions that are often subtle to individual eyes and hence hard to classify, potentially resulting in misdiagnosis. Meanwhile, early nonmotor signs of Parkinson’s disease (PD) can be mild and may be due to variety of other conditions. As a result, these signs are usually ignored, making early PD diagnosis difficult. Machine learning approaches for PD classification and healthy controls or individuals with similar medical symptoms have been introduced to solve these problems and to enhance the diagnostic and assessment processes of PD (like, movement disorders or other Parkinsonian syndromes).

Medical observations and evaluation of medical symptoms, including characterization of a wide range of motor indications, are commonly used to diagnose PD. The quantity of the data being processed has grown in the last five years; feature selection has become a prerequisite before any classification. This study introduces a feature selection method based on the score-based artificial fish swarm algorithm (SAFSA) to overcome this issue.

This study adds to the accuracy of PD identification by reducing the amount of chosen vocal features while to use the most recent and largest publicly accessible database. Feature subset selection in PD detection techniques starts by eliminating features that are not relevant or redundant. According to a few objective functions, features subset chosen should provide the best performance.

In many situations, this is an Nondeterministic Polynomial Time (NP-Hard) issue. This method enhances the PD detection rate by selecting the most essential features from the database. To begin, the data set's dimensionality is reduced using Singular Value Decomposition dimensionality technique. Next, Biogeography-Based Optimization (BBO) for feature selection; the weight value is a vital parameter for finding the best features in PD classification.

PD classification is done by using ensemble learning classification approaches such as hybrid classifier of fuzzy K-nearest neighbor, kernel support vector machines, fuzzy convolutional neural network and random forest. The suggested classifiers are trained using data from UCI ML repository, and their results are verified using leave-one-person-out cross validation. The measures employed to assess the classifier efficiency include accuracy, F-measure, Matthews correlation coefficient.

This paper studies the preemptive scheduling problem of independent jobs on identical machines. The purpose of this paper is to minimize the makespan under the imposed constraints, namely, the ones that relate the transportation delays which are required to transport a preempted job from one machine to another. This study considers the case when the transportation delays are variable.

The contribution is twofold. First, this study proposes a new linear programming formulation in real and binary decision variables. Then, this study proposes and implements a solution strategy, which consists of two stages. The goal of the first stage is to obtain the best machines order using a local search strategy. For the second stage, the objective is to determine the best possible sequence of jobs. To solve the preemptive scheduling problem with transportation delays, this study proposes a heuristic and two metaheuristics (simulated annealing and variable neighborhood search), each with two modes of evaluation.

Computational experiments are presented and discussed on randomly generated instances.

The study has implications in various industrial environments when the preemption of jobs is allowed.

This study proposes a new linear programming formulation for the problem with variable transportation delays as well as a corresponding heuristic and metaheuristics.

Drugs are strategic products with essential functions in human health. An optimum design of the pharmaceutical supply chain is critical to avoid economic damage and adverse effects on human health. The vehicle-routing problem, focused on finding the lowest-cost routes with available vehicles and constraints, such as time constraints and road length, is an important aspect of this. In this paper, the vehicle routing problem (VRP) for a pharmaceutical company in Turkey is discussed.

A mixed-integer programming (MIP) model based on the vehicle routing problem with time windows (VRPTW) is presented, aiming to minimize the total route cost with certain constraints. As the model provides an optimum solution for small problem sizes with the GUROBI® solver, for large problem sizes, metaheuristic methods that simulate annealing and adaptive large neighborhood search algorithms are proposed. A real dataset was used to analyze the effectiveness of the metaheuristic algorithms. The proposed simulated annealing (SA) and adaptive large neighborhood search (ALNS) were evaluated and compared against GUROBI® and each other through a set of real problem instances.

The model is solved optimally for a small-sized dataset with exact algorithms; for solving a larger dataset, however, metaheuristic algorithms require significantly lesser time. For the problem addressed in this study, while the metaheuristic algorithms obtained the optimum solution in less than one minute, the solution in the GUROBI® solver was limited to one hour and three hours, and no solution could be obtained in this time interval.

The VRPTW problem presented in this paper is a real-life problem. The vehicle fleet owned by the factory cannot be transported between certain suppliers, which complicates the solution of the problem.

This research is designed to optimize the business process of a green tea dealer, who is a key supply chain partner of the Sri Lankan tea industry. The most appropriate trips for each vehicle in multiple trip routing systems are identified to minimize the total cost by considering the traveling distance.

The study has followed the concepts in vehicle routing problems and mixed-integer programming mathematical techniques. The model was coded with the Python programming language and was solved with the CPLEX Optimization solver version 12.10. In total, 20 data instances were used from the subjected green tea dealer for the validation of the model.

The result of the numerical experiment showed the ability to access supply over the full capacity of the available fleet. The model achieved optimal traveling distance for all the instances, with the capability of saving 17% of daily transpiration cost as an average.

This study contributes to the three index mixed-integer programing model formulation through in-depth analysis and combination of several extensions of vehicle routing problem.

This study contributes to the three index mixed-integer programming model formulation through in-depth analysis and combination of several extensions of the vehicle routing problem.

The proposed model provides a cost-effective optimal routing plan to the green tea dealer, which satisfies all the practical situations by following the multiple trip vehicle routing problems. Licensee green tea dealer is able to have an optimal fleet size, which is always less than the original fleet size. Elimination of a vehicle from the fleet has the capability of reducing the workforce. Hence, this provides managerial implication for the optimal fleet sizing and route designing.

Developing an optimization model for a tea dealer in Sri Lankan context is important, as this a complex real world case which has a significant importance in export economy of the country and which has not been analyzed or optimized through any previous research effort.

Heuristic algorithms have been widely used in different types of optimization problems. Their unique features in terms of running time and flexibility have made them superior to deterministic algorithms. To accurately compare different heuristic algorithms in solving optimization problems, the final optimal solution needs to be known. Existing deterministic methods such as Exhaustive Search and Integer Linear Programming can provide the final global optimal solution for small-scale optimization problems. However, as the system grows the number of calculations and required memory size incredibly increases, so applying existing deterministic methods is no longer possible for medium and large-scale systems. The purpose of this paper is to introduce a novel deterministic method with short running time and small memory size requirement for optimal placement of Micro Phasor Measurement Units (µPMUs) in radial electricity distribution systems to make the system completely observable.

First, the principle of the method is explained and the observability of the system is analyzed. Then, the algorithm’s running time and memory usage when applying on some of the modified versions of the Institute of Electrical and Electronics Engineers 123-node test feeder are obtained and compared with those of its deterministic counterparts.

Because of the innovative method of step-by-step placement of µPMUs, a unique method is developed. Simulation results elucidate that the proposed method has unique features of short running time and small memory size requirements.

While the mathematical background of the observability study of electricity distribution systems is very well-presented in the referenced papers, the proposed step-by-step placement method of µPMUs, which shrinks unobservable parts of the system in each step, is not discussed yet. The presented paper is directly applicable to typical problems in the field of power systems.