All Stories

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