All Stories

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