摘要
旅游业最重要的考虑因素之一是如何设计最佳的旅行形成计划。选择最感兴趣的地点并设计个性化的旅游行程称为旅游行程设计问题(TTDP),并可将其模拟为定向运动问题。在论文中,通过引入时间聚合图建立了一个数学规划模型,并运用基于网络规划和动态规划思想,提出了一种新的标签校正算法(Label Correcting Algorithm,LCA)来解决动态网络规划问题。最后给出一个数值例子说明该算法的有效性和可行性。
One of the most important considerations in tourism is how to design the best travel formation plan. Selecting the lo- cation of greatest interest and designing a personalized travel itinerary is called the Travel Trip Design Problem （TTDP） and can be modeled as a directional movement problem. In this paper, a mathematical programming model is established by introducing time ag- gregation graphs. Based on network planning and dynamic programming ideas, a new label correcting algorithm （LCA） is proposed to solve dynamic network planning problems. Finally, a numerical example is given to illustrate the effectiveness and feasibility of the algorithm.
作者
荆怀芳
JING Huaifang(School of Finance and Econonfics,Xianyang Vocational Technical College,Xianyang 712000)
出处
《计算机与数字工程》
2018年第10期1951-1956,共6页
Computer & Digital Engineering
基金
国家自然科学青年基金项目"新媒体中考虑群体差异的谣言传播机理及干预策略研究"(编号:71503163)资助
关键词
旅游行程规划
定向运动
时变网络
标签校正算法
travel planning
directional movement
time-varying network
label con＇ection algorithm
