69 Hits in 5.9 sec

A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem

Aldy Gunawan, Kien Ming Ng, Kim Leng Poh
2012 Computers & Operations Research  
A solver for the problem, which integrates both teacher assignment and course scheduling, is described.  ...  An initial solution is obtained by a mathematical programming approach based on Lagrangian relaxation. This solution is further improved by a simulated annealing algorithm.  ...  It is based on the hybridization of the Lagrangian relaxation approach and a simulated annealing algorithm.  ... 
doi:10.1016/j.cor.2012.03.011 fatcat:iehz2xz3wbdvhjcx25ytrhign4

An Improved Analysis of PSO in Scheduling With Virtualization through Internet-Cloud Computing

Anirudh Acharya. A, Deepak Kumar, Chethan Kumar C S
2019 Zenodo  
Scheduling problem for user requests in cloud computing environment is not possible complete. This problem is usually solved by using heuristic methods in order to reduce to polynomial complexity.  ...  Nowadays scheduling problems are raised in areas like industry, academic, health care, production and manufacturing areas and in private sectors also.  ...  Simulated annealing is probabilistic iterative based method used in applied mathematics.  ... 
doi:10.5281/zenodo.2566810 fatcat:6utmibaf2naq3g3aid5g73nmau

Hybrid evolutionary techniques for the maintenance scheduling problem

E.K. Burke, A.J. Smith
2000 IEEE Transactions on Power Systems  
Of course, in practice, for a problem like this, the time taken to produce a solution is not a major issue. What is far more important is the quality of the solution.  ...  The resulting algorithm from this hybrid approach has been termed a Memetic Algorithm. This paper investigates the use of a memetic algorithm for the thermal generator maintenance scheduling problem.  ...  It would be interesting to see whether the algorithm presented here could be usefully applied to this problem, and also if the technique can produce good results for a related problem in the electricity  ... 
doi:10.1109/59.852110 fatcat:kgydn7valrhnhexbyam7okdnae

Decomposition based hybrid metaheuristics

Günther R. Raidl
2015 European Journal of Operational Research  
If designed appropriately, such hybrids frequently outperform simpler "pure" approaches as they are able to exploit the underlying methods' individual advantages and benefit from synergy.  ...  It has been recognized that these concepts may also provide a very fruitful basis for effective hybrid metaheuristics.  ...  Given a solution λ to the Lagrangian dual problem (3) and a corresponding optimal solution x * to the Lagrangian relaxation (2) that is also feasible for the original problem (1), i.e., Dx * ≥ d, the following  ... 
doi:10.1016/j.ejor.2014.12.005 fatcat:n7qania37rcclf2qoqcajdzope

Scheduling in sports: An annotated bibliography

Graham Kendall, Sigrid Knust, Celso C. Ribeiro, Sebastián Urrutia
2010 Computers & Operations Research  
A hybridization of simulated annealing with hill-climbing is proposed for the TTP. The search space is divided into a timetable space and a team assignment space.  ...  The TTP is solved by a hybrid algorithm combining Lagrangian relaxation and constraint programming in a hierarchical architecture.  ...  The best results are often obtained by methods derived from the hybridization of integer programming, constraint programming and metaheuristics.  ... 
doi:10.1016/j.cor.2009.05.013 fatcat:dznvxw2ulvhk3gdvpybw324spa

An Efficient Hybrid Approach for Scheduling the Train Timetable for the Longer Distance High-Speed Railway

Zeyu Wang, Leishan Zhou, Bin Guo, Xing Chen, Hanxiao Zhou
2021 Sustainability  
In this paper, a hybrid approach for quickly solving the timetable of high-speed railways, inspired by the periodic model and the aperiodic model, is proposed.  ...  A space–time decomposition method is proposed to convert the complex passenger travel demands into service plans and decompose the original problem into several sub-problems, to reduce the solving complexity  ...  Acknowledgments: The authors would like to express great appreciation to editors and reviewers for their positive and constructive comments.  ... 
doi:10.3390/su13052538 fatcat:tjcsf66pnvesnobhtef5bcmjye

Developing a Model for the University Course Timetabling Problem: A Case Study

Mozhgan Mokhtari, Majid Vaziri Sarashk, Milad Asadpour, Nadia Saeidi, Omid Boyer, Baogui Xin
2021 Complexity  
Many researchers, therefore, have been formulating the problem of timetabling lectures using different methods.  ...  In this research, a multiobjective mixed-integer programming model was developed to provide a timetable for the postgraduate courses at the Industrial Engineering Department of Islamic Azad University,  ...  An initial solution was obtained based on the Lagrangian relaxation method; however, this solution was further improved by a Simulated Annealing algorithm. e applicability of the proposed model was examined  ... 
doi:10.1155/2021/9940866 fatcat:blzxl6mdfbbzthprquyvinvw4q

Models and algorithms for combinatorial optimization problems arising in railway applications

Valentina Cacchiani
2008 4OR  
The problem is solved through a simulated annealing procedure.  ...  ) model for the problem and then proposing a heuristic algorithm based on its Lagrangian relaxation.  ...  For each trip j which is covered and would remain such even by decreasing some w k j value, we redefine the w k j values as the optimal solution of the problem: (Again, this problem is solved quickly by  ... 
doi:10.1007/s10288-008-0075-7 fatcat:l23g3tdhwbhq7erk66hj6ngjsi

Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization [chapter]

Günther R. Raidl, Jakob Puchinger
2008 Studies in Computational Intelligence  
Only over the last years a larger number of researchers recognized the advantages and huge potentials of building hybrids of mathematical programming methods and metaheuristics.  ...  The crucial issue is how mathematical programming methods and metaheuristics should be combined for achieving those benefits. Many approaches have been proposed in the last few years.  ...  Acknowledgements This work is partly supported by the European RTN ADONET under grant 504438 and the "Hochschuljubiläumsstiftung" of Vienna, Austria, under contract number H-759/2005.  ... 
doi:10.1007/978-3-540-78295-7_2 fatcat:lenuq54xgzfktottkd6odh22qy

Course timetabling at a Tunisian University: A case study

Abdelaziz Dammak, Abdelkarim Elloumi, Hichem Kamoun, Jacques A. Ferland
2008 Journal of Systems Science and Systems Engineering  
This paper deals with the Course Timetabling Problem at an institution in a Tunisian University.  ...  We describe the timetabling problem using a list of all specific hard and soft constraints.  ...  Acknowledgments We thank three anonymous referees for their constructive comments which have improved the content and the quality of the paper.  ... 
doi:10.1007/s11518-008-5079-5 fatcat:d5b5da67bjffpjjukrbzh3qoni

Manpower Planning using Heuristics

Nang Laik, Murphy Choy
2020 International Journal of Computer Applications  
A mathematical model for manpower planning is then developed and solved using heuristics.  ...  Thus, the model proposed is based on past historical data over 36 months" periods and analyse the service time for each appointment to have a realistic number which will affect the number of staff required  ...  The authors appreciate the relevant party involved for their time and effort to do the knowledge transfer and validate the proposed results in their operation.  ... 
doi:10.5120/ijca2020920319 fatcat:3uqko4pgufcl7gc5la7w7ep6h4

Constraint satisfaction problems: Algorithms and applications

Sally C. Brailsford, Chris N. Potts, Barbara M. Smith
1999 European Journal of Operational Research  
and simulated annealing.  ...  Many combinatorial problems in operational research, such as scheduling and timetabling, can be formulated as CSPs.  ...  Acknowledgements The authors are grateful to Rachel Bothamley for collecting several of the references used in this paper, and to Philippe Baptiste for some comments on the performance of job shop scheduling  ... 
doi:10.1016/s0377-2217(98)00364-6 fatcat:jc64g2qlcndupnx3oh6c7frkay

Quantum annealing in the NISQ era: railway conflict management [article]

Krzysztof Domino, Mátyás Koniorczyk, Krzysztof Krawiec, Konrad Jałowiecki, Sebastian Deffner, Bartłomiej Gardas
2021 arXiv   pre-print
As a reference, we also provide solutions calculated with classical methods, including those relevant to the community (linear integer programming) and a sophisticated algorithm based on tensor networks  ...  The model's instances can be executed on present-day quantum annealers. As a proof-of-concept, we solve selected real-life problems from the Polish railway network using D-Wave quantum annealers.  ...  of Hungary; and the Foundation for Polish Science (FNP) under grant number TEAM NET POIR.04.04.00-00-17C1/18-00 (KD and BG); and the National Science Centre (NCN), Poland, under project number 2016/22/  ... 
arXiv:2112.03674v2 fatcat:2cv4o6jcwrgx3ngq5hqpa6k6ve

Genetic Algorithms for Scheduling Generation and Maintenance in Power Systems [chapter]

C. J. Aldridge, K. P. Dahal, J. R. McDonald
1999 Modern Optimisation Techniques in Power Systems  
The first author was supported by the Engineering and Physical Science Research Council and The National Grid Company, and the second author was supported by Rolls -Royce plc.  ...  The authors also acknowledge the use of the Reproductive Plan Language, RPL2, produced by Quadstone Limited, in the production of this work.  ...  In this form the problem is amenable to Lagrangian relaxation.  ... 
doi:10.1007/978-94-015-9189-8_4 fatcat:qyg5s5himneqbfocaf2azsu4za

Joint Training Offer Selection And Course Timetabling Problems: Models And Algorithms

Gianpaolo Ghiani, Emanuela Guerriero, Emanuele Manni, Alessandro Romano
2015 Zenodo  
In this article, we deal with a variant of the classical course timetabling problem that has a practical application in many areas of education.  ...  Thus, schools need to model the training offer and the related timetabling, with the goal of ensuring the highest possible teaching quality, by meeting the above-mentioned financial, time and resources  ...  INTRODUCTION I N this paper, we study a variant of the classical course timetabling problem.  ... 
doi:10.5281/zenodo.1108405 fatcat:y3xszjzlkjgppi2btjn7nb2hs4
« Previous Showing results 1 — 15 out of 69 results