计算机科学
经济短缺
运筹学
遗传算法
服务(商务)
位置分配
集合(抽象数据类型)
钥匙(锁)
机器学习
工程类
业务
计算机安全
语言学
哲学
营销
政府(语言学)
程序设计语言
作者
Xianjun Guan,Chunjing Ge,Xia Wang,George Wang
摘要
ABSTRACT This article examines the location-allocation of emergency service facilities as aresearch subject. The research presents the setup of the single allocation set cov-ering location-allocation models for emergency service facilities under strong timeconstraints, in view of the shortage of hub & spoke network bypass. The article alsopresentsanextensiontothesingleallocationsetcoveringlocation-allocationmodel(SASCP) and the SASCP model with bypass constraints ( γ -SASCP) for emergencyservice facilities under large-scale emergency requirements. For the two models,an improved genetic algorithm was designed and the two models were respectivelysolved, with the effectiveness of the algorithm verified by a specific example. Theimpacts of change of parameters such as time discount rate, maximum time con-straints, and bypass ratio on the model’s results are compared and analyzed, basedon solved results by the specific example. Key Words: single allocation, set covering, bypass constraints, location-allocation,genetic algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI