摘要
针对旅游场所的拥挤问题,以游客在时间与空间上的均衡分布程度、游客在有限时间内得到的效用最大化为双目标,建立了单次路径规划问题的数学模型,将其视为一类特殊的OP设计了求解该问题的蚁群优化算法,并通过算例验证了算法的有效性。
The mathematical model is proposed with the bi-objective of the balanced distribution degree of visitors and visitors' utility maximization in a max time limited. Regarding as a variant of the orienteering problem,an ant colony optimization approach is presented to solve the model,and the test instances demonstrate its validity.
出处
《系统科学学报》
CSSCI
2014年第2期74-78,共5页
Chinese Journal of Systems Science
基金
广东省哲学社会科学"十二五"规划项目(GD11CGL03)
关键词
服务支持系统
拥挤
路径规划
协调
定向问题
Service support system
Congestion
Routing
Coordination
The orienteering problem
