A two-phase heuristic algorithm for the problem of scheduling and vehicle routing for delivery of medication to patients
type: Item
instance of: scholarly article
title: A two-phase heuristic algorithm for the problem of scheduling and vehicle routing for delivery of medication to patients
zbMATH Open document ID: 1427.90051
DOI: 10.1155/2018/8901873
author: Rodrigo Linfati
author: John Willmer Escobar
author: Juan Escalona
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: In this paper, a two-phase hybrid algorithm to address the problem of scheduling visits to customers and the vehicle routing problem of medication delivery to highly dependent patients is proposed. In the first phase, the issue of daily scheduling for a cluster of customers is solved via a flexible mathematical optimization model applied to different scenarios. The solution obtained in the first phase generates \(n\) clusters of patients and a frequency routing problem that considers delivery periodicity, location, demand, service times, travel times, and daily load-balancing constraints. In the second phase, a hybrid metaheuristic approach including the synergy and constant iteration between simulated annealing and a record-to-record algorithm is applied to improve the initial solution obtained in the first phase. The effectiveness of the proposed algorithm is validated with real data obtained from a pilot project in Chile. The results are promising and demonstrate the efficiency of the proposed methodology.
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7019675
describes a project that uses: PARPAP
describes a project that uses: VRP
describes a project that uses: VRPH
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/8901873
OpenAlex ID: W2904800637
cites work: Q4532223
cites work: The truck dispatching problem
cites work: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: A scatter search for the periodic capacitated arc routing problem
cites work: Evolutionary algorithms for periodic arc routing problems
cites work: Networks and vehicle routing for municipal waste collection
cites work: The period routing problem
cites work: A Heuristic for the Periodic Vehicle Routing Problem
cites work: Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
cites work: Home health care routing and scheduling: a review
cites work: A Hybrid Approach to Solve the Periodic Home Health Care Problem
cites work: A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
cites work: Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
cites work: A library of local search heuristics for the vehicle routing problem
cites work: Very large-scale vehicle routing: new test problems, algorithms, and results
cites work: A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
Wikidata QID: Q128761593
description: scientific article; zbMATH DE number 7019675