Planning home-care visits — Technical https://thesis.uya.no/proposals/familiar-faces-better-routes/#technical-track BACHELOR Final result: A scheduling prototype with constraint tests and usability findings. Task: Build a visit-planning interface using an established OR-Tools routing model. Data: 30 patients, 8 carers, 5 days; seeds 1–20 (planned) Generate 30 patients with required skill, 8 carers with skill sets, 5 days, fixed visit durations, time windows, shifts, breaks and symmetric straight-line travel. For seeds 1–20 run both 8-carer and 4-carer staffing conditions. Requires: Recruit coordinators; record solver time limits and infeasible cases. Method: Use the synthetic schedules; check visit windows, shift limits and unfilled visits, then run coordinator walkthroughs. Plan 4 participant sessions. STEPS Build and test 1. Read the starting sources and choose one established implementation method. 2. Write the requirements, data fields, system diagram and test cases. 3. Prepare 30 patients, 8 carers, 5 days; seeds 1–20. Make the answer key and pass criteria before testing. 4. Build a working version of a scheduling prototype with constraint tests and usability findings. 5. Run function, integration and failure-case tests. Record each result. 6. Run the practical evaluation and list the changes the system still needs. MASTER Final result: Scheduling board, reproducible generator and planning/coordination results. Research question: Investigate the continuity–travel trade-off under staffing pressure. Compare λ={0,10,30} at 8 and 4 carers under identical hard constraints and solver budget, then study coordinator interpretation and valid overrides. Research result: A specific trade-off analysis and decision-support requirements for continuity-aware planning. STEPS Design, build and test (DSR) 1. Read the newest papers and list the closest existing systems. 2. Write down the versions, fields, data split, case assignment, random seeds and correct answers for 30 patients, 8 carers, 5 days; seeds 1–20. 3. Draw the user workflow, data model and system architecture. List the requirements and pass criteria. 4. Build a working version of scheduling board, reproducible generator and planning/coordination results. 5. Test every function, connection and failure case. Save the failed tests as well as the passed tests. 6. Compare the system with the named alternative. Then run the user task or decision task in the assignment. 7. Report the measured result, the failed cases and the design lessons another team can reuse. CURRENT PROJECT LITERATURE A multiobjective approach for weekly Green Home Health Care routing and scheduling problem with care continuity and synchronized services (2024, peer-reviewed): https://doi.org/10.1016/j.orp.2024.100302 Provides current multiobjective formulations, continuity measures and open benchmark material. Solving the Palliative Home Health Care Routing and Scheduling Problem with an integer linear programming model (2024, peer-reviewed): https://doi.org/10.1016/j.eswa.2024.123728 Shows current integrated constraints and objective trade-offs in home-care scheduling. IS THEORY STARTING POINTS Weekly home-care routing with continuity (2024): https://www.sciencedirect.com/science/article/pii/S221471602400006X Identify continuity objectives and constraints before choosing a routing comparator. Vessey & Galletta (1991) — Cognitive Fit: https://pubsonline.informs.org/doi/10.1287/isre.2.1.63 Test whether a representation helps one kind of task more than another. Search Scopus or Web of Science and ACM Digital Library using the topic query, then follow citations to the thesis start date. Record searches and compare methods, data, findings and limitations in literature-matrix.csv. Use that review to confirm or revise the gap and choose a current comparator. The linked papers are starting points. PILOT QUESTION How do explicit continuity penalties affect schedules and coordinators’ revisions? EXAMPLE TOOLS Python, pandas, OR-Tools, Streamlit Equivalent tools are fine. FIRST THREE ACTIONS 1. Write the generator for one day and draw the patient locations to check travel distances. 2. Set hard constraints, a 30-second solver limit per instance and penalties 0/10/30. Validate one hand-made feasible schedule. 3. Run penalty 0 first, then change only the penalty. Pilot a schedule-revision task with one coordinator before recruitment. LITERATURE SEARCH home care scheduling continuity care decision support DATA 30 patients, 8 carers, 5 days; seeds 1–20 (planned) Generate 30 patients with required skill, 8 carers with skill sets, 5 days, fixed visit durations, time windows, shifts, breaks and symmetric straight-line travel. For seeds 1–20 run both 8-carer and 4-carer staffing conditions. HOW TO TEST IT Use identical hard constraints and 30-second budget for all 20×2×3 runs. Report unfilled visits, travel minutes, distinct carers/patient, status and optimality gap. Six coordinators revise three non-overlapping schedule pairs; record overrides, post-edit violations, rationale and time. FINAL RESULT Scheduling board, reproducible generator and planning/coordination results. ACCESS OR PEOPLE Recruit 6 coordinators; record solver time limits and infeasible cases. TEMPLATES https://thesis.uya.no/starters/familiar-faces-better-routes/technical/patients.csv https://thesis.uya.no/starters/familiar-faces-better-routes/technical/carers.csv https://thesis.uya.no/starters/familiar-faces-better-routes/technical/visits.csv https://thesis.uya.no/starters/familiar-faces-better-routes/technical/evaluation.csv https://thesis.uya.no/starters/familiar-faces-better-routes/technical/literature-matrix.csv Use participant codes instead of names or email addresses.