4.7 Article

A multi-objective home healthcare delivery model and its solution using a branch-and-price algorithm and a two-stage meta-heuristic algorithm

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trc.2022.103838

关键词

Home healthcare delivery; Branch-and-price; Multi-objective optimization; Tabu search; Assignment; Scheduling; Routing

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

The application of optimization techniques to home care service planning has gained attention due to the increasing demand for dedicated care. A mixed integer programming model is developed to simultaneously consider nurse-patient assignment, nurse workday scheduling, and nurse routing. The multi-objective model aims to minimize costs and maximize compatibility between nurses and patients. Computational studies demonstrate the superiority of the developed approaches in terms of cost savings, improved compatibility, and solving efficiency.
The application of optimization techniques to home care service planning has received in-creasing attention, as more patients are in need of dedicated care. Currently, the problem of scheduling home care services is not performed in an optimal way taking into account the complexities of the problem in an integrated way and thus there is substantial room for improvement as the scale of the industry increases. We address the home care planning problem by formulating a mixed integer programming model that simultaneously considers the assignment of nurses to patients, the scheduling of nurses' workdays and the routing of nurses between patients. The problem is formulated as a multi-objective problem that aims to minimize healthcare-associated service and routing costs while maximizing compatibility of nurses and patients. Two approaches are developed to solve the problem, namely a branch-and-price algorithm as well as a two-stage meta-heuristic. We evaluate the performance of each solution approach, and also assess the value of integrating the assignment, scheduling and routing decisions versus solving these problems sequentially. Computational studies demonstrate that our multi-objective model can bring about savings in healthcare costs and improve the compatibility between nurses and patients. These studies also demonstrate that solutions with increased compatibility do not necessarily come at a price of increased healthcare costs. Furthermore, we show that the two approaches we develop are superior to solving the mixed integer programming model using a conventional solver.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
Article Transportation Science & Technology

3-Strategy evolutionary game model for operation extensions of subway networks

Yue Zhao, Liujiang Kang, Huijun Sun, Jianjun Wu, Nsabimana Buhigiro

Summary: This study proposes a 2-population 3-strategy evolutionary game model to address the issue of subway network operation extension. The analysis reveals that the rule of maximum total fitness ensures the priority of evolutionary equilibrium strategies, and proper adjustment minutes can enhance the effectiveness of operation extension.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Integrated optimization of container allocation and yard cranes dispatched under delayed transshipment

Hongtao Hu, Jiao Mob, Lu Zhen

Summary: This study investigates the challenges of daily storage yard management in marine container terminals considering delayed transshipment of containers. A mixed-integer linear programming model is proposed to minimize various costs associated with transportation and yard management. The improved Benders decomposition algorithm is applied to solve the problem effectively and efficiently.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Range-constrained traffic assignment for electric vehicles under heterogeneous range anxiety

Zhandong Xu, Yiyang Peng, Guoyuan Li, Anthony Chen, Xiaobo Liu

Summary: This paper studied the impact of range anxiety among electric vehicle drivers on traffic assignment. Two types of range-constrained traffic assignment problems were defined based on discrete or continuous distributed range anxiety. Models and algorithms were proposed to solve the two types of problems. Experimental results showed the superiority of the proposed algorithm and revealed that drivers with heightened range anxiety may cause severe congestion.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Demand forecasting and predictability identification of ride-sourcing via bidirectional spatial-temporal transformer neural processes

Chuanjia Li, Maosi Geng, Yong Chen, Zeen Cai, Zheng Zhu, Xiqun (Michael) Chen

Summary: Understanding spatial-temporal stochasticity in shared mobility is crucial, and this study introduces the Bi-STTNP prediction model that provides probabilistic predictions and uncertainty estimations for ride-sourcing demand, outperforming conventional deep learning methods. The model captures the multivariate spatial-temporal Gaussian distribution of demand and offers comprehensive uncertainty representations.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Partial trajectory method to align and validate successive video cameras for vehicle tracking

Benjamin Coifman, Lizhe Li

Summary: This paper develops a partial trajectory method for aligning views from successive fixed cameras in order to ensure high fidelity with the actual vehicle movements. The method operates on the output of vehicle tracking to provide direct feedback and improve alignment quality. Experimental results show that this method can enhance accuracy and increase the number of vehicles in the dataset.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Dynamic routing for the Electric Vehicle Shortest Path Problem with charging station occupancy information

Mohsen Dastpak, Fausto Errico, Ola Jabali, Federico Malucelli

Summary: This article discusses the problem of an Electric Vehicle (EV) finding the shortest route from an origin to a destination and proposes a problem model that considers the occupancy indicator information of charging stations. A Markov Decision Process formulation is presented to optimize the EV routing and charging policy. A reoptimization algorithm is developed to establish the sequence of charging station visits and charging amounts based on system updates. Results from a comprehensive computational study show that the proposed method significantly reduces waiting times and total trip duration.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)