Efficient GRASP solution approach for the prisoner transportation problem

DOI10.1016/j.cor.2023.106161MaRDI QIDQ6164367

Tommaso Pastore, Paola Festa, Daniele Ferone, Mauricio G. C. Resende

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

vehicle routingGRASPinter-passenger conflictsprisoner transportation problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Optimization by Simulated Annealing
• The multi-compartment vehicle routing problem with flexible compartment sizes
• The constrained shortest path tour problem
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
• Vehicle routing with compartments: applications, modelling and heuristics
• A probabilistic heuristic for a computationally difficult set covering problem
• Heuristics for the constrained incremental graph drawing problem
• Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
• Record breaking optimization results using the ruin and recreate principle
• The prisoner transportation problem
• Dynamic transportation of patients in hospitals
• The dial-a-ride problem: Models and algorithms
• A tabu search approach for the livestock collection problem
• Solving a rich vehicle routing and inventory problem using column generation
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
• Optimization by GRASP
• An annotated bibliography of GRASP-Part II: Applications
• An annotated bibliography of GRASP – Part I: Algorithms
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• Extending time‐to‐target plots to multiple instances
• A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times