利用最大片断长度MFL(Maximum Fragment Length problem)模型研究创建者序列重建问题的算法。首先提出一种求解该模型的启发式算法HF,该算法采用向前探测技术确定列值,并充分利用重组体列向0、1取值比例,以及该比例与创建者矩阵的列向0...利用最大片断长度MFL(Maximum Fragment Length problem)模型研究创建者序列重建问题的算法。首先提出一种求解该模型的启发式算法HF,该算法采用向前探测技术确定列值,并充分利用重组体列向0、1取值比例,以及该比例与创建者矩阵的列向0、1取值比例的相关性等启发式信息。其次,通过引入基于HF算法的遗传算子,提出一种重建创建者序列的单亲遗传算法PGMFL。实验结果表明,在相同的时间约束内,PGMFL算法能获得较其他算法更少的断点个数和更长的片段平均长度,是求解创建者序列重建问题的一种有效方法。展开更多
A signal optimization model for roundabout was control concept were used to eliminate the conflict points proposed based on dual-ring scheme and two stop lines for left turns and weaving sections at a roundabout. A cy...A signal optimization model for roundabout was control concept were used to eliminate the conflict points proposed based on dual-ring scheme and two stop lines for left turns and weaving sections at a roundabout. A cycle length minimization problem was considered to generate optimal signal timings for roundabout, and a set of constraints to ensure feasibility and safety of the resulting optimal signal settings were proposed. Extensive experimental analyses in comparison with signalized intersection reveal that the proposed model is quite promising for application in design of roundabout signals, and the minimum cycle length can decrease from 186 s to 79 s while the capacity increases from 8 682 pcu/h to 9 011 pcu/h under high demand scenario. Sensitivity analysis with respect to the system performance show that the lane assignment plan, number of circulatory lanes and left turn ratio are three critical factors which have dominate impacts on performance of signalized roundabout展开更多
Equivalent simplification is an effective method for solving large-scale complex problems. In this paper, the authors simplify a classic project scheduling problem, which is the nonlinear continuous time-cost tradeoff...Equivalent simplification is an effective method for solving large-scale complex problems. In this paper, the authors simplify a classic project scheduling problem, which is the nonlinear continuous time-cost tradeoff problem(TCTP). Simplifying TCTP is a simple path problem in a critical path method(CPM) network. The authors transform TCTP into a simple activity float problem and design a complex polynomial algorithm for its solution. First, the authors discover relationships between activity floats and path lengths by studying activity floats from the perspective of path instead of time.Second, the authors perform simplification and improve the efficiency and accuracy of the solution by deleting redundant activities and narrowing the duration intervals of non-redundant activities. Finally,the authors compare our method with current methods. The relationships between activity floats and path lengths provide new approaches for other path and correlative project problems.展开更多
This paper deals with the existence of solutions for the problem{（Фp（u′））′=f（t,u,u′）,t∈（0,1）, u′（0）=0,u（1）=∑i=1^n-2aiu（ηi）,where Фp（s）=｜s｜^p-2s,p〉1.0〈η1〈η2〈…〈ηn-2〈1,ai（i=1,2,…,n-...This paper deals with the existence of solutions for the problem{（Фp（u′））′=f（t,u,u′）,t∈（0,1）, u′（0）=0,u（1）=∑i=1^n-2aiu（ηi）,where Фp（s）=｜s｜^p-2s,p〉1.0〈η1〈η2〈…〈ηn-2〈1,ai（i=1,2,…,n-2）are non-negative constants and ∑i=1^n-2ai=1.Some known results are improved under some sign and growth conditions. The proof is based on the Brouwer degree theory.展开更多
文摘利用最大片断长度MFL(Maximum Fragment Length problem)模型研究创建者序列重建问题的算法。首先提出一种求解该模型的启发式算法HF,该算法采用向前探测技术确定列值,并充分利用重组体列向0、1取值比例,以及该比例与创建者矩阵的列向0、1取值比例的相关性等启发式信息。其次,通过引入基于HF算法的遗传算子,提出一种重建创建者序列的单亲遗传算法PGMFL。实验结果表明,在相同的时间约束内,PGMFL算法能获得较其他算法更少的断点个数和更长的片段平均长度,是求解创建者序列重建问题的一种有效方法。
基金Project(51178345) supported by the National Natural Science Foundation of ChinaProject(2011AA110305) supported by the National High Technology Research and Development Program of ChinaProject supported by the Program for Young Excellent Talents in Tongji University, China
文摘A signal optimization model for roundabout was control concept were used to eliminate the conflict points proposed based on dual-ring scheme and two stop lines for left turns and weaving sections at a roundabout. A cycle length minimization problem was considered to generate optimal signal timings for roundabout, and a set of constraints to ensure feasibility and safety of the resulting optimal signal settings were proposed. Extensive experimental analyses in comparison with signalized intersection reveal that the proposed model is quite promising for application in design of roundabout signals, and the minimum cycle length can decrease from 186 s to 79 s while the capacity increases from 8 682 pcu/h to 9 011 pcu/h under high demand scenario. Sensitivity analysis with respect to the system performance show that the lane assignment plan, number of circulatory lanes and left turn ratio are three critical factors which have dominate impacts on performance of signalized roundabout
基金supported by the Science and Technology Foundation of Jiangxi Provincial Department of Education in China under Grant No.GJJ161114the Natural Science Foundation of China under Grant No.71271081the Soft Science Research Base of Water Security and Sustainable Development of Jiangxi Province in China
文摘Equivalent simplification is an effective method for solving large-scale complex problems. In this paper, the authors simplify a classic project scheduling problem, which is the nonlinear continuous time-cost tradeoff problem(TCTP). Simplifying TCTP is a simple path problem in a critical path method(CPM) network. The authors transform TCTP into a simple activity float problem and design a complex polynomial algorithm for its solution. First, the authors discover relationships between activity floats and path lengths by studying activity floats from the perspective of path instead of time.Second, the authors perform simplification and improve the efficiency and accuracy of the solution by deleting redundant activities and narrowing the duration intervals of non-redundant activities. Finally,the authors compare our method with current methods. The relationships between activity floats and path lengths provide new approaches for other path and correlative project problems.
基金the National Natural Science Foundation of China(No.10771212)the Foundation of China University of Mining and Technology(Nos.2005A041+1 种基金2006A0422008A037)
文摘This paper deals with the existence of solutions for the problem{（Фp（u′））′=f（t,u,u′）,t∈（0,1）, u′（0）=0,u（1）=∑i=1^n-2aiu（ηi）,where Фp（s）=｜s｜^p-2s,p〉1.0〈η1〈η2〈…〈ηn-2〈1,ai（i=1,2,…,n-2）are non-negative constants and ∑i=1^n-2ai=1.Some known results are improved under some sign and growth conditions. The proof is based on the Brouwer degree theory.
