A smart calendar system using multiple search techniques

Calendars are essential for professionals working in industry, government, education and many other fields, which play a key role in the planning and scheduling of people’s day-today events. The majority of existing calendars only provide insight and reminders into what is happening during a certain period of time, but do not offer any actual scheduling functionality that can assist users in creating events to be optimal to their preferences. The burden is on the users to work out when their events should happen, and thus it would be very beneficial to develop a tool to organise personal time to be most efficient based on given tasks, preferences, and constraints, particularly for those people who have generally very busy calendars. This paper proposes a smart calendar system capable of optimising the timing of events to address the limitations of the existing calendar systems. It operates in a tiered format using three search algorithms, namely branch and bound, Hungarian and genetic algorithms, to solve different sized problems with different complexity and features, in an effort to generate a balanced solution between time consumption and optimisation satisfaction. Promising results have shown in the experimentation in personal event planning and scheduling.

[1]  Inman Harvey,et al.  Optimal Mutation Rates and Selection Pressure in Genetic Algorithms , 2000, GECCO.

[2]  David Joslin,et al.  "Squeaky Wheel" Optimization , 1998, AAAI/IAAI.

[3]  Sam Kwong,et al.  Genetic algorithms: concepts and applications [in engineering design] , 1996, IEEE Trans. Ind. Electron..

[4]  Qiang Shen,et al.  Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches , 2001, Artificial Intelligence Review.

[5]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[7]  Qiang Shen,et al.  Solution Techniques for Constraint Satisfaction Problems: Foundations , 2001, Artificial Intelligence Review.

[8]  Erik Demeulemeester,et al.  A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .

[9]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[10]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[11]  P. W. Poon,et al.  Genetic algorithm crossover operators for ordering applications , 1995, Comput. Oper. Res..

[12]  Richard M. Soland,et al.  A branch and bound algorithm for the generalized assignment problem , 1975, Math. Program..

[13]  Tomás E. Uribe,et al.  Active preference learning for personalized calendar scheduling assistance , 2005, IUI.

[14]  Qiang Shen,et al.  Fuzzy rrDFCSP and planning , 2003, Artif. Intell..

[15]  David E. Goldberg,et al.  Genetic Algorithms, Tournament Selection, and the Effects of Noise , 1995, Complex Syst..

[16]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[17]  M. Bernardine Dias,et al.  The Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs , 2007 .

[18]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[19]  Jimmy J. Lin,et al.  Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce , 2010, 2010 IEEE Second International Conference on Cloud Computing Technology and Science.

[20]  Josef Kittler,et al.  Fast branch & bound algorithms for optimal feature selection , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[22]  Carlos A. Coello Coello,et al.  Constraint-handling in genetic algorithms through the use of dominance-based tournament selection , 2002, Adv. Eng. Informatics.