Efficient GRASP solution approach for the Prisoner Transportation Problem
Comput. Oper. Res.(2023)
摘要
Every day, resources are allocated to the transportation of prisoners to and from services such as hospitals and court proceedings. The optimal allocation of the resources – such as protected vehicles, drivers, and guards – is a complex task that requires significant efforts of human planners. For this reason, a recent paper described the Prisoner Transportation Problem (PTP), that aims to optimize the transportation of convicts between origin–destination pairs within pre-defined time windows. In addition to the similarities with the Vehicle Routing Problem with Time Windows, the PTP presents many additional challenges induced by the use of multi-comparted vehicles and incompatibility constraints, related to the safety of both prisoners and personnel.
更多查看译文
关键词
Vehicle routing,Prisoner transportation problem,Inter-passenger conflicts,GRASP
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要