All Stories

  1. Revisiting local search for Curriculum-Based Course Timetabling
  2. A unified formulation for home healthcare routing and scheduling problems
  3. Large Neighborhood Search for Capacitated Facility Location with Customer Incompatibilities
  4. Dynamic Temperature Control of Simulated Annealing using Hyper-Heuristics
  5. Solving the slab selection and relocation problem in a real production yard using simulated annealing
  6. A compact model for the home healthcare routing and scheduling problem
  7. Multi‐neighborhood simulated annealing for the home healthcare routing and scheduling problem
  8. Multi-Neighborhood Simulated Annealing for the Capacitated Dispersion Problem
  9. EasyLocal++ a 25-year Perspective on Local Search Frameworks
  10. Solving the medical student scheduling problem using simulated annealing
  11. Reinforcement Learning for Multi-Neighborhood Local Search in Combinatorial Optimization
  12. Enhancing Real-World Applicability in Home Healthcare: A Metaheuristic Approach for Advanced Routing and Scheduling
  13. Solving the Integrated Patient-to-Room and Nurse-to-Patient Assignment by Simulated Annealing
  14. Multi-neighbourhood simulated annealing for the ITC-2007 capacitated examination timetabling problem
  15. Multi-neighborhood simulated annealing for the capacitated facility location problem with customer incompatibilities
  16. Local Search for Integrated Predictive Maintenance and Scheduling in Flow-Shop
  17. Simulated Annealing for the Home Healthcare Routing and Scheduling Problem
  18. Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities
  19. Task design in complex crowdsourcing experiments: Item assignment optimization
  20. Educational Timetabling: Problems, Benchmarks, and State-of-the-Art Results
  21. Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
  22. Exact and metaheuristic approaches for unrelated parallel machine scheduling
  23. Multi-Neighborhood Simulated Annealing for the Minimum Interference Frequency Assignment Problem
  24. Correction to: Solving a home energy management problem by Simulated Annealing
  25. Solving a home energy management problem by SA
  26. Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods
  27. Local Search and Constraint Programming for a Real-World Examination Timetabling Problem
  28. Modelling and solving the thesis defense timetabling problem
  29. The practice and theory of automated timetabling (2016)
  30. Modeling and solving the steelmaking and casting scheduling problem
  31. The Second International Nurse Rostering Competition
  32. Solving discrete lot-sizing and scheduling by simulated annealing and mixed integer programming
  33. Modeling and solving a real-life multi-skill shift design problem
  34. Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
  35. Feature-based tuning of single-stage simulated annealing for examination timetabling
  36. Comments on: An overview of curriculum-based course timetabling
  37. Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
  38. Local search techniques for a routing-packing problem
  39. The generalized balanced academic curriculum problem with heterogeneous classes
  40. The Third International Timetabling Competition
  41. Automated Shift Design and Break Scheduling
  42. Modeling and solving the dynamic patient admission scheduling problem under uncertainty
  43. Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem
  44. The first international nurse rostering competition 2010
  45. XHSTT: an XML archive for high school timetabling problems in different countries
  46. Hybrid metaheuristics for constrained portfolio selection problems
  47. Local search and lower bounds for the patient admission scheduling problem
  48. Local search for a multi-drop multi-container loading problem
  49. Design and statistical analysis of a hybrid local search algorithm for course timetabling
  50. The balanced academic curriculum problem revisited
  51. Local Search for Constrained Financial Portfolio Selection Problems with Short Sellings
  52. Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs
  53. Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
  54. Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
  55. A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
  56. Multi-neighborhood Local Search for the Patient Admission Problem
  57. Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem
  58. The minimum shift design problem
  59. Simulation of fuel consumption and emissions in typical traffic circumstances in Belgium
  60. A composite-neighborhood tabu search approach to the traveling tournament problem
  61. Hybrid Local Search for Constrained Financial Portfolio Selection Problems
  62. Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals
  63. EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms
  64. EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms
  65. Floating Automotive Data Collection
  66. Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems
  67. Simulations of Fuel Consumption and Emissions in Typical Traffic Circumstances
  68. Compiling problem specifications into SAT
  69. Theory and Practice of the Minimum Shift Design Problem
  70. Local search for shift design
  71. Writing Local Search Algorithms Using Easylocal++
  72. Multi-neighbourhood Local Search with Application to Course Timetabling
  73. The Minimum Shift Design Problem: Theory and Practice
  74. EASYLOCAL++: an object-oriented framework for the flexible design of local-search algorithms
  75. Tabu Search Techniques for Examination Timetabling
  76. NP-SPEC: an executable specification language for solving all problems in NP
  77. LOCAL++: A C++ framework for local search algorithms
  78. LOCAL++: A C++ framework for local search algorithms
  79. Solving Employee Timetabling Problems by Generalized Local Search
  80. Local search techniques for large high school timetabling problems
  81. The Alma Project, or How First-Order Logic Can Help us in Imperative Programming
  82. Alma-O: an imperative language that supports declarative programming
  83. An epistemic operator for description logics
  84. A refined architecture for terminological systems: Terminology = Schema + Views
  85. np-spec: An Executable Specification Language for Solving All Problems in NP
  86. Search and imperative programming
  87. Experimental analysis of the computational cost of evaluating Quantified Boolean Formulae
  88. Reasoning with individuals in concept languages
  89. Deduction in Concept Languages: from Subsumption to Instance Checking
  90. Queries, rules and definitions as epistemic sentences in concept languages
  91. On the complexity of the instance checking problem in concept languages with existential quantification
  92. Reasoning with individuals in concept languages
  93. On the complexity of the instance checking problem in concept languages with existential quantification
  94. A hybrid system with datalog and concept languages
  95. Compiling Problem Specifications into SAT
  96. Querying concept-based knowledge bases
  97. Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
  98. LOCAL++: a C++ framework for local search algorithms