PSO-based algorithm for home care worker scheduling in the UK

Computers and Industrial Engineering

Volumn 53, Issue 4, 2007, Pages 559-583

  Akjiratikarl, Chananes ^a   Yenradee, Pisal ^a   Drake, Paul R ^b  

^a THAMMASAT UNIVERSITY   (Thailand)

^b UNIVERSITY OF LIVERPOOL MANAGEMENT SCHOOL   (United Kingdom)

Author keywords

Heuristics; Home care; Local improvement procedures; Meta heuristic; Particle Swarm Optimization; Rostering; Scheduling

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; REAL TIME SYSTEMS; SCHEDULING;

HOME CARE; LOCAL IMPROVEMENT PROCEDURES; META-HEURISTIC; PARTICLE SWARM OPTIMIZATION; ROSTERING;

SOCIAL ASPECTS;

EID: 35348871210     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2007.06.002     Document Type: Article

References (53)

1. Allahverdi A., and Al-Anzi F.S. A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. Computers and Operations Research 33 (2006) 1056-1080
2. Andrés C., and Lozano S. A particle swarm optimization algorithm for part-machine grouping. Robotics and Computer-Integrated Manufacturing 22 5-6 (2006) 468-474
3. Bianco L., Bielli M., Mingozzi A., Ricciardelli S., and Spadoni M. A heuristic procedure for the crew scheduling problem. European Journal of Operational Research 58 (1992) 272-283
4. Bouthillier A.L., and Crainic T.G. A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers and Operations Research 32 (2005) 1685-1708
5. Bräysy O., Dullaert W., and Gendreau M. Evolutionary algorithms for the vehicle routing problem with time windows. Journal of Heuristics 10 (2004) 587-611
6. Cheang B., Li H., Lim A., and Rodrigues B. Nurse scheduling problems - A bibliographic survey. European Journal of Operational Research 151 (2003) 447-460
7. Cheng B.W., and Chang C.L. A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm. Expert Systems with Application 32 (2007) 415-421
8. Chiang W., and Russell R. Simulated annealing methaheuristics for the vehicle routing problem with time windows. Annals of Operations Research 63 (1996) 3-27
9. Clerc, M. (1999). The swarm and the queen: Towards a deterministic and adaptive particle swarm optimization. In Proceeding of the IEEE congress on evolutionary Computation (pp. 1951-1957). Washington, DC: Piscataway, NJ IEEE service center.
10. Desrochers M., Lentra J., Savelsbergh M., and Soumis F. Vehicle routing with time windows: Optimization and approximation (1988), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam
11. Desrochers M., Desrosiers J., and Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40 (1992) 342-354
12. Dooley K.J., and Mahmoodi F. Identification of Robust scheduling heuristics: Application of Taguchi methods in simulation studies. Computers and Industrial Engineering 22 4 (1992) 359-368
13. Drake P., and Davies B.M. Home care outsourcing strategy. Journal of Health Organization and Management 20 3 (2006) 175-193
14. Eberhart, R., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In Proceeding of the sixth international symposium on micro machine and human science (pp. 39-43). Nagoya, Japan: Piscataway, NJ IEEE service center.
15. Eberhart, R. C., Shi, Y. (2001). Particle swarm optimization: Developments, applications, and resources. In Proceeding of the IEEE congress on evolutionary computation (pp. 81-86). Seoul Korea: Piscataway, NJ IEEE service center.
16. Ernst A.T., Jiang H., Krishnamoorthy M., and Sier D. Staff scheduling and scheduling: A review of applications, methods and methods. European Journal of Operational Research 153 (2004) 3-27
17. Everborn P., Flisberg P., and Rönnqvist M. LAPS CARE - An operational system for staff planning of home care. European Journal of Operational Research 171 (2006) 962-976
18. Fisher M.L., Jornsten K.O., and Madsen O.B.G. Vehicle routing with time windows: Two optimization algorithms. Operations Research 45 (1997) 488-492
19. Gambardella, L. M., Taillard, E., Agazzi, G. (1999). MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows, New Ideas in Optimization, McGraw-Hill, (Also available as Technical Report IDSIA-06-99, IDSIA, Lugano, Switzerland).
20. Garcia B.L., Potvin J.Y., and Rousseau J.M. A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Computers and Operations Research 21 (1994) 1025-1033
21. Goumopoulos C., and Housos E. Efficient trip generation with a rule modelling system for crew scheduling problems. Journal of Systems and Software 69 1-2 (2004) 43-56
22. Homberger J., and Gehring H. A two-phase hybrid metaheuristic for routing problems with time windows. European Journal of Operational Research 162 (2005) 220-238
23. Hwa F., Liu F., and Shen S.Y. A route-neighborhood-based metaheuristic for vehicle routing problem with time windows. European Journal of Operational Research 128 (1999) 485-504
24. Jerald J., Asokan P., Prabaharan G., and Saravanan R. Scheduling optmisation of flexible manufacturing systems using particle swarm optmisation algorithm. International Journal of Advanced Manufacturing Technology 25 (2005) 964-971
25. Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In: Proceeding of IEEE international conference on neural networks IV (pp. 1942-1948). Piscataway, NJ IEEE service center.
26. Kolen A.W.J., Kan A.H.G.R., and Trienekens H.W.J.M. Vehicle routing with time windows. Operations Research 35 (1987) 266-273
27. Lian Z., Gu X., and Jiao B. A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Applied Mathematics and Computation 175 1 (2006) 773-785
28. Liao C.J., Tseng C.T., and Luarn P. A discrete version of particle swarm optimization for flowshop scheduling problems. Computers and Operations Research 34 (2007) 3099-3111
29. Lin S., and Kernighan B.W. An effective heuristic algorithm for the Traveling Salesman problem. Operations Research 21 (1973) 498-516
30. Lin C.K.Y., Lai K.F., and Hung S.L. Development of a workforce management system for a customer hotline service. Computers and Operations Research 27 (2000) 987-1004
31. Liu F.H.F., and Shen S.Y. An overview of a heuristic for vehicle routing problem with time windows. Computers and Industrial Engineering 37 (1999) 331-334
32. Lopes, H. S., Coelho, L. S. (2005). Particle swarm optimization with fast local search for the blind traveling salesman problem. In Proceedings of the fifth international conference on hybrid intelligent systems (HIS'05) (pp. 245-250). IEEE computer society.
33. Pang, W., Wang, K., Zhou, C., & Dong, L. (2004a). Fuzzy discrete particle swarm optimization for solving travelling salesman problem. In Proceedings of the fourth international conference on computer and information technology (CIT'04) (pp. 796-800). IEEE computer society.
34. Pang, W., Wang, K., Zhou, C., Dong, L., Liu, M., Zhang, H., & Wang, J. (2004b). Modified particle swarm optimization based on space transformation for solving traveling salesman problem. In Proceedings of the third international conference on machine learning and cybernetics (pp. 2342-2346). Shanghai: IEEE.
35. Potvin J.Y., and Rousseau J.M. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research 66 (1993) 331-340
36. Potvin J.Y., and Rousseau J.M. Exchange heuristic for routing problems with time windows. Journal of the Operational Research Society 46 (1995) 1433-1446
37. Potvin J.Y., and Bengio S. The vehicle routing problem with time windows - Part II: Genetic search. Informs Journal of Computing 8 (1996) 165-172
38. Potvin J., Kervahut T., Garcia B., and Rousseau J. The vehicle routing problem with time windows, part I: Tabu search. Informs Journal of Computing 8 (1996) 158-164
39. Savelsbergh M.W.P. An efficient implementation of local search algorithms for constrained routing problems. European Journal of Operational Research 47 (1990) 75-85
40. Shen Q., Shi W., Yang X., and Ye B. Particle swarm algorithm trained neural network for QSAR studies of inhibitors of platelet-derived growth factor receptor phosphorylation. European Journal of Pharmaceutical Sciences 28 5 (2006) 369-376
41. Shi Y., and Eberhart R.C. Parameter selection in particle swarm optimization. Proceedings of the seventh annual conference on evolutionary programming (1998), Springer-Verlag, New York 591-600
42. Solomon M.M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research 35 (1987) 254-265
43. Solomon M., and Desrosiers J. Time window constrained routing and scheduling problem. Transportation Science 22 (1988) 1-13
44. Taillard E., Badeau P., Gendreau M., Guertin F., and Potvin J. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31 (1997) 170-186
45. Tan K.C., Lee L.H., Zhu Q.L., and Ou K. Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence in Engineering 15 (2001) 281-295
46. Tasgetiren, M. F., Liang, Y. C., Sevkli, M., Gencyilmaz, G. (2004). Particle swarm optimization algorithm for single machine total weighted tardiness problem. In Proceedings of the 2004 congress on evolutionary computation (pp. 1412-1419). Piscataway, NJ IEEE service center.
47. Tasgetiren M.F., Liang Y.C., Sevkli M., and Gencyilmaz G. Particle swarm optimization algorithm for makespan and total flowtime minimization in permutation flowshop sequencing problem. European Journal of Operational Research 177 (2007) 1930-1947
48. Thangiah, S.R., Osman, I.H., & Sun, T. (1994). Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows. Technical report SRU-CpSc-TR-94-27, Computer Science Department, Slippery Rock University.
49. Trelea C. The particle swarm optimization algorithm: Convergence analysis and parameter selection. Information Processing Letters 85 (2003) 317-325
50. Xia W., and Wu Z. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers and Industrial Engineering 48 (2005) 409-425
51. Yan S., and Tu Y. A network model for airline cabin crew scheduling: Case study. European Journal of Operational Research 140 (2002) 531-540
52. Yin P., Yu S., Wang P., and Wang Y. Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization. Applied Mathematics and Computation 184 (2007) 407-420
53. Zhang H., Li H., and Tam C.M. Particle swarm optimization for resource-constrained project scheduling. International Journal of Project Management 24 (2006) 83-92