4.7 Article

A matheuristic algorithm for stochastic home health care planning

期刊

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 288, 期 3, 页码 753-774

出版社

ELSEVIER
DOI: 10.1016/j.ejor.2020.06.040

关键词

Home health care; Matheuristic algorithm; Districting; Staff dimensioning; Progressive hedging algorithm; Fix and optimize method

向作者/读者索取更多资源

Efficient human resource planning is crucial for designing an effective home health care system, which includes decisions on districting/zoning, staff dimensioning, resource assignment, scheduling, and routing. A two-stage stochastic mixed integer model is proposed in this study, taking into account uncertainties in travel and service times, with a novel algorithm developed for solving it. Additionally, an algorithm based on progressive hedging and Frank and Wolf algorithms is developed to reduce computational time for the second phase. The algorithm's efficiency and accuracy are verified through numerical experiments, demonstrating its capability to solve large instances.
Efficient human resource planning is the cornerstone of designing an effective home health care system. Human resource planning in home health care system consists of decisions on districting/zoning, staff dimensioning, resource assignment, scheduling, and routing. In this study, a two-stage stochastic mixed integer model is proposed that considers these decisions simultaneously. In the planning phase of a home health care system, the main uncertain parameters are travel and service times. Hence, the proposed model takes into account the uncertainty in travel and service times. Districting and staff dimensioning are defined as the first stage decisions, and assignment, scheduling, and routing are considered as the second stage decisions. A novel algorithm is developed for solving the proposed model. The algorithm consists of four phases and relies on a matheuristic-based method that calls on various mixed integer models. In addition, an algorithm based on the progressive hedging and Frank and Wolf algorithms is developed to reduce the computational time of the second phase of the proposed matheuristic algorithm. The efficiency and accuracy of the proposed algorithm are tested through several numerical experiments. The results prove the ability of the algorithm to solve large instances. (C) 2020 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
Review Management

Survey of optimization models for power system operation and expansion planning with demand response

Vinicius N. Motta, Miguel F. Anjos, Michel Gendreau

Summary: This survey presents a review of optimization approaches for the integration of demand response in power systems planning and highlights important future research directions.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

R-SALSA: A branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines

Philipp Schulze, Armin Scholl, Rico Walter

Summary: This paper proposes an improved branch-and-bound algorithm, R-SALSA, for solving the simple assembly line balancing problem, which performs well in balancing workloads and providing initial solutions.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Adaptive scheduling in service systems: A Dynamic programming approach

Roshan Mahes, Michel Mandjes, Marko Boon, Peter Taylor

Summary: This paper discusses appointment scheduling and presents a phase-type-based approach to handle variations in service times. Numerical experiments with dynamic scheduling demonstrate the benefits of rescheduling.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Discrete scheduling and critical utilization

Oleg S. Pianykh, Sebastian Perez, Chengzhao Richard Zhang

Summary: Efficient scheduling is crucial for optimizing resource allocation and system performance. This study focuses on critical utilization and efficient scheduling in discrete scheduling systems, and compares the results with classical queueing theory.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Review Management

Supply chain network design with financial considerations: A comprehensive review

Hamed Jahani, Babak Abbasi, Jiuh-Biing Sheu, Walid Klibi

Summary: Supply chain network design is a large and growing area of research. This study comprehensively surveys and analyzes articles published from 2008 to 2021 to detect and report financial perspectives in SCND models. The study also identifies research gaps and offers future research directions.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

A branch-and-cut algorithm for the connected max- k-cut problem

Patrick Healy, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sebastien Martin, Zsuzsanna Roka

Summary: The Connected Max-k-Cut Problem is an extension of the well-known Max-Cut Problem, where the objective is to partition a graph into k connected subgraphs by maximizing the cost of inter-partition edges. The researchers propose a new integer linear program and a branch-and-cut algorithm for this problem, and also use graph isomorphism to structure the instances and facilitate their resolution. Extensive computational experiments show that, if k > 2, their approach outperforms existing algorithms in terms of quality.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Estimating production functions through additive models based on regression splines

Victor J. Espana, Juan Aparicio, Xavier Barber, Miriam Esteve

Summary: This paper introduces a new methodology based on the machine learning technique MARS for estimating production functions that satisfy classical production theory axioms. The new approach overcomes the overfitting problem of DEA through generalized cross-validation and demonstrates better performance in reducing mean squared error and bias compared to DEA and C2NLS methods.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Time-flexible min completion time variance in a single machine by quadratic programming

Stefano Nasini, Rabia Nessah

Summary: In this paper, the authors investigate the impact of time flexibility in job scheduling, showing that it can significantly affect operators' ability to solve the problem efficiently. They propose a new methodology based on convex quadratic programming approaches that allows for optimal solutions in large-scale instances.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Convex support vector regression

Zhiqiang Liao, Sheng Dai, Timo Kuosmanen

Summary: Nonparametric regression subject to convexity or concavity constraints is gaining popularity in various fields. The conventional convex regression method often suffers from overfitting and outliers. This paper proposes the convex support vector regression method to address these issues and demonstrates its advantages in prediction accuracy and robustness through numerical experiments.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

A simulation evacuation framework for effective disaster preparedness strategies and response decision making

Kuo-Hao Chang, Ying-Zheng Wu, Wen-Ray Su, Lee-Yaw Lin

Summary: The damage and destruction caused by earthquakes necessitates the evacuation of affected populations. Simulation models, such as the Stochastic Pedestrian Cell Transmission Model (SPCTM), can be utilized to enhance disaster and evacuation management. The analysis of SPCTM provides insights for government officials to formulate effective evacuation strategies.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

An effective hybrid evolutionary algorithm for the clustered orienteering problem

Qinghua Wu, Mu He, Jin-Kao Hao, Yongliang Lu

Summary: This paper studies a variant of the orienteering problem known as the clustered orienteering problem. In this problem, customers are grouped into clusters and a profit is associated with each cluster, collected only when all customers in the cluster are served. The proposed evolutionary algorithm, incorporating a backbone-based crossover operator and a destroy-and-repair mutation operator, outperforms existing algorithms on benchmark instances and sets new records on some instances. It also demonstrates scalability on large instances and has shown superiority over three state-of-the-art COP algorithms. The algorithm is also successfully applied to a dynamic version of the COP considering stochastic travel time.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Improving uplift model evaluation on randomized controlled trial data

Bjorn Bokelmann, Stefan Lessmann

Summary: Estimating treatment effects is an important task for data analysts, and uplift models provide support for efficient allocation of treatments. However, evaluating uplift models is challenging due to variance issues. This paper theoretically analyzes the variance of uplift evaluation metrics, proposes variance reduction methods based on statistical adjustment, and demonstrates their benefits on simulated and real-world data.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Newsvendor conditional value-at-risk minimisation: A feature-based approach under adaptive data selection

Congzheng Liu, Wenqi Zhu

Summary: This paper proposes a feature-based non-parametric approach to minimizing the conditional value-at-risk in the newsvendor problem. The method is able to handle both linear and nonlinear profits without prior knowledge of the demand distribution. Results from numerical and real-life experiments demonstrate the robustness and effectiveness of the approach.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Right-left asymmetry of the eigenvector method: A simulation study

Laszlo Csato

Summary: This paper compares the performance of the eigenvalue method and the row geometric mean as two weighting procedures. Through numerical experiments, it is found that the priorities derived from the two eigenvectors in the eigenvalue method do not always agree, while the row geometric mean serves as a compromise between them.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Compete or cooperate? Effects of channel relationships on government policies for sustainability

Guowei Dou, Tsan-Ming Choi

Summary: This study investigates the impact of channel relationships between manufacturers on government policies and explores the effectiveness of positive incentives versus taxes in increasing social welfare. The findings suggest that competition may be more effective in improving sustainability and social welfare. Additionally, government incentives for green technology may not necessarily enhance sustainability.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)