A set partitioning heuristic for the home health care routing and scheduling problem

F Grenouilleau, A Legrain, N Lahrichi… - European Journal of …, 2019 - Elsevier
The home health care routing and scheduling problem comprises the assignment and
routing of a set of home care visits over the duration of a week. These services allow patients …

A matheuristic approach for the pollution-routing problem

R Kramer, A Subramanian, T Vidal… - European Journal of …, 2015 - Elsevier
This paper deals with the Pollution-Routing Problem (PRP), a Vehicle Routing Problem
(VRP) with environmental considerations, recently introduced in the literature by Bektaş and …

Chapter 4: Heuristics for the vehicle routing problem

G Laporte, S Ropke, T Vidal - Vehicle Routing: Problems, Methods, and …, 2014 - SIAM
4.1▪ Introduction In recent years, several sophisticated mathematical programming
decomposition algorithms have been put forward for the solution of the VRP. Yet, despite …

[HTML][HTML] Hybrid column generation and large neighborhood search for the dial-a-ride problem

SN Parragh, V Schmid - Computers & Operations Research, 2013 - Elsevier
Demographic change towards an ever aging population entails an increasing demand for
specialized transportation systems to complement the traditional public means of …

A hybrid large-neighborhood search algorithm for the cumulative capacitated vehicle routing problem with time-window constraints

R Liu, Z Jiang - Applied Soft Computing, 2019 - Elsevier
This paper introduces a special vehicle routing problem, ie the cumulative capacitated
vehicle routing problem with time-window constraints (Cum-CVRPTW). The problem can be …

MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems

AA Juan, J Faulin, A Ferrer, HR Lourenço, B Barrios - Top, 2013 - Springer
This paper discusses the use of probabilistic or randomized algorithms for solving vehicle
routing problems with non-smooth objective functions. Our approach employs non-uniform …

Time-window relaxations in vehicle routing heuristics

T Vidal, TG Crainic, M Gendreau, C Prins - Journal of Heuristics, 2015 - Springer
The contribution of infeasible solutions in heuristic searches for vehicle routing problems
(VRP) is not a subject of consensus in the metaheuristics community. Infeasible solutions …

PILS: exploring high-order neighborhoods by pattern mining and injection

F Arnold, Í Santana, K Sörensen, T Vidal - Pattern Recognition, 2021 - Elsevier
We introduce pattern injection local search (PILS), an optimization strategy that uses pattern
mining to explore high-order local-search neighborhoods, and illustrate its application on …

Managing hospital inpatient beds under clustered overflow configuration

X Gong, X Wang, L Zhou, N Geng - Computers & Operations Research, 2022 - Elsevier
Inpatient beds represent one of the most critical resources in hospitals, of which the
availability has been under increasing pressure in China. Such beds are usually to be either …

An adaptive hybrid algorithm for vehicle routing problems with time windows

ET Yassen, M Ayob, MZA Nazri, NR Sabar - Computers & Industrial …, 2017 - Elsevier
The harmony search algorithm has been proven to be an effective optimization method for
solving diverse optimization problems. However, due to its slow convergence, the …