273 Hits in 11.1 sec

A Survey of Evolutionary Computation for Resource Management of Processing in Cloud Computing [Review Article]

Mateusz Guzek, Pascal Bouvry, El-Ghazali Talbi
2015 IEEE Computational Intelligence Magazine  
Indeed, the new cloud-related techniques for resource virtualization and sharing and the corresponding service level agreements call for new optimization models and solutions.  ...  It is important for computational intelligence researchers to understand the novelties introduced by cloud computing.  ...  We would also like to thank Prof. Joanna Kołodziej, Dr. Johnatan Pecero, and Dominic Dunlop for their valuable comments.  ... 
doi:10.1109/mci.2015.2405351 fatcat:nuxavfk5ezdzdlebbcrdawpyli

Soft Computing in Optimizing Assembly Lines Balancing

2010 Journal of Computer Science  
Many efforts have been made to seek the best techniques in optimizing assembly lines.  ...  This study also recommends that human involvement in ALB needs to be considered as a problem factor in ALB.  ...  In the proposed method, the greedy heuristic methods were based on the application of priority rules for assignment of tasks to workstations such as the longest processing time and the greatest number  ... 
doi:10.3844/jcssp.2010.141.162 fatcat:rdv3e6wewzealnrlcmh5mcaa2a

An annotated bibliography of GRASP-Part II: Applications

Paola Festa, Mauricio G. C. Resende
2009 International Transactions in Operational Research  
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  ...  GRASP has been applied to a wide range of combinatorial optimization problems, ranging from scheduling and routing to drawing and turbine balancing.  ...  The greedy selection is based on a priority rule. The improvement phase consists of two steps.  ... 
doi:10.1111/j.1475-3995.2009.00664.x fatcat:wdqwc6xvcnfq3fi5ujy6jy5wtm

Analysis of Multi-AGVs Management System and Key Issues: A Review

Wenhao Lu, Shuai Guo, Tao Song, Yuwen Li
2022 CMES - Computer Modeling in Engineering & Sciences  
The multi-AGVs management problem is a multi-objective, multi-constraint combinatorial optimization problem, which depends on the types of application scenarios.  ...  This type of systems need to balance the relationship among the resources of the system and solve the problems existing in the operation to make the system in line with the requirement of the administrator  ...  For the optimization issue in the multi-AGVs management system, certain heuristic rules have been proven to be effective, such as genetic algorithm [22, 64] , randomized search algorithm [126] , colony  ... 
doi:10.32604/cmes.2022.019770 fatcat:afzwkjdsyvd4hbrzv6rdazrlaa

A Review on Automated Menu Planning Approaches

Hea Choon Ngo, Yu-N Cheah, Ong Sing Goh, Yun-Huoy Choo, Halizah Basiron, Yogan Jaya Kumar
2016 Journal of Computer Science  
In automated planning research, the word "plans" refers specifically to plans of action.  ...  It is about the representation of future behavior, generally a series of action, with temporal and other constraints on them for execution by some agents.  ...  Author's Contributions All authors equally contributed in this work. Ethics This article is original and contains unpublished material.  ... 
doi:10.3844/jcssp.2016.582.596 fatcat:p7xkmf2l5jf6hmrp5tise4oa6m

Hyper-heuristics: a survey of the state of the art

Edmund K Burke, Michel Gendreau, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender Özcan, Rong Qu
2013 Journal of the Operational Research Society  
The term hyperheuristic is relatively new; it was first used in 2000 to describe heuristics to choose heuristics in the context of combinatorial optimisation.  ...  The definition of hyper-heuristics has been recently extended to refer to a search method or learning mechanism for selecting or generating heuristics to solve computational search problems.  ...  The approach simultaneously searches for the best sequence of rules, and the number of operations to be handled by each rule.  ... 
doi:10.1057/jors.2013.71 fatcat:wgusktpk4fau3lg22smrby4k4y

Review of job shop scheduling research and its new perspectives under Industry 4.0

Jian Zhang, Guofu Ding, Yisheng Zou, Shengfeng Qin, Jianlin Fu
2017 Journal of Intelligent Manufacturing  
The scheduling research needs to shift its focus to smart distributed scheduling modeling and optimization.  ...  In this paper, we first review existing researches from over 120 papers and answer the first question and then we explore a future research direction in SDS and discuss the new techniques for developing  ...  One of heuristic algorithms called meta-heuristic algorithm with random number search techniques are used in a very wide range of practical problems.  ... 
doi:10.1007/s10845-017-1350-2 fatcat:wsvrdighqfg4de3gamrqs46y2u

Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons

C. Dimopoulos, A.M.S. Zalzala
2000 IEEE Transactions on Evolutionary Computation  
The use of intelligent techniques in the manufacturing field has been growing the last decades due to the fact that most manufacturing optimization problems are combinatorial and NP hard.  ...  This paper examines recent developments in the field of evolutionary computation for manufacturing optimization.  ...  ACKNOWLEDGMENT The authors would like to thank the reviewers for their helpful comments.  ... 
doi:10.1109/4235.850651 fatcat:akevaqtprzab5cgs3y3y534aju

Backward Chaining [chapter]

2013 Encyclopedia of Operations Research and Management Science  
At any point in the recursion, the effort of finding a value for the immediate goal involves examining rule conclusions to identify those rules that could possibly establish a value for that goal.  ...  Introduction OR/MS techniques find applications in numerous and diverse areas of operation in a banking institution.  ...  Examples of recent heuristics that have employed these methods include guided local search (GLS), a two-level tabu search (TS 2 PACK), and a greedy randomized adaptive search procedure (GRASP) that is  ... 
doi:10.1007/978-1-4419-1153-7_200968 fatcat:wsdsqf2wxrckvpoq4yh5f7rsqm

Reconfiguration of Electric Power Distribution Systems: Comprehensive Review and Classification

Meisam Mahdavi, Hassan Haes Alhelou, Nikos D. Hatziargyriou, Francisco Jurado
2021 IEEE Access  
Distribution system reconfiguration (DSR) is a large-scale combinatorial optimization problem.  ...  For the last 45 years, the DSR problem has been widely studied; nowadays, DSR, combined with new challenges, is being highly investigated, as researchers aim to reach a better solution.  ...  Ricardo Alan Verdú Ramos, director of Faculty of Engineering and coordinator of associated laboratory of IPBEN in São Paulo State University at Ilha Solteira for providing the necessary facilities to carry  ... 
doi:10.1109/access.2021.3107475 fatcat:tj6u5gd6bbgb5l2y4yjqvcatou

Improved Genetic Algorithm to Solve the Scheduling Problem of College English Courses

Jing Xu, Zhihan Lv
2021 Complexity  
Secondly, a problem-specific local search operator is designed to accelerate the convergence speed of the algorithm.  ...  In this paper, an improved genetic algorithm is designed to solve the above multiobjective optimization problem for the scheduling problem of college English courses.  ...  has fast convergence and strong global search capability, which is due to the local search operator that optimizes the local search for some solution objectives in the specific problem of scheduling.  ... 
doi:10.1155/2021/7252719 fatcat:qagsxnau7jd4joxymatrk3kcm4

A survey: algorithms simulating bee swarm intelligence

Dervis Karaboga, Bahriye Akay
2009 Artificial Intelligence Review  
This work presents a survey of the algorithms described based on the intelligence in bee swarms and their applications. SH (2003) Queen-bee evolution for genetic algorithms.  ...  In: International conference on multivariate statistical modelling and high dimensional data mining, Kayseri, Turkey Karci A (2004) Imitation of bee reproduction as a crossover operator in genetic algorithms  ...  In its basic version, the algorithm performs a kind of neighborhood search combined with random search and can be used for both combinatorial optimization and functional optimization.  ... 
doi:10.1007/s10462-009-9127-4 fatcat:lk3bhpg4lngrvbcuc2z7uooaue

Mathematical Modeling for Network Selection in Heterogeneous Wireless Networks — A Tutorial

Lusheng Wang, Geng-Sheng G.S. Kuo
2013 IEEE Communications Surveys and Tutorials  
The employed theory decides the objective of optimization, complexity and performance, so it is a must to understand the potential mathematical theories and choose the appropriate one for obtaining the  ...  Index Terms-Network selection, heterogeneous wireless networks (HWNs), utility theory, multiple attribute decision making (MADM), fuzzy logic, game theory, combinatorial optimization, Markov chain.  ...  COMBINATORIAL OPTIMIZATION Combinatorial optimization searches for an optimum object in a finite collection of objects.  ... 
doi:10.1109/surv.2012.010912.00044 fatcat:tlpdpnlzjbbefon4mbrhfznvwu

Interval Algebra – An effective means of scheduling surveillance radar networks

Richard W. Focke, Johan P. de Villiers, Michael R. Inggs
2015 Information Fusion  
Thus it provides a solution to a part of resource management, which is included in the revised Data Fusion Information Group model of information fusion.  ...  The simulations revealed that an Interval Algebra algorithm that utilises both approaches can perform as well as the Greedy Randomised Adaptive Search Procedure with similar processing time requirements  ...  Acknowledgment The authors would like to thank all the reviewers of the draft manuscripts for their detailed critique.  ... 
doi:10.1016/j.inffus.2014.08.002 fatcat:4pmnpirpqjbttex2z3pvtocyya

Particle Swarm and Ant Colony Algorithms and Their Applications in Chinese Traveling Salesman Problem [chapter]

Shuang Cong, Yajun Jia, Ke Deng
2010 New Achievements in Evolutionary Computation  
PSO and its application in C-TSP PSO with mutation In the PSO, each single solution is a "bird" in the search space.  ...  The current study for ACO has extended from TSP range to many other fields, and it has developed into solving the multi-dimensional and dynamic combinatorial optimization problems instead of the static  ...  The C-TSP application and results analysis The TSP is a well-known combinatorial optimization problem with typical NP-hard and is often used to verify the superiority of some intelligent heuristic algorithm  ... 
doi:10.5772/8059 fatcat:mcm4kl42bjeclpvoeh52tjasvi
« Previous Showing results 1 — 15 out of 273 results