解算器
计算机科学
启发式
运筹学
布线(电子设计自动化)
人道主义后勤
比例(比率)
急诊分诊台
整数规划
问题解决者
应急管理
车辆路径问题
可靠性(半导体)
资源(消歧)
计算机安全
运营管理
计算机网络
工程类
经济
人工智能
物理
程序设计语言
急诊医学
功率(物理)
计算科学
医学
量子力学
经济增长
算法
作者
Nader Al Theeb,Chase C. Murray
摘要
Abstract After a disaster, supplies must be efficiently and equitably distributed to those in need, wounded persons must be evacuated to triage centers, and relief workers must be transported to affected areas. This complex humanitarian relief problem requires the coordination of numerous vehicles of varying capacities to transport goods, disaster victims, and volunteer workers through a network of roads, some of which may be impassable. To address this problem, a detailed mathematical programming model is presented. Owing to the complexity of this formulation, only small‐scale problem instances may be solved optimally via commercial solver software. Therefore, a new heuristic approach is proposed to solve problems of practical size within acceptable time restrictions. The performance of the heuristic is evaluated for numerous representative test instances.
科研通智能强力驱动
Strongly Powered by AbleSci AI