251
|
Roy R, Dehuri S, Cho SB. A Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem. INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING 2011. [DOI: 10.4018/jamc.2011100104] [Citation(s) in RCA: 30] [Impact Index Per Article: 2.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Abstract
The Combinatorial problems are real world decision making problem with discrete and disjunctive choices. When these decision making problems involve more than one conflicting objective and constraint, it turns the polynomial time problem into NP-hard. Thus, the straight forward approaches to solve multi-objective problems would not give an optimal solution. In such case evolutionary based meta-heuristic approaches are found suitable. In this paper, a novel particle swarm optimization based meta-heuristic algorithm is presented to solve multi-objective combinatorial optimization problems. Here a mapping method is considered to convert the binary and discrete values (solution encoded as particles) to a continuous domain and update it using the velocity and position update equation of particle swarm optimization to find new set of solutions in continuous domain and demap it to discrete values. The performance of the algorithm is compared with other evolutionary strategy like SPEA and NSGA-II on pseudo-Boolean discrete problems and multi-objective 0/1 knapsack problem. The experimental results confirmed the better performance of combinatorial particle swarm optimization algorithm.
Collapse
|
252
|
Mansour N, Sleiman-Haidar G. Parallel Scatter Search Algorithms for Exam Timetabling. INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING 2011. [DOI: 10.4018/jamc.2011070102] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Abstract
University exam timetabling refers to scheduling exams into predefined days, time periods and rooms, given a set of constraints. Exam timetabling is a computationally intractable optimization problem, which requires heuristic techniques for producing adequate solutions within reasonable execution time. For large numbers of exams and students, sequential algorithms are likely to be time consuming. This paper presents parallel scatter search meta-heuristic algorithms for producing good sub-optimal exam timetables in a reasonable time. Scatter search is a population-based approach that generates solutions over a number of iterations and aims to combine diversification and search intensification. The authors propose parallel scatter search algorithms that are based on distributing the population of candidate solutions over a number of processors in a PC cluster environment. The main components of scatter search are computed in parallel and efficient communication techniques are employed. Empirical results show that the proposed parallel scatter search algorithms yield good speed-up. Also, they show that parallel scatter search algorithms improve solution quality because they explore larger parts of the search space within reasonable time, in contrast with the sequential algorithm.
Collapse
|
253
|
Moudani W, Mora-Camino F. Dynamic Assignment of Crew Reserve in Airlines. INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING 2011. [DOI: 10.4018/jamc.2011070103] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Abstract
The Crew Reserve Assignment Problem (CRAP) considers the assignment of the crew members to a set of reserve activities covering all the scheduled flights in order to ensure a continuous plan so that operations costs are minimized while its solution must meet hard constraints resulting from the safety regulations of Civil Aviation as well as from the airlines internal agreements. The problem considered in this study is of highest interest for airlines and may have important consequences on the service quality and on the economic return of the operations. A new mathematical formulation for the CRAP is proposed which takes into account the regulations and the internal agreements. While current solutions make use of Artificial Intelligence techniques run on main frame computers, a low cost approach is proposed to provide on-line efficient solutions to face perturbed operating conditions. The proposed solution method uses a dynamic programming approach for the duties scheduling problem and when applied to the case of a medium airline while providing efficient solutions, shows good potential acceptability by the operations staff. This optimization scheme can then be considered as the core of an on-line Decision Support System for crew reserve assignment operations management.
Collapse
|
254
|
Yin PY, Glover F, Laguna M, Zhu JX. A Complementary Cyber Swarm Algorithm. INTERNATIONAL JOURNAL OF SWARM INTELLIGENCE RESEARCH 2011. [DOI: 10.4018/jsir.2011040102] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Abstract
A recent study (Yin et al., 2010) showed that combining particle swarm optimization (PSO) with the strategies of scatter search (SS) and path relinking (PR) produces a Cyber Swarm Algorithm that creates a more effective form of PSO than methods that do not incorporate such mechanisms. This paper proposes a Complementary Cyber Swarm Algorithm (C/CyberSA) that performs in the same league as the original Cyber Swarm Algorithm but adopts different sets of ideas from the tabu search (TS) and the SS/PR template. The C/CyberSA exploits the guidance information and restriction information produced in the history of swarm search and the manipulation of adaptive memory. Responsive strategies using long term memory and path relinking implementations are proposed that make use of critical events encountered in the search. Experimental results with a large set of challenging test functions show that the C/CyberSA outperforms two recently proposed swarm-based methods by finding more optimal solutions while simultaneously using a smaller number of function evaluations. The C/CyberSA approach further produces improvements comparable to those obtained by the original CyberSA in relation to the Standard PSO 2007 method (Clerc, 2008).
Collapse
|
255
|
Yaghini M, Momeni M, Sarmadi M. DIMMA-Implemented Metaheuristics for Finding Shortest Hamiltonian Path Between Iranian Cities Using Sequential DOE Approach for Parameters Tuning. INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING 2011. [DOI: 10.4018/jamc.2011040104] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Abstract
A Hamiltonian path is a path in an undirected graph, which visits each node exactly once and returns to the starting node. Finding such paths in graphs is the Hamiltonian path problem, which is NP-complete. In this paper, for the first time, a comparative study on metaheuristic algorithms for finding the shortest Hamiltonian path for 1071 Iranian cities is conducted. These are the main cities of Iran based on social-economic characteristics. For solving this problem, four hybrid efficient and effective metaheuristics, consisting of simulated annealing, ant colony optimization, genetic algorithm, and tabu search algorithms, are combined with the local search methods. The algorithms’ parameters are tuned by sequential design of experiments (DOE) approach, and the most appropriate values for the parameters are adjusted. To evaluate the proposed algorithms, the standard problems with different sizes are used. The performance of the proposed algorithms is analyzed by the quality of solution and CPU time measures. The results are compared based on efficiency and effectiveness of the algorithms.
Collapse
|
256
|
Das M, Roy R, Dehuri S, Cho SB. A New Approach to Associative Classification Based on Binary Multi-objective Particle Swarm Optimization. INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING 2011. [DOI: 10.4018/jamc.2011040103] [Citation(s) in RCA: 11] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Abstract
Associative classification rule mining (ACRM) methods operate by association rule mining (ARM) to obtain classification rules from a previously classified data. In ACRM, classifiers are designed through two phases: rule extraction and rule selection. In this paper, the ACRM problem is treated as a multi-objective problem rather than a single objective one. As the problem is a discrete combinatorial optimization problem, it was necessary to develop a binary multi-objective particle swarm optimization (BMOPSO) to optimize the measure like coverage and confidence of association rule mining (ARM) to extract classification rules in rule extraction phase. In rule selection phase, a small number of rules are targeted from the extracted rules by BMOPSO to design an accurate and compact classifier which can maximize the accuracy of the rule sets and minimize their complexity simultaneously. Experiments are conducted on some of the University of California, Irvine (UCI) repository datasets. The comparative result of the proposed method with other standard classifiers confirms that the new proposed approach can be a suitable method for classification.
Collapse
|
257
|
Wang Y. Towards the Synergy of Cognitive Informatics, Neural Informatics, Brain Informatics, and Cognitive Computing. INTERNATIONAL JOURNAL OF COGNITIVE INFORMATICS AND NATURAL INTELLIGENCE 2011. [DOI: 10.4018/jcini.2011010105] [Citation(s) in RCA: 23] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Abstract
The contemporary wonder of sciences and engineering recently refocused on the starting point: how the brain processes internal and external information autonomously rather than imperatively as those of conventional computers? This paper explores the interplay and synergy of cognitive informatics, neural informatics, abstract intelligence, denotational mathematics, brain informatics, and computational intelligence. A key notion recognized in recent studies in cognitive informatics is that the root and profound objective in natural, abstract, and artificial intelligence, and in cognitive informatics and cognitive computing, is to seek suitable mathematical means for their special needs. A layered reference model of the brain and a set of cognitive processes of the mind are systematically developed towards the exploration of the theoretical framework of cognitive informatics. A wide range of applications of cognitive informatics and denotational mathematics are recognized in the development of highly intelligent systems such as cognitive computers, cognitive knowledge search engines, autonomous learning machines, and cognitive robots.
Collapse
|
258
|
Wang Y, Widrow BC, Zhang B, Kinsner W, Sugawara K, Sun F, Lu J, Weise T, Zhang D. Perspectives on the Field of Cognitive Informatics and its Future Development. INTERNATIONAL JOURNAL OF COGNITIVE INFORMATICS AND NATURAL INTELLIGENCE 2011. [DOI: 10.4018/jcini.2011010101] [Citation(s) in RCA: 38] [Impact Index Per Article: 2.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Abstract
The contemporary wonder of sciences and engineering has recently refocused on the beginning point of: how the brain processes internal and external information autonomously and cognitively rather than imperatively like conventional computers. Cognitive Informatics (CI) is a transdisciplinary enquiry of computer science, information sciences, cognitive science, and intelligence science that investigates the internal information processing mechanisms and processes of the brain and natural intelligence, as well as their engineering applications in cognitive computing. This paper reports a set of eight position statements presented in the plenary panel of IEEE ICCI’10 on Cognitive Informatics and Its Future Development contributed from invited panelists who are part of the world’s renowned researchers and scholars in the field of cognitive informatics and cognitive computing.
Collapse
Affiliation(s)
| | | | | | | | | | | | | | - Thomas Weise
- University of Science and Technology of China, China
| | - Du Zhang
- California State University, USA
| |
Collapse
|
259
|
Abstract
Recently a paper was published which claims “harmony search is equivalent to evolution strategies and because the latter is not popular currently, the former has no future. Also, research community was misguided by the former’s disguised novelty.” This paper is written to rebut the original paper’s claims by saying 1) harmony search is different from evolution strategies because each has its own uniqueness, 2) performance, rather than novelty, is an algorithm’s survival factor, and 3) the original paper was biased to mislead into a predefined conclusion.” Also, the shortcomings of current review system, citation system, and funding system are briefly mentioned.
Collapse
|
260
|
Abstract
Metaheuristic algorithms will gain more and more popularity in the future as optimization problems are increasing in size and complexity. In order to record experiences and allow project to be replicated, a standard process as a methodology for designing and implementing metaheuristic algorithms is necessary. To the best of the authors’ knowledge, no methodology has been proposed in literature for this purpose. This paper presents a Design and Implementation Methodology for Metaheuristic Algorithms, named DIMMA. The proposed methodology consists of three main phases and each phase has several steps in which activities that must be carried out are clearly defined in this paper. In addition, design and implementation of tabu search metaheuristic for travelling salesman problem is done as a case study to illustrate applicability of DIMMA.
Collapse
|
261
|
Glover F, Hanafi S. Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization – Part II. INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING 2010. [DOI: 10.4018/jamc.2010040101] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Abstract
Recent metaheuristics for mixed integer programming have included proposals for introducing inequalities and target objectives to guide this search. These guidance approaches are useful in intensification and diversification strategies related to fixing subsets of variables at particular values. The authors’ preceding Part I study demonstrated how to improve such approaches by new inequalities that dominate those previously proposed. In Part II, the authors review the fundamental concepts underlying weighted pseudo cuts for generating guiding inequalities, including the use of target objective strategies. Building on these foundations, this paper develops a more advanced approach for generating the target objective based on exploiting the mutually reinforcing notions of reaction and resistance. The authors demonstrate how to produce new inequalities by “mining” reference sets of elite solutions to extract characteristics these solutions exhibit in common. Additionally, a model embedded memory is integrated to provide a range of recency and frequency memory structures for achieving goals associated with short term and long term solution strategies. Finally, supplementary linear programming models that exploit the new inequalities for intensification and diversification are proposed.
Collapse
Affiliation(s)
| | - Saïd Hanafi
- University of Lille -Nord de France, UVHC, and LAMIH, France
| |
Collapse
|