Article
Engineering, Industrial
Paola Cappanera, Maria Grazia Scutella
Summary: Optimizing home care services involves addressing arrival time consistency, person-oriented consistency, and demand uncertainty in order to optimize assignment, scheduling, and routing decisions over a multi-day time horizon. Consistent time schedules, person-oriented consistency, and addressing demand uncertainty are crucial for improving service quality. Introducing consistency and demand uncertainty in pattern generation policies is crucial for efficiently computing high-quality solutions.
FLEXIBLE SERVICES AND MANUFACTURING JOURNAL
(2022)
Article
Computer Science, Artificial Intelligence
Niteesh Yadav, Ajinkya Tanksale
Summary: We propose a mixed-integer programming model for a multi-objective home healthcare delivery problem, which can handle most of the commonly imposed restrictions in this field. Our model includes selection, assignment, scheduling, and routing decisions, focusing on improving the quality of the schedule for selected patients. We calculate the inconvenience caused by scattered visits and their overlap with patient-specific inconvenient time windows to minimize the total inconvenience cost for patients while considering other stakeholders' competitive goals.
EXPERT SYSTEMS WITH APPLICATIONS
(2023)
Article
Computer Science, Interdisciplinary Applications
Ting Xiang, Yanfeng Li, Wai Yuen Szeto
Summary: This paper presents a multi-period problem of combining home health care and outpatient service, considering patients' service date regulations and doctors' working regulations. It proposes a mixed-integer nonlinear and convex programming model to minimize total operating costs and maximize patients' preference satisfaction. The results show that the proposed algorithm performs well on small instances and provides higher quality solutions compared to the variable neighborhood search method.
COMPUTERS & INDUSTRIAL ENGINEERING
(2023)
Article
Computer Science, Interdisciplinary Applications
Ines Mathlouthi, Michel Gendreau, Jean-Yves Potvin
Summary: This paper addresses a technician routing and scheduling problem motivated by an application for the repair and maintenance of electronic transactions equipment. A problem-solving methodology based on tabu search, coupled with an adaptive memory, is proposed. Results are reported on test instances with up to 200 tasks.
COMPUTERS & OPERATIONS RESEARCH
(2021)
Article
Computer Science, Artificial Intelligence
Gang Du, Yao Tian, Xiaoling Ouyang
Summary: This study aims to optimize the resource arrangement in home health care services through multi-resources co-scheduling, proposing a Multi-Regions Tabu Search Algorithm and conducting empirical analysis in PuTuo district in Shanghai. The results indicate that multi-resources co-scheduling can effectively reduce total costs.
APPLIED SOFT COMPUTING
(2022)
Article
Computer Science, Interdisciplinary Applications
Jorge Riera-Ledesma, Juan-Jose Salazar-Gonzalez
Summary: This study discusses an optimization problem in the management of a multi-object spectrograph in a telescope, aiming to select a subset of objects for observation within a limited time frame to maximize the total priority of the selection.
COMPUTERS & OPERATIONS RESEARCH
(2021)
Article
Operations Research & Management Science
Neda Tanoumand, Tonguc Unluyurt
Summary: This paper discusses a home health care routing problem using mathematical modeling and a branch-and-price algorithm to minimize total transportation cost, the study shows that the proposed algorithm enhances the effectiveness of solution and resource utilization.
ANNALS OF OPERATIONS RESEARCH
(2021)
Article
Economics
Jia Guo, Jonathan F. Bard
Summary: This paper develops a 3-step algorithm to efficiently construct weekly schedules for healthcare providers who serve patients in aging, rehabilitation and treatment facilities or who are home bound. The algorithm balances multiple metrics and treats patient time windows, continuity of care, and nurse skill qualifications as soft constraints. It involves clustering and assignment of visits, solving a modified traveling salesman problem, and a local search heuristic. The proposed approach offers significantly better schedules for both nurses and patients, as verified through statistical tests and comparisons with actual schedules used by a home healthcare agency.
SOCIO-ECONOMIC PLANNING SCIENCES
(2023)
Article
Multidisciplinary Sciences
Ayyuce Aydemir-Karadag
Summary: This paper discusses the importance of managing healthcare waste during the COVID-19 pandemic and presents a bi-objective mixed-integer nonlinear programming model. A two-step approach is proposed to address the complexity of the problem and the algorithm outperforms other search algorithms in performance evaluation metrics.
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING
(2022)
Article
Computer Science, Interdisciplinary Applications
Sheng-Long Jiang, Weigang Li, Xuejun Zhang, Chuanpei Xu
Summary: This study considers the temporal and technical constraints of hot rolling production and proposes a solution based on the Pareto local search algorithm, which can effectively solve multi-objective hot rolling scheduling problems.
COMPUTERS & INDUSTRIAL ENGINEERING
(2022)
Article
Management
Allyson Silva, Leandro C. Coelho, Maryam Darvish
Summary: The Quadratic Assignment Problem (QAP) is one of the most challenging problems in combinatorial optimization, with many variants developed over the years. This study introduces a parallel algorithm that combines diversification and intensification to improve solutions, demonstrating its effectiveness through computational experiments.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Management
Katrin Hessler
Summary: This study introduces exact solution approaches for discrete and continuous variants of the multi-compartment vehicle routing problem, achieving optimal solutions for previously unsolvable instances. Cost savings from using continuously flexible compartment sizes compared to discretely flexible compartment sizes are also analyzed.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Operations Research & Management Science
Yunqiang Yin, Xiaochang Liu, Feng Chu, Dujuan Wang
Summary: This study considers the use of electric vehicles (EVs) in home health care routing and scheduling to minimize costs. A synergistic-transport mode is introduced, where care-workers can use other modes of transportation, such as walking, when EVs are recharging. A branch-and-price-and-cut algorithm is developed to solve the problem, incorporating a bidirectional labelling algorithm and heuristics. The results show significant cost savings and efficient solution for large-scale instances.
ANNALS OF OPERATIONS RESEARCH
(2023)
Article
Computer Science, Artificial Intelligence
Emmanouil E. Zachariadis, Amalia Nikolopoulou, Eleftherios G. Manousakis, Panagiotis P. Repoussis, Christos D. Tarantilis
Summary: This paper introduces a new Vehicle Routing Problem with capacitated Cross-Docking, focusing on the impact of cross-dock processing capacity on total transportation costs. The author presents a local search metaheuristic algorithm and conducts various computational experiments. From a methodological perspective, dealing with capacity constraints at the cross-dock poses several challenges.
EXPERT SYSTEMS WITH APPLICATIONS
(2022)
Article
Computer Science, Artificial Intelligence
Marouene Chaieb, Dhekra Ben Sassi
Summary: This paper proposes a hierarchical approach to solve the Home Health Care Scheduling Problem with Simultaneous Pick-up and Delivery and Time Window, which combines clustering algorithm and vehicle routing problem model to generate better solutions in less computation time.
APPLIED SOFT COMPUTING
(2021)
Article
Transportation Science & Technology
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
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
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
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
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
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)