The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
PSO-based algorithm for home care worker scheduling in the UK
Open accessAbstract
This paper presents the novel application of a collaborative population-based meta-heuristic technique called Particle Swarm Optimization (PSO) to the scheduling of home care workers. The technique is applied to a genuine situation arising in the UK, where the provision of community care service is a responsibility of the local authorities. Within this provision, optimization routes for each care worker are determined in order to minimize the distance traveled providing that the capacity and service time window constraints are not violated. The objectives of this paper are twofold; first to exploit a systematic approach to improve the existing schedule of home care workers, second to develop the methodology to enable the continuous PSO algorithm to be efficiently applied to this type of problem and all classes of similar problems. For this problem, a particle is defined as a multi-dimensional point in space which represents the corresponding care activities and assignment priority. The Heuristic Assignment scheme is specially designed to transform the continuous PSO algorithm to the discrete job schedule. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), i.e. insertion and swap , are embedded in the PSO algorithm in order to further improve the solution quality. The proposed methodology is implemented, tested, and compared with existing solutions on a variety of real problem instances.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
Particle swarm optimization: developments, applications and resources
Eberhart, & Shi, Y. (2001) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934374 · Cited by 4,310
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Parameter selection in particle swarm optimization
Shi, Y., & Eberhart, R. C. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0040810 · Cited by 3,538
The particle swarm optimization algorithm: convergence analysis and parameter selection
Trelea, I. C. (2003) · Information Processing Letters · doi:10.1016/s0020-0190(02)00447-7 · Cited by 2,644
The swarm and the queen: towards a deterministic and adaptive particle swarm optimization
Clerc, M. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785513 · Cited by 1,692
Staff scheduling and rostering: A review of applications, methods and models
Ernst, A. T., Jiang, H., Krishnamoorthy, M., & Sier, D. (2004) · European Journal of Operational Research · doi:10.1016/s0377-2217(03)00095-x · Cited by 1,260
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
Desrochers, M., Desrosiers, J., & Solomon, M. (1992) · Operations Research · doi:10.1287/opre.40.2.342 · Cited by 1,197
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
Taillard, É. D., Badeau, P., Michel Gendreau, A., Guertin, F., & Potvin, J. (1997) · Transportation Science · doi:10.1287/trsc.31.2.170 · Cited by 957
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
Gambardella, L. M., Taillard, É. D., & Agazzi, G. (1999) · Cited by 725
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Xia, W., & Wu, Z. (2005) · Computers & Industrial Engineering · doi:10.1016/j.cie.2005.01.018 · Cited by 681
Survey Paper—Time Window Constrained Routing and Scheduling Problems
Solomon, M. M., & Desrosiers, J. (1988) · Transportation Science · doi:10.1287/trsc.22.1.1 · Cited by 657
Tasgetiren, M. F., Liang, Y.-C., Sevkli, M., & Gencyilmaz, G. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.12.024 · Cited by 557
Nurse rostering problems––a bibliographic survey
Cheang, B., Li, H., Lim, A., & Rodrigues, B. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(03)00021-3 · Cited by 498
A discrete version of particle swarm optimization for flowshop scheduling problems
Liao, C.-J., Tseng, C.-T., & Luarn, P. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.11.017 · Cited by 445
Laps Care—an operational system for staff planning of home care
Eveborn, P., Flisberg, P., & Rönnqvist, M. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.01.011 · Cited by 372
Simulated annealing metaheuristics for the vehicle routing problem with time windows
Chiang, W.-C., & Russell, R. A. (1996) · Annals of Operations Research · doi:10.1007/bf02601637 · Cited by 354
Heuristic methods for vehicle routing problem with time windows
Tan, K. C., Lee, L. H., Zhu, Q. L., & Ou, K. (2001) · Artificial Intelligence in Engineering · doi:10.1016/s0954-1810(01)00005-x · Cited by 310
Vehicle Routing with Time Windows
Kolen, A. W. J., Kan, A. H. G. R., & Trienekens, H. W. J. M. (1987) · Operations Research · doi:10.1287/opre.35.2.266 · Cited by 304
Particle swarm optimization algorithm for single machine total weighted tardiness problem
Tasgetiren, M. F., Sevkli, M., Liang, Y.-C., & Gencyilmaz, G. (2005) · Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) · doi:10.1109/cec.2004.1331062 · Cited by 216
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Bouthillier, A. L., & Crainic, T. G. (2004) · Computers & Operations Research · doi:10.1016/j.cor.2003.11.023 · Cited by 194
Allahverdi, A., & Al-Anzi, F. S. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2004.09.002 · Cited by 173
Fuzzy discrete particle swarm optimization for solving traveling salesman problem
Pang, W., Wang, K., Zhou, C., & Dong, L.-J. (2004) · IEEE International Conference on Computer and Information Technology (CIT) · doi:10.1109/cit.2004.1357292 · Cited by 161
Vehicle routing with time windows : optimization and approximation
Desrochers, M., Lenstra, J. K., Savelsbergh, M. W. P., & Soumis, F. (1987) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 141
Lian, Z., Gu, X., & Jiao, B. (2005) · Applied Mathematics and Computation · doi:10.1016/j.amc.2005.07.042 · Cited by 135
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows
Br�ysy, O., Dullaert, W. E. H., & Michel Gendreau, A. (2004) · Journal of Heuristics · doi:10.1007/s10732-005-5431-6 · Cited by 127
A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
Lian, Z., Jiao, B., & Gu, X. (2006) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.05.168 · Cited by 123
A network model for airline cabin crew scheduling
Yan, S., & Tu, Y.-P. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(01)00215-6 · Cited by 80
Pang, W., Wang, K., Zhou, C., Dong, L.-J., Liu, M., Zhang, H., & Wang, J. (2005) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2004.1382191 · Cited by 62
Yin, P.-Y., Yu, S.-S., Wang, P.-P., & Wang, Y.-T. (2006) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.06.071 · Cited by 60
A particle swarm optimization algorithm for part–machine grouping
Andrés, C., & Lozano, S. (2006) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2005.11.013 · Cited by 58
Cited by
Personnel scheduling: A literature review
Van den Bergh, J., Beliën, J., De Bruecker, P., Demeulemeester, E., & De Boeck, L. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.11.029 · Cited by 812
Home health care routing and scheduling: A review
Fikar, C., & Hirsch, P. (2017) · Computers & Operations Research · doi:10.1016/j.cor.2016.07.019 · Cited by 471
Metadata
- Authors
- Akjiratikarl, C., Yenradee, P., & Drake, P. R.
- Venue
- Computers & Industrial Engineering
- Publisher
- Elsevier BV
- Published
- 2007-11
- Volume
- 53
- Issue
- 4
- Pages
- 559-583
- ISSN
- 0360-8352 (ISSN-L)
- OpenAlex
- W2064104291
- Cited by
- 296
- References
- 33
- FWCI
- 8.11
- Type
- journal article
- 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.