scholarly journals A New Hybrid Algorithm to Solve Winner Determination Problem in Multiunit Double Internet Auction

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Mourad Ykhlef ◽  
Reem Alqifari
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Evolutionary Algorithms ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Double Auction ◽  
Winner Determination Problem ◽  
Swarm Optimization ◽  
Winner Determination ◽  
Long Time

Solving winner determination problem in multiunit double auction has become an important E-business task. The main issue in double auction is to improve the reward in order to match the ideal prices and quantity and make the best profit for sellers and buyers according to their bids and predefined quantities. There are many algorithms introduced for solving winner in multiunit double auction. Conventional algorithms can find the optimal solution but they take a long time, particularly when they are applied to large dataset. Nowadays, some evolutionary algorithms, such as particle swarm optimization and genetic algorithm, were proposed and have been applied. In order to improve the speed of evolutionary algorithms convergence, we will propose a new kind of hybrid evolutionary algorithm that combines genetic algorithm (GA) with particle swarm optimization (PSO) to solve winner determination problem in multiunit double auction; we will refer to this algorithm as AUC-GAPSO.

scholarly journals Service Composition in IoT using Genetic algorithm and Particle swarm optimization

2020 ◽  
Vol 10 (1) ◽  
pp. 56-64 ◽  
Author(s):  
Neeti Kashyap ◽  
A. Charan Kumari ◽  
Rita Chhikara
Keyword(s):  
Genetic Algorithm ◽  
Quality Of Service ◽  
Particle Swarm Optimization ◽  
Service Composition ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Critical Issue ◽  
Swarm Optimization

AbstractWeb service compositions are commendable in structuring innovative applications for different Internet-based business solutions. The existing services can be reused by the other applications via the web. Due to the availability of services that can serve similar functionality, suitable Service Composition (SC) is required. There is a set of candidates for each service in SC from which a suitable candidate service is picked based on certain criteria. Quality of service (QoS) is one of the criteria to select the appropriate service. A standout amongst the most important functionality presented by services in the Internet of Things (IoT) based system is the dynamic composability. In this paper, two of the metaheuristic algorithms namely Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are utilized to tackle QoS based service composition issues. QoS has turned into a critical issue in the management of web services because of the immense number of services that furnish similar functionality yet with various characteristics. Quality of service in service composition comprises of different non-functional factors, for example, service cost, execution time, availability, throughput, and reliability. Choosing appropriate SC for IoT based applications in order to optimize the QoS parameters with the fulfillment of user’s necessities has turned into a critical issue that is addressed in this paper. To obtain results via simulation, the PSO algorithm is used to solve the SC problem in IoT. This is further assessed and contrasted with GA. Experimental results demonstrate that GA can enhance the proficiency of solutions for SC problem in IoT. It can also help in identifying the optimal solution and also shows preferable outcomes over PSO.

scholarly journals Performance of Resource Allocation in Device-to-Device Communication Systems Based on Evolutionally Optimization Algorithms

2018 ◽  
Author(s):  
Hsu-Tan Tan ◽  
Bor-An Chen ◽  
Yung-Fa Huang
Keyword(s):  
Particle Swarm Optimization ◽  
Evolutionary Algorithms ◽  
Communication Systems ◽  
Particle Swarm ◽  
Optimal Solution ◽  
System Capacity ◽  
Swarm Optimization ◽  
Device To Device ◽  
Simulation Results ◽  
Capacity Performance

In this study, the resource blocks (RB) are allocated to user equipment (UE) according to the evolutional algorithms for long term evolution (LTE) systems. Particle Swarm Optimization (PSO) algorithm is one of the evolutionary algorithms, based on the imitation of a flock of birds foraging behavior through learning and grouping the best experience. In previous work, the Simple Particle Swarm Optimization (SPSO) algorithm was proposed for RB allocation to enhance the throughput of Device-to-Device (D2D) communications and improve the system capacity performance. In simulation results, with less population size of M = 10, the SPSO can perform quickly convergence to sub-optimal solution in the 100th generation and obtained sub-optimum performance with more 2 UEs than the Rand method. Genetic algorithm (GA) is one of the evolutionary algorithms, based on Darwinian models of natural selection and evolution. Therefore, we further proposed a Refined PSO (RPSO) and a novel GA to enhance the throughput of UEs and to improve the system capacity performance. Simulation results show that the proposed GA with 100 populations, in 200 generations can converge to suboptimal solutions. Therefore, with comparing with the SPSO algorithm the proposed GA and RPSO can improve system capacity performance with 1.8 and 0.4 UEs, respectively.

scholarly journals A Multi-Objective and Multi-Dimensional Optimization Scheduling Method Using a Hybrid Evolutionary Algorithms with a Sectional Encoding Mode

2019 ◽  
Vol 11 (5) ◽  
pp. 1329 ◽  
Author(s):  
Wenxiang Xu ◽  
Shunsheng Guo
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Energy Consumption ◽  
Evolutionary Algorithms ◽  
Particle Swarm ◽  
Discrete Particle Swarm Optimization ◽  
Swarm Optimization ◽  
Discrete Particle ◽  
Dimensional Optimization ◽  
Matching Relation

Aimed at the problem of the green scheduling problem with automated guided vehicles (AGVs) in flexible manufacturing systems (FMS), the multi-objective and multi-dimensional optimal scheduling process is defined while considering energy consumption and multi-function of machines. The process is a complex and combinational process, considering this characteristic, a mathematical model was developed and integrated with evolutionary algorithms (EAs), which includes a sectional encoding genetic algorithm (SE-GA), sectional encoding discrete particle swarm optimization (SE-DPSO) and hybrid sectional encoding genetic algorithm and discrete particle swarm optimization (H-SE-GA-DPSO). In the model, the encoding of the algorithms was divided into three segments for different optimization dimensions with the objective of minimizing the makespan and energy consumption of machines and the number of AGVs. The sectional encoding described the sequence of operations of related jobs, the matching relation between transfer tasks and AGVs (AGV-task), and the matching relation between operations and machines (operation-machine) respectively for multi-dimensional optimization scheduling. The effectiveness of the proposed three EAs was verified by a typical experiment. Besides, in the experiment, a comparison among SE-GA, SE-DPSO, H-SE-GA-DPSO, hybrid genetic algorithm and particle swarm optimization (H-GA-PSO) and a tabu search algorithm (TSA) was performed. In H-GA-PSO and TSA, the former just takes the sequence of operations into account, and the latter takes both the sequence of operations and the AGV-task into account. According to the result of the comparison, the superiority of H-SE-GA-DPSO over the other algorithms was proved.

scholarly journals Fertilizer Production Planning Optimization Using Particle Swarm Optimization-Genetic Algorithm

2019 ◽  
Vol 5 (2) ◽  
pp. 120
Author(s):  
Dinita Rahmalia ◽  
Teguh Herlambang ◽  
Thomy Eko Saputro
Keyword(s):  
Genetic Algorithm ◽  
Linear Programming ◽  
Particle Swarm Optimization ◽  
Constrained Optimization ◽  
Production Planning ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Swarm Optimization ◽  
Mutation Probability ◽  
Planning Optimization

Background: The applications of constrained optimization have been developed in many problems. One of them is production planning. Production planning is the important part for controlling the cost spent by the company.Objective: This research identifies about production planning optimization and algorithm to solve it in approaching. Production planning model is linear programming model with constraints : production, worker, and inventory.Methods: In this paper, we use heurisitic Particle Swarm Optimization-Genetic Algorithm (PSOGA) for solving production planning optimization. PSOGA is the algorithm combining Particle Swarm Optimization (PSO) and mutation operator of Genetic Algorithm (GA) to improve optimal solution resulted by PSO. Three simulations using three different mutation probabilies : 0, 0.01 and 0.7 are applied to PSOGA. Futhermore, some mutation probabilities in PSOGA will be simulated and percent of improvement will be computed.Results: From the simulations, PSOGA can improve optimal solution of PSO and the position of improvement is also determined by mutation probability. The small mutation probability gives smaller chance to the particle to explore and form new solution so that the position of improvement of small mutation probability is in middle of iteration. The large mutation probability gives larger chance to the particle to explore and form new solution so that the position of improvement of large mutation probability is in early of iteration.Conclusion: Overall, the simulations show that PSOGA can improve optimal solution resulted by PSO and therefore it can give optimal cost spent by the company for the  planning.Keywords: Constrained Optimization, Genetic Algorithm, Linear Programming, Particle Swarm Optimization, Production Planning

scholarly journals Hybrid method for achieving Pareto front on economic emission dispatch

2020 ◽  
Vol 10 (4) ◽  
pp. 3358
Author(s):  
Kummari Rajesh ◽  
N. Visali
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Differential Evolution ◽  
Hybrid Method ◽  
Optimization Problem ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Test System ◽  
Swarm Optimization ◽  
Metaheuristic Methods

In this paper hybrid method, Modified Nondominated Sorted Genetic Algorithm (MNSGA-II) and Modified Population Variant Differential Evolution(MPVDE) have been placed in effect in achieving the best optimal solution of Multiobjective economic emission load dispatch optimization problem. In this technique latter, one is used to enforce the assigned percent of the population and the remaining with the former one. To overcome the premature convergence in an optimization problem diversity preserving operator is employed, from the tradeoff curve the best optimal solution is predicted using fuzzy set theory. This methodology validated on IEEE 30 bus test system with six generators, IEEE 118 bus test system with fourteen generators and with a forty generators test system. The solutions are dissimilitude with the existing metaheuristic methods like Strength Pareto Evolutionary Algorithm-II, Multiobjective differential evolution, Multi-objective Particle Swarm optimization, Fuzzy clustering particle swarm optimization, Nondominated sorting genetic algorithm-II.

scholarly journals A COMPARISON OF SIMULATED ANNEALING, GENETIC ALGORITHM AND PARTICLE SWARM OPTIMIZATION IN OPTIMAL FIRST-ORDER DESIGN OF INDOOR TLS NETWORKS

2017 ◽  
Vol IV-2/W4 ◽  
pp. 75-82 ◽  
Author(s):  
F. Jia ◽  
D. Lichti
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Optimization Methods ◽  
Network Design Problem ◽  
Design System ◽  
Swarm Optimization ◽  
First Order

The optimal network design problem has been well addressed in geodesy and photogrammetry but has not received the same attention for terrestrial laser scanner (TLS) networks. The goal of this research is to develop a complete design system that can automatically provide an optimal plan for high-accuracy, large-volume scanning networks. The aim in this paper is to use three heuristic optimization methods, simulated annealing (SA), genetic algorithm (GA) and particle swarm optimization (PSO), to solve the first-order design (FOD) problem for a small-volume indoor network and make a comparison of their performances. The room is simplified as discretized wall segments and possible viewpoints. Each possible viewpoint is evaluated with a score table representing the wall segments visible from each viewpoint based on scanning geometry constraints. The goal is to find a minimum number of viewpoints that can obtain complete coverage of all wall segments with a minimal sum of incidence angles. The different methods have been implemented and compared in terms of the quality of the solutions, runtime and repeatability. The experiment environment was simulated from a room located on University of Calgary campus where multiple scans are required due to occlusions from interior walls. The results obtained in this research show that PSO and GA provide similar solutions while SA doesn’t guarantee an optimal solution within limited iterations. Overall, GA is considered as the best choice for this problem based on its capability of providing an optimal solution and fewer parameters to tune.

A Comparative Study of Genetic and Particle Swarm Optimization Algorithms and Their Hybrid Method in Water Flooding Optimization

2018 ◽  
Vol 140 (10) ◽  
Author(s):  
Majid Siavashi ◽  
Mohsen Yazdani
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Newton Method ◽  
Oil Recovery ◽  
Optimization Technique ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Optimization Techniques ◽  
Water Flooding ◽  
Swarm Optimization

Optimization of oil production from petroleum reservoirs is an interesting and complex problem which can be done by optimal control of well parameters such as their flow rates and pressure. Different optimization techniques have been developed yet, and metaheuristic algorithms are commonly employed to enhance oil recovery projects. Among different metaheuristic techniques, the genetic algorithm (GA) and the particle swarm optimization (PSO) have received more attention in engineering problems. These methods require a population and many objective function calls to approach more the global optimal solution. However, for a water flooding project in a reservoir, each function call requires a long time reservoir simulation. Hence, it is necessary to reduce the number of required function evaluations to increase the rate of convergence of optimization techniques. In this study, performance of GA and PSO are compared with each other in an enhanced oil recovery (EOR) project, and Newton method is linked with PSO to improve its convergence speed. Furthermore, hybrid genetic algorithm-particle swarm optimization (GA-PSO) as the third optimization technique is introduced and all of these techniques are implemented to EOR in a water injection project with 13 decision variables. Results indicate that PSO with Newton method (NPSO) is remarkably faster than the standard PSO (SPSO). Also, the hybrid GA-PSO method is more capable of finding the optimal solution with respect to GA and PSO. In addition, GA-PSO, NPSO, and GA-NPSO methods are compared and, respectively, GA-NPSO and NPSO showed excellence over GA-PSO.

Genetic Algorithm-Enabled Particle Swarm Optimization (PSOGA)-Based Task Scheduling in Cloud Computing Environment

2018 ◽  
Vol 17 (04) ◽  
pp. 1237-1267 ◽  
Author(s):  
Mohit Agarwal ◽  
Gur Mauj Saran Srivastava
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Particle Swarm Optimization ◽  
Task Scheduling ◽  
Heuristic Algorithms ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Swarm Optimization ◽  
Hybrid Techniques ◽  
Heuristic Technique

Task scheduling is one of the most difficult problems which is associated with cloud computing. Due to its nature, as it belongs to nondeterministic polynomial time (NP)-hard class of problem. Various heuristic as well as meta-heuristic approaches have been used to find the optimal solution. Task scheduling basically deals with the allocation of the task to the most efficient machine for optimal utilization of the computing resources and results in better makespan. As per literature, various meta-heuristic algorithms like genetic algorithm (GA), particle swarm optimization (PSO), ant colony optimization (ACO) and their other hybrid techniques have been applied. Through this paper, we are presenting a novel meta-heuristic technique — genetic algorithm enabled particle swarm optimization (PSOGA), a hybrid version of PSO and GA algorithm. PSOGA uses the diversification property of PSO and intensification property of the GA. The proposed algorithm shows its supremacy over other techniques which are taken into consideration by presenting less makespan time in majority of the cases which leads up to 22.2% improvement in performance of the system and also establishes that proposed PSOGA algorithm converges faster than the others.

Greedy particle swarm and biogeography-based optimization algorithm

2015 ◽  
Vol 8 (1) ◽  
pp. 28-49 ◽  
Author(s):  
Jehad Ababneh
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Evolutionary Algorithms ◽  
Design Methodology ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Content Type ◽  
De Algorithm ◽  
Comparable Performance

Purpose – The purpose of this paper is to propose an algorithm that combines the particle swarm optimization (PSO) with the biogeography-based optimization (BBO) algorithm. Design/methodology/approach – The BBO and the PSO algorithms are jointly used in to order to combine the advantages of both algorithms. The efficiency of the proposed algorithm is tested using some selected standard benchmark functions. The performance of the proposed algorithm is compared with that of the differential evolutionary (DE), genetic algorithm (GA), PSO, BBO, blended BBO and hybrid BBO-DE algorithms. Findings – Experimental results indicate that the proposed algorithm outperforms the BBO, PSO, DE, GA, and the blended BBO algorithms and has comparable performance to that of the hybrid BBO-DE algorithm. However, the proposed algorithm is simpler than the BBO-DE algorithm since the PSO does not have complex operations such as mutation and crossover used in the DE algorithm. Originality/value – The proposed algorithm is a generic algorithm that can be used to efficiently solve optimization problems similar to that solved using other popular evolutionary algorithms but with better performance.

Sign in / Sign up

Export Citation Format

Share Document