8,553 Hits in 7.7 sec

Intelligence Classification of the Timetable Problem: A Memetic Approach

Eboka Andrew Okonji
2017 International Journal on Data Science and Technology  
Many of such algorithms simply search the domain space for a goal state that satisfies the problem constraints.  ...  Our study yields an outcome assignment that provides a complete, feasible and optimal academic schedule that satisfies medium cum hard constraints for the Federal University of Petroleum Resource Effurun  ...  The timetable scheduling problem has remained a classical NP-hard CSP for being a multi-objective and multi-constraint optimization task as its searches a domain space to yield an approximate-feasible,  ... 
doi:10.11648/j.ijdst.20170302.12 fatcat:aoe4e27shzcuncrk4bxnpejqe4

Minimal Perturbation Problem in Course Timetabling [chapter]

Tomáš Müller, Hana Rudová, Roman Barták
2005 Lecture Notes in Computer Science  
A new iterative forward search algorithm is proposed to solve minimal perturbation problems.  ...  A minimal perturbation problem incorporates these changes, along with the initial solution, as a new problem whose solution must be as close as possible to the initial solution.  ...  We would like to thank our students for their assistance in solving this problem and Purdue staff who have helped in many ways.  ... 
doi:10.1007/11593577_8 fatcat:sjyglcxusjcodakupabc5yeajm

A New Approach to Modeling and Solving Minimal Perturbation Problems [chapter]

Roman Barták, Tomáš Müller, Hana Rudová
2004 Lecture Notes in Computer Science  
This description focuses on the modification of the solution after a change in the problem specification. We also describe a new branch-and-bound like algorithm for solving such type of problems.  ...  Such changes complicate usage of a traditionally static constraint satisfaction technology that requires the problem to be fully specified before the solving process starts.  ...  Last but not least we would like to thank to Vlastimil Krápek w ho implemented an automated tester needed for experimental evaluation.  ... 
doi:10.1007/978-3-540-24662-6_13 fatcat:fal6fl4emra4nhdjzdacvyr7v4

A Hybrid Soft Computing Approach for Subset Problems

Broderick Crawford, Ricardo Soto, Eric Monfroy, Carlos Castro, Wenceslao Palma, Fernando Paredes
2013 Mathematical Problems in Engineering  
ACO is a swarm intelligence metaheuristic inspired on ants behavior when they search for food.  ...  Here, we present a hybrid solver based on ant colony optimization (ACO) combined with arc consistency for solving this kind of problems.  ...  The CP approach to search for a feasible solution often works by the iteration of constraint propagation and the addition of additional constraints, and it transforms the problem without changing its solutions  ... 
doi:10.1155/2013/716069 fatcat:ts7nabmr25gwzapxdaa4y577fu

Bounding the optimum of constraint optimization problems [chapter]

Simon de Givry, Gérard Verfaillie, Thomas Schiex
1997 Lecture Notes in Computer Science  
Experimental results on random VCSPs and real problems are given.  ...  Due to their opportunist way of exploring the search space, approximate or incomplete methods, based on heuristic or stochastic Local Search mechanisms, usually provide good solutions within a reasonable  ...  for both problems; this difference may become more important, when incomplete Local Search algorithms are used for producing quickly good upper bounds; -the difficulty of bounding the optimum seems to  ... 
doi:10.1007/bfb0017456 fatcat:ham7egyc4fbfbh2qzxzfpscqum

Distributed Constraint Optimization Problems and Applications: A Survey

Ferdinando Fioretto, Enrico Pontelli, William Yeoh
2018 The Journal of Artificial Intelligence Research  
Distributed Constraint Optimization Problems (DCOPs) have emerged as a prominent agent model to govern the agents' autonomous behavior, where both algorithms and communication models are driven by the  ...  structure of the specific problem.  ...  They are also thankful to Tiep Le for early discussions on Probabilistic DCOPs. The research in this paper has been partially supported by NSF grants 0947465, 1345232, 1401639, 1458595, and 1550662.  ... 
doi:10.1613/jair.5565 fatcat:zeou5gji5fas3h27ab4jxvtwkq

On Population-Based Algorithms for Distributed Constraint Optimization Problems [article]

Saaduddin Mahmud, Md. Mosaddek Khan, Nicholas R. Jennings
2020 arXiv   pre-print
While in our second contribution, we show that population-based approaches can be combined with local search approaches.  ...  Distributed Constraint Optimization Problems (DCOPs) are a widely studied class of optimization problems in which interaction between a set of cooperative agents are modeled as a set of constraints.  ...  Acknowledgements This paper extends our previously published works on population-based DCOP algorithm [50, 51] .  ... 
arXiv:2009.01625v1 fatcat:4odmucn5d5e7xmxkk33nqlyrkq

Genetic Algorithms for Multiple-Choice Problems [article]

Uwe Aickelin
2010 arXiv   pre-print
are carried out on a variety of data.These show that the indirect approach relies less on problem structure and hence is easier to implement and superior in solution quality.  ...  that considers as many requests as possible.In the second problem, shops are allocated to locations in a mall subject to constraints and maximising the overall income.Genetic algorithms are chosen for  ...  Acknowledgements Everybody has someone or something to thank for their success.  ... 
arXiv:1004.3147v1 fatcat:gqwp6eizqrb7ve46x7ks65heay

Design, Engineering, and Experimental Analysis of a Simulated Annealing Approach to the Post-Enrolment Course Timetabling Problem [article]

Sara Ceschia, Luca Di Gaspero, Andrea Schaerf
2011 arXiv   pre-print
The post-enrolment course timetabling (PE-CTT) is one of the most studied timetabling problems, for which many instances and results are available.  ...  In this work we design a metaheuristic approach based on Simulated Annealing to solve the PE-CTT.  ...  In our opinion, the key ingredients for these good results are the following. First of all, the preprocessing and constraint reformulation steps improve the efficacy of the local search.  ... 
arXiv:1104.2518v1 fatcat:lx3khrapnbex5nhq5m24bcx3ce

A New Neural Network Based Construction Heuristic for the Examination Timetabling Problem [chapter]

P. H. Corr, B. McCollum, M. A. J. McGreevy, P. McMullan
2006 Lecture Notes in Computer Science  
Results are presented for a range of examination timetabling problems using standard benchmark datasets.  ...  This paper examines the application of neural networks as a construction heuristic for the examination timetabling problem.  ...  of the methodology to related scheduling problems such as course timetabling for example.  ... 
doi:10.1007/11844297_40 fatcat:b4dd2hqelbdo3cbrfoyxuzf6ea

Genetic Algorithms for Multiple-Choice Optimisation Problems

Uwe Aickelin
2009 Social Science Research Network  
Furthermore, special thanks go to Dr Jonathan Thompson for his early work on the nurse scheduling problem. I would also like to thank my family who in their own ways always supported me.  ...  In the second problem, shops are allocated to locations in a mall subject to constraints and maximising the overall income.  ...  Comparison of nurse scheduling results for various direct genetic algorithm approaches and tabu search. . 1 1 What is an 'Indirect' Approach?  ... 
doi:10.2139/ssrn.2832542 fatcat:czeuc44vebgxdmsqrtvlm5vffe

Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems

William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig
2015 2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)  
Distributed constraint optimization (DCOP) problems are well-suited for modeling multi-agent coordination problems. However, it only models static problems, which do not change over time.  ...  Due to the incremental reasoning employed, our experimental results show that any-space ADOPT and any-space BnB-ADOPT are up to 42% and 38% faster, respectively, with the incremental procedure and the  ...  It is also based upon work supported by ARL/ARO under contract/grant number W911NF-08-1-0468, ONR in form of a MURI under contract/grant number N00014-09-1-1031, and DOT under contract/grant number DTFH61  ... 
doi:10.1109/wi-iat.2015.114 dblp:conf/webi/0001VSK15 fatcat:gvviu3tlzrhozfkum5pb6nhacm

The Bees Algorithm for the Vehicle Routing Problem [article]

Aish Fenton
2016 arXiv   pre-print
In this thesis we present a new algorithm for the Vehicle Routing Problem called the Enhanced Bees Algorithm.  ...  It is adapted from a fairly recent algorithm, the Bees Algorithm, which was developed for continuous optimisation problems.  ...  However, the LNS local search did fail to find a feasible solution for one of the problem instances.  ... 
arXiv:1605.05448v1 fatcat:ejsuuhreonb6vnacajq5hpq4au

Cooperative information-gathering: a distributed problem-solving approach

T. Oates, M.V. Nagendra Prasad, V.R. Lesser
1997 IEE Proceedings - Software Engineering  
This results in the formation of a search organization for the purpose of satisfying a query 16].  ...  We propose a new approach to information gathering based on the distributed problem solving paradigm and its attendant b o d y o f research i n m ulti-agent systems and distributed arti cial intelligence  ...  Sandholm for their insightful discussions and comments on this work.  ... 
doi:10.1049/ip-sen:19971025 fatcat:xmlna6ldjzfhbglz34jw4hinpq

Introduction: Special issue on constraint satisfaction techniques for planning and scheduling problems

Miguel A. Salido, Antonio Garrido, Roman Barták
2008 Engineering applications of artificial intelligence  
The workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, or COPLAS, aims at providing a forum for meeting and exchanging ideas and novel works in the field of AI planning  ...  In fact, most of the accepted papers are based on combined approaches of constraint satisfaction for planning, scheduling, and mixing planning and scheduling.  ...  We would also like to thank the anonymous referees for useful feedback on earlier drafts of the paper.  ... 
doi:10.1016/j.engappai.2008.03.007 fatcat:7dv2wdwsmrednf7t6yltucr23y
« Previous Showing results 1 — 15 out of 8,553 results