共查询到20条相似文献,搜索用时 156 毫秒
1.
Cluster analysis is one of attractive data mining technique that use in many fields. One popular class of data clustering algorithms is the center based clustering algorithm. K-means used as a popular clustering method due to its simplicity and high speed in clustering large datasets. However, K-means has two shortcomings: dependency on the initial state and convergence to local optima and global solutions of large problems cannot found with reasonable amount of computation effort. In order to overcome local optima problem lots of studies done in clustering. Over the last decade, modeling the behavior of social insects, such as ants and bees, for the purpose of search and problem solving has been the context of the emerging area of swarm intelligence. Honey-bees are among the most closely studied social insects. Honey-bee mating may also be considered as a typical swarm-based approach to optimization, in which the search algorithm is inspired by the process of marriage in real honey-bee. Honey-bee has been used to model agent-based systems. In this paper, we proposed application of honeybee mating optimization in clustering (HBMK-means). We compared HBMK-means with other heuristics algorithm in clustering, such as GA, SA, TS, and ACO, by implementing them on several well-known datasets. Our finding shows that the proposed algorithm works than the best one. 相似文献
2.
S Abdullah S Ahmadi E K Burke M Dror B McCollum 《The Journal of the Operational Research Society》2007,58(11):1494-1502
Neighbourhood search algorithms are often the most effective known approaches for solving partitioning problems. In this paper, we consider the capacitated examination timetabling problem as a partitioning problem and present an examination timetabling methodology that is based upon the large neighbourhood search algorithm that was originally developed by Ahuja and Orlin. It is based on searching a very large neighbourhood of solutions using graph theoretical algorithms implemented on a so-called improvement graph. In this paper, we present a tabu-based large neighbourhood search, in which the improvement moves are kept in a tabu list for a certain number of iterations. We have drawn upon Ahuja–Orlin's methodology incorporated with tabu lists and have developed an effective examination timetabling solution scheme which we evaluated on capacitated problem benchmark data sets from the literature. The capacitated problem includes the consideration of room capacities and, as such, represents an issue that is of particular importance in real-world situations. We compare our approach against other methodologies that have appeared in the literature over recent years. Our computational experiments indicate that the approach we describe produces the best known results on a number of these benchmark problems. 相似文献
3.
《Journal of computational science》2014,5(2):144-155
This paper presents a parameter adaptive harmony search algorithm (PAHS) for solving optimization problems. The two important parameters of harmony search algorithm namely Harmony Memory Consideration Rate (HMCR) and Pitch Adjusting Rate (PAR), which were either kept constant or the PAR value was dynamically changed while still keeping HMCR fixed, as observed from literature, are both being allowed to change dynamically in this proposed PAHS. This change in the parameters has been done to get the global optimal solution. Four different cases of linear and exponential changes have been explored. The change has been allowed during the process of improvization. The proposed algorithm is evaluated on 15 standard benchmark functions of various characteristics. Its performance is investigated and compared with three existing harmony search algorithms. Experimental results reveal that proposed algorithm outperforms the existing approaches when applied to 15 benchmark functions. The effects of scalability, noise, and harmony memory size have also been investigated on four approaches of HS. The proposed algorithm is also employed for data clustering. Five real life datasets selected from UCI machine learning repository are used. The results show that, for data clustering, the proposed algorithm achieved results better than other algorithms. 相似文献
4.
Gerhard Post Samad Ahmadi Sophia Daskalaki Jeffrey H. Kingston Jari Kyngas Cimmo Nurmi David Ranson 《Annals of Operations Research》2012,194(1):385-397
The High School Timetabling Problem is amongst the most widely used timetabling problems. This problem has varying structures
in different high schools even within the same country or educational system. Due to lack of standard benchmarks and data
formats this problem has been studied less than other timetabling problems in the literature. In this paper we describe the
High School Timetabling Problem in several countries in order to find a common set of constraints and objectives. Our main
goal is to provide exchangeable benchmarks for this problem. To achieve this we propose a standard data format suitable for
different countries and educational systems, defined by an XML schema. The schema and datasets are available online. 相似文献
5.
《European Journal of Operational Research》2002,140(2):266-280
The aim of this paper is to give a brief introduction to some recent approaches to timetabling problems that have been developed or are under development in the Automated Scheduling, Optimisation and Planning Research Group (ASAP) at the University of Nottingham. We have concentrated upon university timetabling but we believe that some of the methodologies that are described can be used for different timetabling problems such as employee timetabling, timetabling of sports fixtures, etc. The paper suggests a number of approaches and comprises three parts. Firstly, recent heuristic and evolutionary timetabling algorithms are discussed. In particular, two evolutionary algorithm developments are described: a method for decomposing large real-world timetabling problems and a method for heuristic initialisation of the population. Secondly, an approach that considers timetabling problems as multicriteria decision problems is presented. Thirdly, we discuss a case-based reasoning approach that employs previous experience to solve new timetabling problems. Finally, we outline some new research ideas and directions in the field of timetabling. The overall aim of these research directions is to explore approaches that can operate at a higher level of generality than is currently possible. 相似文献
6.
This paper describes the development of a novel metaheuristic that combines an electromagnetic-like mechanism (EM) and the
great deluge algorithm (GD) for the University course timetabling problem. This well-known timetabling problem assigns lectures
to specific numbers of timeslots and rooms maximizing the overall quality of the timetable while taking various constraints
into account. EM is a population-based stochastic global optimization algorithm that is based on the theory of physics, simulating
attraction and repulsion of sample points in moving toward optimality. GD is a local search procedure that allows worse solutions
to be accepted based on some given upper boundary or ‘level’. In this paper, the dynamic force calculated from the attraction-repulsion
mechanism is used as a decreasing rate to update the ‘level’ within the search process. The proposed method has been applied
to a range of benchmark university course timetabling test problems from the literature. Moreover, the viability of the method
has been tested by comparing its results with other reported results from the literature, demonstrating that the method is
able to produce improved solutions to those currently published. We believe this is due to the combination of both approaches
and the ability of the resultant algorithm to converge all solutions at every search process. 相似文献
7.
Kalyanmoy Deb Shivam Gupta Joydeep Dutta Bhoomija Ranjan 《Journal of Global Optimization》2013,57(3):891-933
In solving certain optimization problems, the corresponding Lagrangian dual problem is often solved simply because in these problems the dual problem is easier to solve than the original primal problem. Another reason for their solution is the implication of the weak duality theorem which suggests that under certain conditions the optimal dual function value is smaller than or equal to the optimal primal objective value. The dual problem is a special case of a bilevel programming problem involving Lagrange multipliers as upper-level variables and decision variables as lower-level variables. Another interesting aspect of dual problems is that both lower and upper-level optimization problems involve only box constraints and no other equality of inequality constraints. In this paper, we propose a coevolutionary dual optimization (CEDO) algorithm for co-evolving two populations—one involving Lagrange multipliers and other involving decision variables—to find the dual solution. On 11 test problems taken from the optimization literature, we demonstrate the efficacy of CEDO algorithm by comparing it with a couple of nested smooth and nonsmooth algorithms and a couple of previously suggested coevolutionary algorithms. The performance of CEDO algorithm is also compared with two classical methods involving nonsmooth (bundle) optimization methods. As a by-product, we analyze the test problems to find their associated duality gap and classify them into three categories having zero, finite or infinite duality gaps. The development of a coevolutionary approach, revealing the presence or absence of duality gap in a number of commonly-used test problems, and efficacy of the proposed coevolutionary algorithm compared to usual nested smooth and nonsmooth algorithms and other existing coevolutionary approaches remain as the hallmark of the current study. 相似文献
8.
Ruibin Bai Jacek Blazewicz Edmund K. Burke Graham Kendall Barry McCollum 《4OR: A Quarterly Journal of Operations Research》2012,10(1):43-66
Most of the current search techniques represent approaches that are largely adapted for specific search problems. There are
many real-world scenarios where the development of such bespoke systems is entirely appropriate. However, there are other
situations where it would be beneficial to have methodologies which are generally applicable to more problems. One of our
motivating goals for investigating hyper-heuristic methodologies is to provide a more general search framework that can be
easily and automatically employed on a broader range of problems than is currently possible. In this paper, we investigate
a simulated annealing hyper-heuristic methodology which operates on a search space of heuristics and which employs a stochastic
heuristic selection strategy and a short-term memory. The generality and performance of the proposed algorithm is demonstrated
over a large number of benchmark datasets drawn from two very different and difficult problems, namely; course timetabling
and bin packing. The contribution of this paper is to present a method which can be readily (and automatically) applied to
different problems whilst still being able to produce results on benchmark problems which are competitive with bespoke human
designed tailor made algorithms for those problems. 相似文献
9.
Mohamed Amine El Majdouli Ismail Rbouh Saad Bougrine Bouazza El Benani Abdelhakim Ameur El Imrani 《Memetic Computing》2016,8(4):333-347
This paper presents a novel optimization framework based on the Fireworks Algorithm for Big Data Optimization problems. Indeed, the proposed framework is composed of two optimization algorithms. A single objective Fireworks Algorithm and a multi-objective Fireworks Algorithm are proposed for solving the Big Optimization of Signals problem “Big-OPT” which belongs to the Big Data Optimization problems class. The single objective Fireworks Algorithm adopts a modified search mechanism to ensure rapidity and preserve the explorative capacities of the basic Fireworks Algorithm. Afterward, the algorithm is extended to handle multi-objective optimization of Big-OPT with a supplementary special sparks phase and a novel strategy for next generation selection. To validate the performance of the framework, extensive tests on six EEG datasets are performed. The framework is also compared with several approaches from recent state of the art. The study concludes the competitive performance of the proposed framework in comparison with the other techniques reported in this paper. 相似文献
10.
Optimal kernel selection in twin support vector machines 总被引:2,自引:0,他引:2
In twin support vector machines (TWSVMs), we determine pair of non-parallel planes by solving two related SVM-type problems,
each of which is smaller than the one in a conventional SVM. However, similar to other classification methods, the performance
of the TWSVM classifier depends on the choice of the kernel. In this paper we treat the kernel selection problem for TWSVM
as an optimization problem over the convex set of finitely many basic kernels, and formulate the same as an iterative alternating
optimization problem. The efficacy of the proposed classification algorithm is demonstrated with some UCI machine learning
benchmark datasets. 相似文献
11.
Edmund K. Burke Barry McCollum Amnon Meisels Sanja Petrovic Rong Qu 《European Journal of Operational Research》2007
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within the hyper-heuristic framework, a tabu search approach is employed to search for permutations of graph heuristics which are used for constructing timetables in exam and course timetabling problems. This underpins a multi-stage hyper-heuristic where the tabu search employs permutations upon a different number of graph heuristics in two stages. We study this graph-based hyper-heuristic approach within the context of exploring fundamental issues concerning the search space of the hyper-heuristic (the heuristic space) and the solution space. Such issues have not been addressed in other hyper-heuristic research. These approaches are tested on both exam and course benchmark timetabling problems and are compared with the fine-tuned bespoke state-of-the-art approaches. The results are within the range of the best results reported in the literature. The approach described here represents a significantly more generally applicable approach than the current state of the art in the literature. Future work will extend this hyper-heuristic framework by employing methodologies which are applicable on a wider range of timetabling and scheduling problems. 相似文献
12.
《European Journal of Operational Research》2020,280(3):1064-1081
High school timetabling problems consist in building periodic timetables for class-teacher meetings considering compulsory and non-compulsory requirements. This family of problems has been widely studied since the 1950s, mostly via mixed-integer programming and metaheuristic techniques. However, the efficient search of optimal or near-optimal solutions is still a challenge for many problems of practical size. In this paper, we investigate mixed-integer programming formulations and a parallel metaheuristic based algorithm for solving high school timetabling problems with compactness and balancing requirements. We propose two pattern-based formulations and a solution algorithm that simultaneously exploits column generation and a team of metaheuristics to build and improve solutions. Extensive computational experiments conducted with real-world instances demonstrate that our formulations are competitive with the best existing high school timetabling formulations, while our parallel algorithm presents superior performance to alternative methods available in the literature. 相似文献
13.
Available research on the manufacturing cell formation problem shows that most solution approaches are either single- or multiple-solution-agent-based, with a fixed size of solution agents. Frequent problems encountered during the process of solving the cell formation problem include solutions being easily trapped in local optima and bad solution efficiency. Yang and Wang [Yang, F.-C., Wang, Y.-P., 2007. Water flow-like algorithm for object grouping problems. Journal of the Chinese Institute of Industrial Engineers, 24 (6), 475–488] proposed the water flow-like algorithm (WFA) to overcome the shortcomings of single- and multiple-solution -agent-based algorithms. WFA has the features of multiple and dynamic numbers of solution agents, and its mimicking of the natural behavior of water flowing from higher to lower levels coincides exactly with the process of searching for optimal solutions. This paper therefore adopts the WFA logic and designs a heuristic algorithm for solving the cell formation problem. Computational results obtained from running a set of 37 test instances from the literature and newly created have shown that the proposed algorithm has performed better than other benchmarking approaches both in solution effectiveness and efficiency, especially in large-sized problems. The superiority of the proposed WFACF over other approaches from the literature should be attributed to the collaboration of the WFA logic, the proposed prior estimation of the cell size, and the insertion-move. The WFA is a novel heuristic approach that deserves more attention. More attempts on adopting the WFA logic to solve many other combinatorial optimization problems are highly recommended. 相似文献
14.
This study develops an improved moth-flame optimization algorithm, which is a recently proposed optimizer based on moth behavior in nature. It has achieved favorable results in medical science, educational evaluation, and other fields. However, the convergence rate of the original moth-flame optimization algorithm is too fast in the running process, and it is prone to fall into local optimum, which leads to the failure to produce the high-quality optimal result. Accordingly, this paper proposes a reinforced technique for the moth-flame optimization algorithm. Firstly, the simulated annealing strategy is introduced into the moth-flame optimization algorithm to boost the advantage of the algorithm in the local exploitation process. Then, the idea of the quantum rotation gate is integrated to enhance the global exploration ability of the algorithm and ameliorate the diversity of the moth. These two steps maintain the relationship between exploitation and exploration as well as strengthen the performance of the algorithm in both phases. After that, the method is compared with ten well-regarded and ten alternative algorithms on benchmark functions to verify the effectiveness of the approach. Also, the Wilcoxon signed rank and Friedman assessment were performed to verify the significance of the proposed method against other counterparts. The simulation results reveal that the two introduced strategies significantly improve the exploration and exploitation capacity of moth-flame optimization algorithm. Finally, the algorithm is utilized to feature selection and two engineering problems, including pressure vessel design and multiple disk clutch brake problems. In these practical applications, the novel algorithm also achieves particularly notable results, which also illustrates that the algorithm is qualified is an effective auxiliary appliance in solving complex optimization problems. 相似文献
15.
Due to the vagaries of optimization problems encountered in practice, users resort to different algorithms for solving different optimization problems. In this paper, we suggest and evaluate an optimization procedure which specializes in solving a wide variety of optimization problems. The proposed algorithm is designed as a generic multi-objective, multi-optima optimizer. Care has been taken while designing the algorithm such that it automatically degenerates to efficient algorithms for solving other simpler optimization problems, such as single-objective uni-optimal problems, single-objective multi-optima problems and multi-objective uni-optimal problems. The efficacy of the proposed algorithm in solving various problems is demonstrated on a number of test problems chosen from the literature. Because of its efficiency in handling different types of problems with equal ease, this algorithm should find increasing use in real-world optimization problems. 相似文献
16.
Edmund K. Burke Graham Kendall Mustafa M?s?r Ender ?zcan 《Annals of Operations Research》2012,196(1):73-90
Automating the neighbourhood selection process in an iterative approach that uses multiple heuristics is not a trivial task. Hyper-heuristics are search methodologies that not only aim to provide a general framework for solving problem instances at different difficulty levels in a given domain, but a key goal is also to extend the level of generality so that different problems from different domains can also be solved. Indeed, a major challenge is to explore how the heuristic design process might be automated. Almost all existing iterative selection hyper-heuristics performing single point search contain two successive stages; heuristic selection and move acceptance. Different operators can be used in either of the stages. Recent studies explore ways of introducing learning mechanisms into the search process for improving the performance of hyper-heuristics. In this study, a broad empirical analysis is performed comparing Monte Carlo based hyper-heuristics for solving capacitated examination timetabling problems. One of these hyper-heuristics is an approach that overlaps two stages and presents them in a single algorithmic body. A learning heuristic selection method (L) operates in harmony with a simulated annealing move acceptance method using reheating (SA) based on some shared variables. Yet, the heuristic selection and move acceptance methods can be separated as the proposed approach respects the common selection hyper-heuristic framework. The experimental results show that simulated annealing with reheating as a hyper-heuristic move acceptance method has significant potential. On the other hand, the learning hyper-heuristic using simulated annealing with reheating move acceptance (L?CSA) performs poorly due to certain weaknesses, such as the choice of rewarding mechanism and the evaluation of utility values for heuristic selection as compared to some other hyper-heuristics in examination timetabling. Trials with other heuristic selection methods confirm that the best alternative for the simulated annealing with reheating move acceptance for examination timetabling is a previously proposed strategy known as the choice function. 相似文献
17.
In this paper, we propose a new whale army optimization algorithm with a view to solving multifarious optimization problems. The key novelty of our approach is to modify the original whale optimization algorithm to make it effective to solve the complicated, large-scale and constrained optimization problems. Our modifications mainly embody two aspects: the beneficial strategic adjustment to set key parameters and to help establish base principles in the original optimizer and the introduction of armed force program which classifies the search whales into different categories to achieve efficient cooperation. We evaluate the performance of the proposed algorithm, using three simple benchmark test functions over thirty CEC-2014 real-parameter numerical optimization problems and three constraint engineering design problems. The test results indicate that this algorithm can provide a faster local convergence rate, a higher convergence accuracy, and a lower computational complexity in comparison to traditional whale optimization algorithms and other sophisticated state of the art whale optimizers. Performance wise, it also surpasses many advanced methods for large-scaled complex functions. Furthermore, in this paper we propose a variant of whale army optimization algorithm to specifically address and solve optimizing constrained problems with a high degree of precision. 相似文献
18.
Robust design optimization (RDO) is a field of optimization in which certain measure of robustness is sought against uncertainty. Unlike conventional optimization, the number of function evaluations in RDO is significantly more which often renders it time consuming and computationally cumbersome. This paper presents two new methods for solving the RDO problems. The proposed methods couple differential evolution algorithm (DEA) with polynomial correlated function expansion (PCFE). While DEA is utilized for solving the optimization problem, PCFE is utilized for calculating the statistical moments. Three examples have been presented to illustrate the performance of the proposed approaches. Results obtained indicate that the proposed approaches provide accurate and computationally efficient estimates of the RDO problems. Moreover, the proposed approaches outperforms popular RDO techniques such as tensor product quadrature, Taylor’s series and Kriging. Finally, the proposed approaches have been utilized for robust hydroelectric flow optimization, demonstrating its capability in solving large scale problems. 相似文献
19.
Christine L. Mumford 《Annals of Operations Research》2010,180(1):3-31
University examination timetabling is a challenging set partitioning problem that comes in many variations, and real world applications usually carry multiple constraints and require the simultaneous optimization of several (often conflicting) objectives. This paper presents a multiobjective framework capable of solving heavily constrained timetabling problems. In this prototype study, we focus on the two objectives: minimizing timetable length while simultaneously optimizing the spread of examinations for individual students. Candidate solutions are presented to a multiobjective memetic algorithm as orderings of examinations, and a greedy algorithm is used to construct violation free timetables from permutation sequences of exams. The role of the multiobjective algorithm is to iteratively improve a population of orderings, with respect to the given objectives, using various mutation and reordering heuristics. 相似文献
20.
The monotone trust-region methods are well-known techniques for solving unconstrained optimization problems. While it is known
that the nonmonotone strategies not only can improve the likelihood of finding the global optimum but also can improve the
numerical performance of approaches, the traditional nonmonotone strategy contains some disadvantages. In order to overcome
to these drawbacks, we introduce a variant nonmonotone strategy and incorporate it into trust-region framework to construct
more reliable approach. The new nonmonotone strategy is a convex combination of the maximum of function value of some prior
successful iterates and the current function value. It is proved that the proposed algorithm possesses global convergence
to first-order and second-order stationary points under some classical assumptions. Preliminary numerical experiments indicate
that the new approach is considerably promising for solving unconstrained optimization problems. 相似文献