Efficient GRASP solution approach for the prisoner transportation problem

DOI10.1016/J.COR.2023.106161MaRDI QIDQ6164367FDOQ6164367

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

Publication date: 4 July 2023

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

Recommendations

• The prisoner transportation problem
• The dynamic vehicle allocation problem with application in trucking companies in Brazil
• A GRASP for the Vehicle Routing Problem with Time Windows
• GRASP with a new local search scheme for vehicle routing problems with time windows
• A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution

zbMATH Keywords

vehicle routingGRASPinter-passenger conflictsprisoner transportation problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Optimization by simulated annealing
• A probabilistic heuristic for a computationally difficult set covering problem
• Record breaking optimization results using the ruin and recreate principle
• 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
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
• Vehicle routing with compartments: applications, modelling and heuristics
• The multi-compartment vehicle routing problem with flexible compartment sizes
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• An annotated bibliography of GRASP-Part II: Applications
• An annotated bibliography of GRASP – Part I: Algorithms
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
• The constrained shortest path tour problem
• Optimization by GRASP. Greedy randomized adaptive search procedures
• Heuristics for the constrained incremental graph drawing problem
• Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
• Extending time-to-target plots to multiple instances
• The prisoner transportation problem
• A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times

Cited In (1)

• Hybridizing a matheuristic with ALNS for the optimal collection and delivery of medical specimens

This page was built for publication: Efficient GRASP solution approach for the prisoner transportation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164367)