具陪伴者需求之就醫接駁服務路徑規劃

Medical Shuttle Service Routing with Caregiver Requirements

當就醫者無法自行就醫或需陪伴者時，通常須自行尋找陪伴。然而，隨著少子化趨勢加劇，此方式日益困難。部分社會福利團體已注意到此問題，除提供接駁服務外，亦提供陪伴者協助。雖然已有文獻探討接駁共乘議題，但針對具陪伴需求之研究仍相當稀少。由於陪伴者由接駁服務提供者安排，且並非所有就醫者皆需陪伴，使得接駁問題變得更為複雜，無法僅透過調整搭乘人數來求解。本研究以成本最小化為目標，運用網路流動技巧與數學規劃方法，建立一個同時考量接駁與陪伴需求之最佳化模型，並以Python與數學規劃軟體Gurobi進行求解。透過範例測試與敏感度分析，結果顯示該模式可作為營運單位在規劃具陪伴需求之醫療接駁服務時的決策輔助工具。

When patients are unable to travel to medical facilities on their own or require companionship, they usually need to find companions by themselves. However, with the intensifying trend of low birth rates, this has become increasingly difficult. Some social welfare organizations have recognized this issue and, in addition to providing shuttle services, also offer companion assistance. Although previous studies have explored shuttle and ride-sharing problems, research focusing on patients requiring companions remains limited. Since companions are arranged by shuttle service providers and not all patients need them, the problem becomes more complex and cannot be solved simply by adjusting the number of passengers. This study aims to minimize total operating costs by developing an optimization model that simultaneously considers shuttle and companionship requirements, using network flow techniques and mathematical programming methods. The model is solved using Python and the Gurobi optimizer. Through case testing and sensitivity analysis, the results indicate that the proposed model can serve as a decision-support tool for operators when planning medical shuttle services involving patients with companion needs.