The DOI matches its Crossref record.
Parallel Problem Solving from Nature - PPSN VIII: 8th International Conference, Birmingham, UK, September 18-22, 2004. Proceedings
Open accessAbstract
Two ideas taken from Bayesian optimization and classifier systems are presented for personnel scheduling based on choosing a suitable scheduling rule from a set for each person’s assignment. Unlike our previous work of using genetic algorithms whose learning is implicit, the learning in both approaches is explicit, i.e. we are able to identify building blocks directly. To achieve this target, the Bayesian optimization algorithm builds a Bayesian network of the joint probability distribution of the rules used to construct solutions, while the adapted classifier system assigns each rule a strength value that is constantly updated according to its usefulness in the current situation. Computational results from 52 real data instances of nurse scheduling demonstrate the success of both approaches. It is also suggested that the learning mechanism in the proposed approaches might be suitable for other scheduling problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
SMS-EMOA: Multiobjective selection based on dominated hypervolume
Beume, N., Naujoks, B., & Emmerich, M. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.08.008 · Cited by 2,048
Robust optimization – A comprehensive survey
Beyer, H.-G., & Sendhoff, B. (2007) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2007.03.003 · Cited by 1,594
Borg: An Auto-Adaptive Many-Objective Evolutionary Computing Framework
Hadka, D., & Reed, P. (2013) · Evolutionary Computation · doi:10.1162/evco_a_00075 · Cited by 717
Evolutionary dynamic optimization: A survey of the state of the art
Nguyen, T. T., Yang, S., & Branke, J. (2012) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2012.05.001 · Cited by 656
An introduction and survey of estimation of distribution algorithms
Hauschild, M., & Pelikan, M. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.08.003 · Cited by 478
A Gentle Introduction to Memetic Algorithms
Moscato, P., & Cotta, C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_5 · Cited by 457
Pareto-, Aggregation-, and Indicator-Based Methods in Many-Objective Optimization
Wagner, T., Beume, N., & Naujoks, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70928-2_56 · Cited by 425
Quality Assessment of Pareto Set Approximations
Zitzler, E., Knowles, J., & Thiele, L. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88908-3_14 · Cited by 313
A survey on multi-objective evolutionary algorithms for many-objective problems
von Lücken, C., Barán, B., & Brizuela, C. (2014) · Computational Optimization and Applications · doi:10.1007/s10589-014-9644-1 · Cited by 297
Evacuation planning using multiobjective evolutionary optimization approach
Saadatseresht, M., Mansourian, A., & Taleai, M. (2009) · European Journal of Operational Research · doi:10.1016/j.ejor.2008.07.032 · Cited by 290
Otake, Y., Wang, A. S., Webster Stayman, J., Uneri, A., Kleinszig, G., Vogt, S., Khanna, A. J., Gokaslan, Z. L., & Siewerdsen, J. H. (2013) · Physics in Medicine and Biology · doi:10.1088/0031-9155/58/23/8535 · Cited by 85
AFSCN scheduling: How the problem and solution have evolved
Barbulescu, L., Howe, A., & Whitley, D. (2006) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2005.12.004 · Cited by 69
Metadata
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W3102715269
- Cited by
- 1,147
- References
- 0
- FWCI
- 246.92
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
