Filters








128 Hits in 6.8 sec

Linear Linkage Encoding in Grouping Problems: Applications on Graph Coloring and Timetabling [chapter]

Özgür Ülker, Ender Özcan, Emin Erkan Korkmaz
Practice and Theory of Automated Timetabling VI  
However, it is also suitable for grouping problems. In this paper, we investigate LLE on two grouping problems; graph coloring and final exam timetabling.  ...  Initial results show that Linear Linkage Encoding is a viable candidate for grouping problems whenever appropriate genetic operators are used.  ...  We are more interested in the applicability of linear linkage encoding on grouping problems by using suitable crossover and mutation operators.  ... 
doi:10.1007/978-3-540-77345-0_22 dblp:conf/patat/UlkerOK06 fatcat:zag6h5ky3bbppkrya26pj2halm

A Double Evolutionary Pool Memetic Algorithm for Examination Timetabling Problems

Yu Lei, Maoguo Gong, Licheng Jiao, Wei Li, Yi Zuo, Qing Cai
2014 Mathematical Problems in Engineering  
Extensive experiments carried out on 12 benchmark examination timetabling instances show that the proposed algorithm is able to produce promising results for the uncapacitated examination timetabling problem  ...  A double evolutionary pool memetic algorithm is proposed to solve the examination timetabling problem.  ...  [18] developed a genetic algorithm where Linear Linkage Encoding was used as the representation method.  ... 
doi:10.1155/2014/867645 fatcat:y52khknkszgn3hkepso3eefham

A grouping hyper-heuristic framework: Application on graph colouring

Anas Elhag, Ender Özcan
2015 Expert systems with applications  
The performance of different hyperheuristics using different components within the framework is investigated on a representative grouping problem of graph colouring.  ...  The empirical results shows that the proposed grouping hyper-heuristic is not only sufficiently general, but also able to achieve high quality solutions for graph colouring and examination timetabling.  ...  Acknowledgements: This work was funded in part by the EPSRC grant EP/F033613/1. 4 The grouping hyper-heuristic tool will be made publicly available from http://www.cs.nott.ac.uk/~axe/  ... 
doi:10.1016/j.eswa.2015.01.038 fatcat:ydxz7byyazd7jncs54vosagna4

A survey of search methodologies and automated system development for examination timetabling

R. Qu, E. K. Burke, B. McCollum, L. T. G. Merlot, S. Y. Lee
2008 Journal of Scheduling  
In this paper we present a critical discussion of the research on exam timetabling in the last decade or so.  ...  Examination timetabling is one of the most important administrative activities that takes place in all academic institutions.  ...  initialised by graph 1999 heuristics with backtracking Ulker et al Specialised Toronto Linear linkage encoding in [154] 2007 crossover graph coloring multi-objective GA framework Reference Initialisation  ... 
doi:10.1007/s10951-008-0077-5 fatcat:jt6nwwl4s5eh7kqepq7oksaaq4

Automated Timetabling Using Stochastic Free-Context Grammar Based on Influence-Mapping

Hany Mahgoub, Mohamed Altaher
2013 International Journal of Advanced Computer Science and Applications  
This system is very useful in cases of the need to find valid, diverse, suitable and on-the-fly timetable which takes into account the soft constraints that has been imposed by the user of the system.  ...  The system uses Stochastic Context-Free Grammar rules to build schedule and make use of influence maps to assign the fittest slot (place & time) for each lecture in the timetable.  ...  this representation on benchmark graph coloring and exam timetabling problems with hard constraints [16] .  ... 
doi:10.14569/ijacsa.2013.041216 fatcat:fjkc5zb3y5hbfhisqvpvce2ave

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian E.M. Plum, Bo Vaaben
2013 European Journal of Operational Research  
We illustrate the application of these ideas in four major problems: a) integration of planning and scheduling in batch processes that lead to large-scale mixed-integer linear programs, b) optimization  ...  In the chain, one application produces input load for the next one. MapReduce applications are example of 2-stage chains.  ...  We present a linear-time algorithm for the biclique partition problem in graphs whose blocks are complete graphs, cycles, complete bipartite graphs, special bipartite graphs or wheels.  ... 
doi:10.1016/j.ejor.2012.08.016 fatcat:c27kagfnxnhjfbil2rydhjhomm

Planning and Operations Research (Dagstuhl Seminar 18071)

J. Christopher Beck, Daniele Magazzeni, Gabriele Röger, Willem-Jan Van Hoeve, Michael Wagner
2018 Dagstuhl Reports  
While this difference results in problems in different complexity classes, it is often possible to cast the same problem as an OR, CP, or planning problem.  ...  From a historical perspective, operations research stems from the application of mathematical methods to (mostly) industrial applications while planning and constraint programming emerged as subfields  ...  In contrast to planning, CP seems better suited for problems without a temporal aspect (or with a fixed horizon) like graph coloring.  ... 
doi:10.4230/dagrep.8.2.26 dblp:journals/dagstuhl-reports/BeckMRH18 fatcat:lavt5jfujfarfmtwrpbbxan2oq

Distributed constraint satisfaction with multiply sectioned constraint networks

Yang Xiang, Younis Mohamed, Wanling Zhang
2014 International Journal of Information and Decision Sciences  
Its time complexity is linear on the number and size of local problems (each in charge by an agent) and is exponential on cluster size of LJF.  ...  We propose a new algorithmic framework, multiply sectioned constraint networks (MSCNs), for solving distributed constraint satisfaction problems (DisCSPs) with complex local problems.  ...  Complexity of the algorithm is linear on the number and size of local problems, and is exponential on cluster size in local JT decomposition.  ... 
doi:10.1504/ijids.2014.061771 fatcat:3gao3syitfavljkis4tnqrgfnm

Interactive knowledge networks for interdisciplinary course navigation within Moodle

Andre Scherl, Kathrin Dethleffsen, Michael Meyer
2012 Advances in Physiology Education  
In a field study, we analyzed the effects of this learning environment on physiology and physics knowledge as well as the transfer ability of third-term medical students.  ...  Previous work has identified guidance through these complex environments as a crucial problem of their acceptance and efficiency.  ...  synchronized in the students' timetables.  ... 
doi:10.1152/advan.00086.2012 pmid:23209009 fatcat:cy6qlfydubfp5ktqscjaljjaoa

Editorial survey: swarm intelligence for data mining

David Martens, Bart Baesens, Tom Fawcett
2010 Machine Learning  
In addition to an overview of these nature inspired computing methodologies, we discuss popular data mining techniques based on these principles and schematically list the main differences in our literature  ...  to intelligent solutions for complex problems.  ...  Acknowledgements We would like to thank the reviewers of the submissions for the special issue on swarm intelligence for data mining, as well as editor-in-chief Foster Provost for the invitation and guidance  ... 
doi:10.1007/s10994-010-5216-5 fatcat:l5xankksffgl5ppwysinb22rze

Toward Digital Twin Oriented Modeling of Complex Networked Systems and Their Dynamics: A Comprehensive Survey

Jiaqi Wen, Bogdan Gabrys, Katarzyna Musial
2022 IEEE Access  
This paper aims to provide a comprehensive critical overview on how entities and their interactions in Complex Networked Systems (CNS) are modelled across disciplines as they approach their ultimate goal  ...  CNS dynamics modelled offline in the 1st generation v.s. CNS dynamics modelled simultaneously with a two-way real time feedback between reality and the CNS in the 5th generation).  ...  Graph theory focuses on providing rigorous proofs for graph properties, such as graph enumeration, coloring, and covering [189] , [194] , while the evolution of random graphs motivated graph theory to  ... 
doi:10.1109/access.2022.3184801 fatcat:q7glnphnobbkxforsqbafpgbri

ijair-volume-6-issue-1-vii-january-march-2019 -HINDUSTAN BOOK.pdf

V. Thamilarasi
2022 figshare.com  
AND OR GRAPHS AND -OR Graph shows structured representation and knowledge, this graph supports problem disintegration like divide and over throw, finding solution to small parts and ploy to upper node.  ...  AND -OR Graph AND -OR Graph shows structured representation and knowledge, this graph supports problem disintegration like divide and over throw, finding solution to small parts and ploy to upper node.  ...  CONCLUSION Automatic timetable generator is a web based application for generating timetable automatically.  ... 
doi:10.6084/m9.figshare.20217722.v1 fatcat:l74ihuqhcvdtjomod3zdwzfniu

Reducing Efficiency of Connectivity-Splitting Attack on Newscast via Limited Gossip [chapter]

Jakub Muszyński, Sébastien Varrette, Pascal Bouvry
2016 Lecture Notes in Computer Science  
width, color and turning angle.  ...  For this purpose, a new graph-based two-phase level encoding scheme is developed.  ... 
doi:10.1007/978-3-319-31204-0_20 fatcat:27rnwllk75cv5kncys2u7utreq

Fifty years of scheduling: a survey of milestones

C N Potts, V A Strusevich
2009 Journal of the Operational Research Society  
The main topics covered in the respective decades are combinatorial analysis, branch and bound, computational complexity and classification, approximate solution algorithms, and enhanced scheduling models  ...  challenges remain for new and established researchers in this exciting and rewarding area.  ...  Achnowledgements-The authors are grateful to NG Hall and ME Posner for some useful suggestions on the content of some sections of this paper.  ... 
doi:10.1057/jors.2009.2 fatcat:trzjs3iaqbdara3waf7u2fagam

Hybrid Genetic Algorithms: A Review

Tarek A. El-Mihoub, Adrian A. Hopgood, Lars Nolle, Alan Battersby
2006 Engineering Letters  
Hybrid genetic algorithms have received significant interest in recent years and are being increasingly used to solve real-world problems.  ...  In this paper, different forms of integration between genetic algorithms and other search and optimization techniques are reviewed.  ...  Orvosh and Davis [55] found that 5% partial Lamarckian is the optimal learning strategy to solve the survival network design problem and the graph coloring problem.  ... 
dblp:journals/engl/El-MihoubHNB06 fatcat:wac2moajz5ehnb3guyc5mg4z2i
« Previous Showing results 1 — 15 out of 128 results