FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W159706599> ?p ?o ?g. }

• W159706599 abstract "1 AbstractThe Home Care Scheduling Problem (HCSP) involves as-signing nurses to certain people or patients who are in needof support within quite strict time windows at their homes.The assignment is based on particular support requirementsand qualifications of the nurses. Each nurse should visit allthe assigned patients within the determined time windows toperform the tasks concerning them. During these visits, to-tal traveling time should be minimized and a number of con-straints concerning the nurses’ rosters should be handled.HCSP is a combination of two NP-hard problems, namelythe Nurse Rostering Problem (NRP) and the Vehicle Rout-ing Problem (VRP). In the literature, we can find plenty ofstudies related to both problems. However, very limitedstudies are available about the combined HCSP. A relatedcombined problem that shows similar characteristics undersimpler constraints is the Vehicle Routing and SchedulingProblem with Time Window Constraints (VRSPTW) [9].It is the VRP with time windows that cover the time hori-zon for delivering goods or services to customers. In theHCSP, different nurses with different skills are required, theservices delivered are more complicated and more types oftasks are present than in the VRSPTW.There is a limited number of papers about the HCSP in theliterature [1, 2, 3, 4, 6, 7, 8]. Fast heuristic approaches are analternative to solve the HCSP. However, the problem depen-dency of such optimisation strategies is an important issue tobe tackled. It is possible to design an algorithm that can findhigh performance solutions for a specific problem or just aninstance of a problem. However, the algorithm may not besuccessful to solve related problems or different instances orit may require lots of changes or tuning to be adapted to thenew problem. Hyper-heuristics are generic search strategiesthat perform search over a heuristic search space instead ofthe solution space to clear up this case [5]. In this study, weapply a new improvement hyper-heuristic which chooses thebest possible low-level heuristic at each optimization stepfor the HCSP to show the potential of hyper-heuristics fordifficult combined problems.References[1] C. Akjiratikarl, P. Yenradee, and P.R. Drake. Pso-based algorithm for home care worker scheduling in theuk. Computers and Industrial Engineering, 53(4):559–583,2007.[2] S.V. Begur, D.M. Miller, and J.R. Weaver. An inte-grated spatial dss for scheduling and routing home-health-care nurses. Interfaces, 27:35–48, 1997.[3] S. Bertels and T. Fahle. A hybrid setup for a hy-brid scenario: combining heuristics for the home healthcare problem. Computers and Operations Research,33(10):2866–2890, 2006.[4] V. Borsani, A. Matta, G. Beschi, and F. Sommaruga.A home care scheduling model for human resources. In Pro-ceedingsoftheInternationalConferenceonServiceSystemsand Service Management (ICSSSM), Troyes, France, 2006.[5] E.K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross,and S. Schulenburg. Handbook of Meta-Heuristics, chap-ter Hyper-Heuristics: An Emerging Direction in ModernSearch Technology, pages 457–474. Kluwer Academic Pub-lishers, 2003.[6] E. Cheng and J.L. Rich. A home health care rout-ing and scheduling problem. Technical report caam tr98-04,Rice University, 1998.[7] P. Eveborn, P. Flisberg, and M. Ronnqvist. Laps care–an operational system for staff planning of home care. Eu-ropean Journal of Operational Research, 171(3):962–976,June 2006.[8] K. Martin and M. Wright. Using particle swarm op-timization to determine the visit times in community nursetimetabling. In Proceedings ofthe 7thInternational Confer-ence on the Practice and Theory of Automated Timetabling(PATAT’08), Montreal, Canada, August 19–22 2008.[9] M.M. Solomon. Algorithms for the vehicle routingand scheduling problems with time window constraints. Op-erations Research, 35(2):254–265, 1987." @default.
• W159706599 created "2016-06-24" @default.
• W159706599 creator A5013075653 @default.
• W159706599 creator A5024551178 @default.
• W159706599 creator A5051354803 @default.
• W159706599 creator A5058282435 @default.
• W159706599 date "2009-09-01" @default.
• W159706599 modified "2023-09-27" @default.
• W159706599 title "A Hyper-heuristic Approach to the Home Care Scheduling Problem" @default.
• W159706599 cites W120448894 @default.
• W159706599 cites W1668207500 @default.
• W159706599 cites W1971985512 @default.
• W159706599 cites W1975009200 @default.
• W159706599 cites W2046084157 @default.
• W159706599 cites W2064104291 @default.
• W159706599 cites W2096305430 @default.
• W159706599 cites W2108293653 @default.
• W159706599 cites W618486057 @default.
• W159706599 hasPublicationYear "2009" @default.
• W159706599 type Work @default.
• W159706599 sameAs 159706599 @default.
• W159706599 citedByCount "0" @default.
• W159706599 crossrefType "journal-article" @default.
• W159706599 hasAuthorship W159706599A5013075653 @default.
• W159706599 hasAuthorship W159706599A5024551178 @default.
• W159706599 hasAuthorship W159706599A5051354803 @default.
• W159706599 hasAuthorship W159706599A5058282435 @default.
• W159706599 hasConcept C102370290 @default.
• W159706599 hasConcept C123784306 @default.
• W159706599 hasConcept C126255220 @default.
• W159706599 hasConcept C154945302 @default.
• W159706599 hasConcept C158336966 @default.
• W159706599 hasConcept C173801870 @default.
• W159706599 hasConcept C206729178 @default.
• W159706599 hasConcept C31258907 @default.
• W159706599 hasConcept C33923547 @default.
• W159706599 hasConcept C41008148 @default.
• W159706599 hasConcept C42475967 @default.
• W159706599 hasConcept C55416958 @default.
• W159706599 hasConcept C74172769 @default.
• W159706599 hasConceptScore W159706599C102370290 @default.
• W159706599 hasConceptScore W159706599C123784306 @default.
• W159706599 hasConceptScore W159706599C126255220 @default.
• W159706599 hasConceptScore W159706599C154945302 @default.
• W159706599 hasConceptScore W159706599C158336966 @default.
• W159706599 hasConceptScore W159706599C173801870 @default.
• W159706599 hasConceptScore W159706599C206729178 @default.
• W159706599 hasConceptScore W159706599C31258907 @default.
• W159706599 hasConceptScore W159706599C33923547 @default.
• W159706599 hasConceptScore W159706599C41008148 @default.
• W159706599 hasConceptScore W159706599C42475967 @default.
• W159706599 hasConceptScore W159706599C55416958 @default.
• W159706599 hasConceptScore W159706599C74172769 @default.
• W159706599 hasLocation W1597065991 @default.
• W159706599 hasOpenAccess W159706599 @default.
• W159706599 hasPrimaryLocation W1597065991 @default.
• W159706599 hasRelatedWork W102216668 @default.
• W159706599 hasRelatedWork W1973230775 @default.
• W159706599 hasRelatedWork W1994444671 @default.
• W159706599 hasRelatedWork W1997384914 @default.
• W159706599 hasRelatedWork W2056999236 @default.
• W159706599 hasRelatedWork W2076567726 @default.
• W159706599 hasRelatedWork W2078931277 @default.
• W159706599 hasRelatedWork W2138131724 @default.
• W159706599 hasRelatedWork W2145883860 @default.
• W159706599 hasRelatedWork W2343757567 @default.
• W159706599 hasRelatedWork W2683279309 @default.
• W159706599 hasRelatedWork W2793453677 @default.
• W159706599 hasRelatedWork W2810258123 @default.
• W159706599 hasRelatedWork W2855712217 @default.
• W159706599 hasRelatedWork W2900906469 @default.
• W159706599 hasRelatedWork W2963779476 @default.
• W159706599 hasRelatedWork W2964424446 @default.
• W159706599 hasRelatedWork W3106622848 @default.
• W159706599 hasRelatedWork W3156130239 @default.
• W159706599 hasRelatedWork W3188962602 @default.
• W159706599 isParatext "false" @default.
• W159706599 isRetracted "false" @default.
• W159706599 magId "159706599" @default.
• W159706599 workType "article" @default.