General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits

This article addresses a technician routing and scheduling problem inspired from an application for the repair of electronic transactions equipment. It consists of designing routes for staff to perform requests while considering certain constraints and resources. The objective is to minimize a linear combination of total weighted distance, overtime, and maximize the served requests. An efficient meta-heuristic algorithm based on variable neighborhood search with an adaptive memory and advanced diversity management method is proposed. Numerical results show that the meta-heuristic outperforms the best existing algorithm from the literature which is a Tabu Search.

Download Full-text

A Heuristic Procedure for a Ship Routing and Scheduling Problem with Variable Speed and Discretized Time Windows

Mathematical Problems in Engineering ◽

10.1155/2014/750232 ◽

2014 ◽

Vol 2014 ◽

pp. 1-13 ◽

Cited By ~ 1

Author(s):

Krystel K. Castillo-Villar ◽

Rosa G. González-Ramírez ◽

Pablo Miranda González ◽

Neale R. Smith

Keyword(s):

Time Windows ◽

Waiting Times ◽

Neighborhood Search ◽

Scheduling Problem ◽

Computational Results ◽

Solution Quality ◽

Ship Routing ◽

Routing And Scheduling ◽

Ship Routing And Scheduling ◽

Tramp Shipping

This paper develops a heuristic algorithm for solving a routing and scheduling problem for tramp shipping with discretized time windows. The problem consists of determining the set of cargoes that should be served by each ship, the arrival, departure, and waiting times at each port, while minimizing total costs. The heuristic proposed is based on a variable neighborhood search, considering a number of neighborhood structures to find a solution to the problem. We present computational results, and, for comparison purposes, we consider instances that can be solved directly by CPLEX to test the performance of the proposed heuristic. The heuristics achieves good solution quality with reasonable computational times. Our computational results are encouraging and establish that our heuristic can be utilized to solve large real-size instances.

Download Full-text

RETRACTED: An Efficient Metaheuristic Approach for the Multi-Period Technician Routing and Scheduling Problem

Engineering, Technology & Applied Science Research ◽

10.48084/etasr.3091 ◽

2019 ◽

Vol 9 (5) ◽

pp. 4718-4723

Author(s):

A. Khattara ◽

W. R. Cherif-Khettaf ◽

M. Mostefai

Keyword(s):

Information Technologies ◽

Variable Neighborhood Search ◽

Neighborhood Search ◽

Scheduling Problem ◽

Conference Paper ◽

Routing And Scheduling ◽

International Conference ◽

Control Decision

This article has been retracted at the request of the Editor-in-Chief and of co authors W. R. Cherif-Khettaf and M. Mostefai, as the article is largely based on work presented previously at an international conference by the same authors. The conference paper is: A. Khattara, W. R. Cherif-Khettaf and M. Mostefai, "Variable neighborhood search procedures for the multi-period technician routing and scheduling problem", 4th International Conference on Control, Decision and Information Technologies (CoDIT), Spain, April 5-7, 2017 and the corresponding author of this submission was unaware of the publication of this conference's proceedings at the time of submission and review/publication of this paper.

Download Full-text

Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections

Discrete Applied Mathematics ◽

10.1016/j.dam.2018.03.019 ◽

2019 ◽

Vol 261 ◽

pp. 344-353 ◽

Cited By ~ 1

Author(s):

Simon Thevenin ◽

Nicolas Zufferey

Keyword(s):

Variable Neighborhood Search ◽

Time Windows ◽

Neighborhood Search ◽

Scheduling Problem

Download Full-text

A new distributed optimization approach for home healthcare routing and scheduling problem

Decision Science Letters ◽

10.5267/j.dsl.2021.4.003 ◽

2021 ◽

Vol 10 (3) ◽

pp. 217-230

Author(s):

Jalel Euchi ◽

Salah Zidi ◽

Lamri Laouamer

Keyword(s):

Health Care ◽

Home Health Care ◽

Distributed Optimization ◽

Time Windows ◽

Home Health ◽

Home Healthcare ◽

Optimization Approach ◽

Scheduling Problem ◽

Routing And Scheduling ◽

Comparison Results

Home health care faces new challenges day by day and it has become increasingly legitimate in the face of an aging population. Home healthcare centers are exposed to cumulative demands and academics are paying attention to the routing and scheduling matter, which is offered in literature as a Technician Routing and Scheduling Problem (TRSP) where the aim is to minimize the total cost subject to the time windows constraints to serve the patients respecting their priorities. In this paper, we develop a new distributed algorithm to resolve the home health care routing and scheduling problem (HHRSP). The principal idea of this algorithm is to apply artificial intelligence techniques in a distributed optimization method. The integration of automatic learning and search methods are applied to optimize the assignment of appointments to home caregivers. It allows us to gain time, effort, especially cost, and while complying with the problem constraints. The comparison results prove the efficacy of the recommended approach, which can offer decision support for medical executives of home health care.

Download Full-text