A Decision Support System for daily scheduling and routing of home healthcare workers with a lunch break consideration

G\"okberk \"Ozsakall{\i}; \"Omer \"Ozt\"urko\u{g}lu; Syed Shah Sultan Mohiuddin Qadri

REVIEW 5 major objections 5 minor 10 references

A Decision Support System for daily scheduling and routing of home healthcare workers with a lunch break consideration

T0 review · 5 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read An adaptive large neighborhood search produces near-optimal home-healthcare schedules in seconds.

desk verdict Solid incremental ALNS paper with real benchmark improvements, but the tuning/evaluation overlap and missing code mean the headline results need a validation check. read the letter →

arxiv 2412.06797 v1 pith:6PMQ5SWQ submitted 2024-11-22 cs.CY

Ömer Öztürkoğlu , Gökberk Özsakall{i} , Syed Shah Sultan Mohiuddin Qadri This is my paper · ORCID

classification cs.CY

keywords homehealthcareschedulingandroutinglunchbreakadaptivelargeneighborhoodsearchvehiclewithtimewindowsdecisionsupportsystemmetaheuristicCOVID-19care

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to show that an Adaptive Large Neighborhood Search algorithm can replace an exact branch-and-price method for daily home healthcare scheduling and routing with lunch breaks. On the 168 benchmark instances used for comparison, the best variant found 105 of the 120 known optima, matched nearly all 30-patient optima in about 12 seconds on average, and improved 36 best-known solutions by up to 36%, serving up to 10 more patients in some classes. If true, this makes near-optimal daily planning practical for home-care agencies and supports a decision support system the authors built for COVID-19 patient visits in Turkish cities.

What carries the argument

The load-bearing mechanism is an adaptive large neighborhood search (ALNS), a ruin-and-repair metaheuristic that repeatedly removes patients with one of six removal heuristics and reinserts them with greedy or regret-k insertion heuristics. The lunch break is represented as a special node in every caregiver route, and the insertion procedures explicitly test break-before-service and break-after-service positions; a dedicated break local search then slides the break node to the position that minimizes the route's return time. Variants A0, A1, A2, and A3 selectively include Or-opt and break local search to isolate their contribution, and a simulated-annealing acceptance rule controls diversification.

What would settle it

Use a holdout set of newly generated instances with different time-window tightness or travel-time distributions, keep the tuned parameters fixed, and compare A0's solutions to branch-and-price or lower bounds; if the optimality rate and the number of improved best-known solutions fall sharply, the reported performance does not generalize.

Watch

Extended reading notes

Core claim

The paper's central claim is that its adaptive large neighborhood search solves the home healthcare scheduling and routing problem with lunch breaks almost as well as an exact branch-and-price method but orders of magnitude faster. The A0 variant found 105 of the 120 known optimal solutions, matched nearly all 30-patient optima in about 12 seconds on average, improved 36 best-known solutions by up to 36% in some instance classes, and served up to 10 more patients than the previous best schedules. The authors present this as evidence that a well-constructed metaheuristic with lunch-break-aware insertion is sufficient for practical daily planning.

Load-bearing premise

The parameter settings were tuned on 12 of the same 168 benchmark instances used for evaluation, and the paper assumes those settings carry over to all other instances and to new real-world cases.

Editorial extensions

If this is right

A home-care agency can produce daily caregiver itineraries in about 12 seconds for 30 patients and 54 seconds for 100 patients, fast enough for same-day replanning.
The 36 improved best-known solutions, with up to 36% lower cost in the hardest R1_100 class, indicate that exact methods previously left substantial room for improvement on large, tight-window instances.
Serving up to 10 additional patients in some instance classes means the algorithm directly raises service coverage where time windows are narrow.
Because the four algorithm variants are statistically tied on solution quality, the simplest variant without local search may suffice for many practical settings, while adding both local searches is safest on large instances.
The embedded decision support system shows that the algorithm can be wrapped in a map-based tool for scheduling COVID-19-era home care visits.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Beyond the paper, the reported gains are concentrated in exactly the instance classes that are hardest for exact methods, such as random locations with narrow time windows, so the method is most valuable where branch-and-price struggles.
Beyond the paper, the statistical equivalence of the four variants suggests the lunch-break positioning built into the insertion heuristics does most of the work, and the dedicated local searches add little; a leaner algorithm might perform identically.
Beyond the paper, because the HHCSS trial uses approximate COVID-19 patient locations derived from public heatmaps, real-world benefit would require validation with actual patient addresses, travel times, and caregiver availability before deployment.
Beyond the paper, the same ruin-and-repair machinery could be extended to multi-period planning, multiple depots, or synchronized visits, as the authors note.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

This is a straightforward ALNS paper for the Liu et al. (2017) home healthcare scheduling problem with lunch breaks. The authors report real, useful results: they solve 30-patient instances to optimality in seconds, and they find better solutions than Liu's branch-and-price on 36 of the 168 benchmark instances. That's a genuine contribution, even if it's incremental.

The paper does a few things well. The break local search heuristic is a small but sensible addition, and the four algorithm variants let them isolate the effect of each local search component. The computational study is more transparent than most: five replications, ANOVA, and detailed appendix tables. That level of care earns credit.

The main weakness is the one the stress-test note flags. The three free parameters (omega, tau_Or, tau_Break) are tuned on 12 randomly chosen 50-patient instances from the same Liu et al. set, and then the algorithm is evaluated on all 168 instances, including those 12. Because they report the best of five runs, this overlap can inflate the number of improved solutions and the gap improvements. It's not a fatal flaw, but it does mean the headline '36 improved solutions' needs a robustness check. I'd like to see the 12 tuning instances removed from the results, or at least reported separately. The 30-patient optimality claim is less affected because tuning used 50-patient instances, so that part is probably solid.

Two smaller issues. No code or data are released, which is a real problem for an ALNS paper whose main contribution is empirical. The COVID-19 DSS section is more of a prototype description; there's no baseline or optimality comparison, so it doesn't add evidence.

Overall, this is a decent applied paper, not a methodological breakthrough. The right audience is practitioners in home healthcare scheduling and researchers using the Liu et al. benchmark. The results are likely real, but the validation overlap and missing code need to be addressed.

I'd send it to a serious referee. The core claim is defensible and useful, and a good referee would ask for the hold-out analysis. Worth engaging with.

Referee Report

5 major / 5 minor

Summary. The paper addresses the home healthcare scheduling and routing problem with lunch break requirements (HHSRP-LB), following the model of Liu et al. (2017). The authors propose an Adaptive Large Neighborhood Search (ALNS) algorithm with four variants (A0–A3) differing in the use of Or-opt and a novel break-position local search. The method is tested on 168 instances from Liu et al. (2017); the authors report that A0 finds nearly all optimal solutions for 30-patient instances within about 12 seconds on average, obtains better solutions than the published branch-and-price results for 36 instances, visits up to 10 more patients, and is robust with an average coefficient of variation of 0.3. The paper also presents a decision support system (HHCSS) applied to approximately generated COVID-19 patient data from three Turkish cities.

Significance. If the computational claims are correct, the paper would provide a fast, practical heuristic for a realistic HHSRP variant, with transparent reporting (five replications, ANOVA, detailed tables in the appendix). The proposed break-position local search and the DSS are potentially useful practical contributions. However, the central quantitative claims are currently not fully supported: the parameter tuning uses a subset of the same benchmark instances used for evaluation, and there are inconsistencies between the summary tables and the detailed appendix regarding the number of improved solutions. The reported robustness measure is also computed across instances rather than across replications. These issues need to be resolved before the main findings can be accepted.

major comments (5)

[§4.1 and §4.2] The parameter tuning in Section 4.1 selects (omega, tau_Or, tau_Break) = (750, 150, 200) using 12 randomly chosen 50-patient instances from Liu et al. (2017), and the evaluation in Section 4.2 uses all 168 instances including those same 12. Because the algorithm is stochastic and reports the best of five replications, any overfitting to the 12 tuning instances can inflate the reported number of improved solutions and the average gaps. This is load-bearing for the abstract's claim of better solutions for 36 instances. The authors should either exclude the 12 tuning instances from the reported results or validate the parameters on a genuinely out-of-sample set.
[§4.1] The variant labeling in the tuning section is internally inconsistent with Section 3.8. The text says the factorial design was run on algorithm A3 'because it consists of all of the three local search heuristics,' but A3 is defined as the configuration with no local search heuristics. It then states that A1 includes only the lunch break local search, while Section 3.8 defines A1 as containing only Or-opt, and A2 as containing only the break heuristic. This swap makes it unclear which of tau_Or and tau_Break was actually tuned for which variant, and it prevents reproduction of the parameter values in Table 5.
[Tables 8/9 vs Tables A1–A3] The reported counts of improved solutions do not match the detailed appendix. For 50-patient instances, Table 8 reports 11 improvements for A0, but comparing Alg_Best with Liu_Best in Table A2 yields only 8 improvements (C104_50, C204_50, R104_50, R107_50, R108_50, R112_50, R207_50, RC203_50). For 100-patient instances, Table 8 reports 24 improvements, but Table A3 shows at most 21. Table 9 also lists one improvement for RC2_30, while no RC2_30 row in Table A1 has Alg_Best lower than Liu_Best. Because the central contribution is the number of improved best-known solutions, these inconsistencies must be reconciled.
[§4.2.3 and Abstract] The robustness claim is based on a coefficient of variation of 0.3, but Table 9 reports CV_Best as the coefficient of variation of the best objective values across instances within each Solomon class, not across the five replications. That statistic does not measure run-to-run variability of the algorithm; it measures spread across instances with very different scales. With CV_Best values ranging from 0.02 to 0.92, the single average of 0.3 is not a meaningful indicator of algorithmic robustness. The authors should report the coefficient of variation across replications for each instance, or a similar within-instance measure.
[§3.6] The sentence 'In the algorithm, the feasibility check is performed only for time windows constraints' appears to contradict the problem constraints, which include caregiver eligibility and qualification requirements (constraints (16) and (17) in Section 2). If the implementation indeed checks only time windows, the solutions may violate skill-matching constraints, which would invalidate the comparison with Liu et al. If eligibility is handled implicitly by the insertion heuristics, this should be stated explicitly. As written, the claim is either incorrect or incomplete and is load-bearing for solution correctness.

minor comments (5)

[§4.2.1] The statement 'H0 is rejected because the p-value is 1.0' is statistically backwards: a p-value of 1.0 means the test fails to reject the null hypothesis. The subsequent conclusion that the algorithms are not significantly different is correct, but the wording should be fixed.
[§3.3 and Table 5] The noise parameter is denoted as mu in the text of Section 3.3 but as r in Table 5. Please use consistent notation.
[§1] There is a duplicated passage in the introduction describing temporal dependency constraints; one of the two copies should be removed.
[Figures 2 and 3] The interaction and main effects plots are referenced in Section 4.1 but are not visible in the manuscript; the actual plots should be included in the final version.
[§4.2.3, observation 1] The statement that the algorithm improved solutions 'on average 6% and 16% in 50- and 100-patient instances' is not directly traceable to Table 9, which reports per-class values rather than an overall average. Please clarify how these averages are computed.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the paper is an empirical ALNS benchmark comparison against the external Liu et al. (2017) best-known solutions.

full rationale

The paper does not derive a predicted quantity from an input that is defined in terms of that quantity. It proposes an Adaptive Large Neighborhood Search heuristic and compares its computed solution costs with published best-known solutions from Liu et al. (2017), an external benchmark. The reported claims (near-optimal 30-patient results, 36 improved solutions, up to 36% improvement) are observed solution-quality metrics, not quantities forced by construction. Parameter tuning in Section 4.1 selects three algorithmic parameters (omega, tau_Or, tau_Break) via a design of experiments on 12 randomly selected 50-patient instances from the same benchmark, and the evaluation in Section 4.2 uses all 168 instances including possibly those 12; this is an in-sample tuning concern that could affect generalization, but it is not a circular reduction because the tuned parameters do not determine the gap to Liu_Best and the benchmark outcomes are not fitted values renamed as predictions. Citations to Ropke and Pisinger for the ALNS framework and to the authors' own prior work for a generic update subroutine are not load-bearing for the central benchmark claims. The core evaluation is self-contained against an external set of published solutions, so no significant circularity is present.

Assumptions & free parameters 3 free parameters · 2 assumptions · 0 invented entities

The central result depends on the choice of three tuned parameters (omega, tau_Or, tau_Break) and on the assumption that the Liu et al. benchmark is a fair testbed. No new physical or conceptual entities are introduced. The free parameters are tuned on a subset of the very instances later used for evaluation, which is a mild methodological weakness.

free parameters (3)

omega (update solution iteration) = 750 (A0, A1); 1250 (A2, A3)
Tuned via full factorial DOE on 12 instances; controls how often the current solution is reset to the best solution.
tau_Or (Or-opt iteration frequency) = 150 (A0); 200 (A2)
Tuned via DOE; controls how often the Or-opt local search is applied.
tau_Break (break local search iteration frequency) = 200 (A0, A1)
Tuned via DOE; controls how often the break local search is applied.

assumptions (2)

domain assumption The HHSRP-LB model and instances of Liu et al. (2017) represent realistic home healthcare operations.
The whole computational study uses these instances and the model as ground truth (Section 2).
domain assumption The standard ALNS operators are effective for this problem.
The paper relies on the known effectiveness of removal and insertion heuristics from the VRP literature without proof for this specific variant (Section 3).

how reviews work

0 comments

Cite this review

Pith. "Pith review of A Decision Support System for daily scheduling and routing of home healthcare workers with a lunch break consideration." pith.science (2026). https://pith.science/paper/6PMQ5SWQ

@misc{pith2026241206797,
  author       = {Pith},
  title        = {Pith review of: A Decision Support System for daily scheduling and routing of home healthcare workers with a lunch break consideration},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6PMQ5SWQ}},
  note         = {Machine review of arXiv:2412.06797}
}

read the original abstract

This study examines a home healthcare scheduling and routing problem (HHSRP) with a lunch break requirement. This problem especially consists of lunch break constraints for caregivers in addition to other typical features of the HHSRP in literature such as hard time window constraints for both patients and caregivers and patient preferences. The objective is to minimize both travel distance in a route and unvisited patient (penalty) cost. For this NP-Hard problem, we developed an effective Adaptive Large Neighborhood Search algorithm to provide high-quality solutions in a short amount of time. We tested the proposed four variants of the algorithm with the selected problem instances from the literature. The algorithms provided nearly all optimal solutions for 30-patient problem instances in 12 seconds on average. Additionally, they provided better solutions to 36 problem instances up to 36% improvement in some instance classes. Moreover, the improved solutions achieved to visit up to 10 more patients. The algorithms are also shown to be very robust due to their low coefficient variance of 0.3 on average. The algorithm also requires a very reasonable amount of time to generate solutions up to 54 seconds for solving 100-patient instances. A decision support system, namely Home Healthcare Decision Support System (HHCSS) was also designed to play a positive role in preventing the COVID-19 global pandemic. The system employs the proposed ALNS algorithm to solve various instances of approximately generated COVID-19 patient data from Turkey. The main aim of developing HHCSS is to support the administrative staff of home healthcare from the tedious task of scheduling and routing of caregivers and to increase service responsiveness.

Figures

Figures reproduced from arXiv: 2412.06797 by the authors.

**Figure 6.** Outlook of HHCSS with the menu [PITH_FULL_IMAGE:figures/full_fig_p024_6.png] view at source ↗

**Figure 8.** shows an example visualization of the locations of patients on a map that need to be visited with a distinct color variation depending on the area in Izmir, Turkey. This map is obtained by running the backend code of the "Run Code: Map on Patients" button. *Region 1: Bayrakli (Izmir); Region 2: Bornova (Izmir) [PITH_FULL_IMAGE:figures/full_fig_p026_8.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

10 extracted references · 10 canonical work pages

[1]

B., Guine t, A., & Hajri-Gabouj, S

Bachouch, R. B., Guine t, A., & Hajri-Gabouj, S. (2011 ). A decision -making tool for home health care nurses’ planning. In Supply Chain Forum: an International Journal (Vol. 12, No. 1, pp. 14 - 20). Taylor & Francis. Bard, J. F., Shao, Y., & Wang, H. (2013). Weekly scheduling models for traveling therapists. Socio- Economic Planning Sciences, 47(3), 191-...

work page 2013
[9]

Van Breedam, A. (2001). Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers & Operations Research, 28(4), 289-315. Villegas, J.G., Gueret, C., Mendoza, J.E., Montoya, A. (2018). The technician routing and scheduling problem with conventional and electric vehicles. Working paper. Available at https://hal.archives-ouve...

work page 2001
[439]

Matplotlib: A 2D Graphics Environment

Izmir Coronavirus table is getting heavier: An average of 200 cases per day. (2020, August 18). Gözlem. Retrieved September 07, 2020, from https://www.gozlemgazetesi.com/HaberDetay/212/1127998/izmir-koronavirus-tablosu-agirlasiyor- gunluk-ortalama-200-vaka.html J. D. Hunter, "Matplotlib: A 2D Graphics Environment", Computing in Science & Engineering, vol....

work page 2020
[600]

K., & Kan, A

Lenstra, J. K., & Kan, A. R. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11(2), 221-227. Liu, F. H. F., & Shen, S. Y. (1999). A route -neighborhood-based metaheuristic for vehicle routing problem with time windows. European Journal of Operational Research, 118(3), 485-504. Liu, R., Yuan, B., & Jiang, Z. (2017). Mathematical mo...

work page 1981
[735]

(2006 a)

Ropke, S., & Pisinger, D. (2006 a). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455-472. Ropke, S., & Pisinger, D. (2006b). A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research, 171(3), 750-775. Sh...

work page 2006
[2007]

D., & Vecchi, M

Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680. Kocaman, Y., Öztürkoğlu, Ö., & Gümüşoğlu, Ş. (2019). Aisle designs in unit -load warehouses with different flow policies of multiple pickup and deposit points. Central European Journal of Operations Research, 1-33, https://doi.org/10.1...

work page doi:10.1007/s10100-019-00646-9 1983
[2011]

The Journal of Machine Learning Research, 12, pp.2825-2830

Scikit-learn: Machine learning in Python. The Journal of Machine Learning Research, 12, pp.2825-2830. Peng, L., Murray, C.,2019. VeRoViz: A vehicle routing visualization. Accessed January 05, 2020, from https://veroviz.org Perttunen, J. (1994). On the significance of the initial solution in travelling salesman heuristics. Journal of the Operational Resear...

work page 1994
[2015]

https://www.bls.gov/careeroutlook/2015/article/projections-industry.htm, accessed 01 July

work page 2015

Show all 10 references

[2019]

(1976), Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking, Ph.D

Or, I. (1976), Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking, Ph.D. thesis, Northwestern University, Evanston, Illinois. Öztürkoğlu, Ö., Gue, K. R., & Meller, R. D. (2014). A constructive aisle design model for uni...

1976
[2020]

Best Total Travel Time

Wirnitzer, J., Heckmann, I., Meyer, A., & Nickel, S. (2016). Patient -based nurse rostering in home care. Operations Research for Health Care, 8, 91-102. Xiao, L., Dridi, M., & El Hassani, A. H. (2018). Mathematical model for the home health care scheduling and routing problem...

2016

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.

[1] [1]

B., Guine t, A., & Hajri-Gabouj, S

Bachouch, R. B., Guine t, A., & Hajri-Gabouj, S. (2011 ). A decision -making tool for home health care nurses’ planning. In Supply Chain Forum: an International Journal (Vol. 12, No. 1, pp. 14 - 20). Taylor & Francis. Bard, J. F., Shao, Y., & Wang, H. (2013). Weekly scheduling models for traveling therapists. Socio- Economic Planning Sciences, 47(3), 191-...

work page 2013

[2] [9]

Van Breedam, A. (2001). Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers & Operations Research, 28(4), 289-315. Villegas, J.G., Gueret, C., Mendoza, J.E., Montoya, A. (2018). The technician routing and scheduling problem with conventional and electric vehicles. Working paper. Available at https://hal.archives-ouve...

work page 2001

[3] [439]

Matplotlib: A 2D Graphics Environment

Izmir Coronavirus table is getting heavier: An average of 200 cases per day. (2020, August 18). Gözlem. Retrieved September 07, 2020, from https://www.gozlemgazetesi.com/HaberDetay/212/1127998/izmir-koronavirus-tablosu-agirlasiyor- gunluk-ortalama-200-vaka.html J. D. Hunter, "Matplotlib: A 2D Graphics Environment", Computing in Science & Engineering, vol....

work page 2020

[4] [600]

K., & Kan, A

Lenstra, J. K., & Kan, A. R. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11(2), 221-227. Liu, F. H. F., & Shen, S. Y. (1999). A route -neighborhood-based metaheuristic for vehicle routing problem with time windows. European Journal of Operational Research, 118(3), 485-504. Liu, R., Yuan, B., & Jiang, Z. (2017). Mathematical mo...

work page 1981

[5] [735]

(2006 a)

Ropke, S., & Pisinger, D. (2006 a). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455-472. Ropke, S., & Pisinger, D. (2006b). A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research, 171(3), 750-775. Sh...

work page 2006

[6] [2007]

D., & Vecchi, M

Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680. Kocaman, Y., Öztürkoğlu, Ö., & Gümüşoğlu, Ş. (2019). Aisle designs in unit -load warehouses with different flow policies of multiple pickup and deposit points. Central European Journal of Operations Research, 1-33, https://doi.org/10.1...

work page doi:10.1007/s10100-019-00646-9 1983

[7] [2011]

The Journal of Machine Learning Research, 12, pp.2825-2830

Scikit-learn: Machine learning in Python. The Journal of Machine Learning Research, 12, pp.2825-2830. Peng, L., Murray, C.,2019. VeRoViz: A vehicle routing visualization. Accessed January 05, 2020, from https://veroviz.org Perttunen, J. (1994). On the significance of the initial solution in travelling salesman heuristics. Journal of the Operational Resear...

work page 1994

[8] [2015]

https://www.bls.gov/careeroutlook/2015/article/projections-industry.htm, accessed 01 July

work page 2015