期刊文献+
共找到44篇文章
< 1 2 3 >
每页显示 20 50 100
Multi-Stage Improvement of Marine Predators Algorithm and Its Application 被引量:1
1
作者 Chuandong Qin Baole Han 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第9期3097-3119,共23页
The metaheuristic algorithms are widely used in solving the parameters of the optimization problem.The marine predators algorithm(MPA)is a novel population-based intelligent algorithm.Although MPA has shown a talented... The metaheuristic algorithms are widely used in solving the parameters of the optimization problem.The marine predators algorithm(MPA)is a novel population-based intelligent algorithm.Although MPA has shown a talented foraging strategy,it still needs a balance of exploration and exploitation.Therefore,a multi-stage improvement of marine predators algorithm(MSMPA)is proposed in this paper.The algorithm retains the advantage of multistage search and introduces a linear flight strategy in the middle stage to enhance the interaction between predators.Predators further away from the historical optimum are required to move,increasing the exploration capability of the algorithm.In the middle and late stages,the searchmechanism of particle swarmoptimization(PSO)is inserted,which enhances the exploitation capability of the algorithm.This means that the stochasticity is decreased,that is the optimal region where predators jumping out is effectively stifled.At the same time,self-adjusting weight is used to regulate the convergence speed of the algorithm,which can balance the exploration and exploitation capability of the algorithm.The algorithm is applied to different types of CEC2017 benchmark test functions and threemultidimensional nonlinear structure design optimization problems,compared with other recent algorithms.The results show that the convergence speed and accuracy of MSMPA are significantly better than that of the comparison algorithms. 展开更多
关键词 Marine predators algorithm multi-stage strategy structural design optimization
在线阅读 下载PDF
A Multi-stage Heuristic Algorithm for Matching Problem in the Modified Miniload Automated Storage and Retrieval System of E-commerce 被引量:2
2
作者 WANG Wenrui WU Yaohua WU Yingying 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2016年第3期641-648,共8页
E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can't fulfill the storage and picking d... E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can't fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center. 展开更多
关键词 e-commerce modified miniload automated storage/retrieval system matching problem multi-stage heuristic algorithm
在线阅读 下载PDF
Multi-stage and multi-objective optimization of anti-typhoon evacuation strategy for riser with new hang-off system
3
作者 Yan-Wei Li Xiu-Quan Liu +3 位作者 Peng-Ji Hu Xiao-Yu Hu Yuan-Jiang Chang Guo-Ming Chen 《Petroleum Science》 2025年第1期457-471,共15页
A new hang-off system has been proposed to improve the security of risers in hang-off modes during typhoons.However,efficient anti-typhoon evacuation strategies have not been investigated.Optimiza-tion model and metho... A new hang-off system has been proposed to improve the security of risers in hang-off modes during typhoons.However,efficient anti-typhoon evacuation strategies have not been investigated.Optimiza-tion model and method for the anti-typhoon evacuation strategies should be researched.Therefore,multi-objective functions are proposed based on operation time,evacuation speed stability,and steering stability.An evacuation path model and a dynamic model of risers with the new hang-off system are developed for design variables and constraints.A multi-objective optimization model with high-dimensional variables and complex constraints is established.Finally,a three-stage optimization method based on genetic algorithm,least square method,and the penalty function method is proposed to solve the multi-objective optimization model.Optimization results show that the operation time can be reduced through operation parameter optimization,especially evacuation heading optimization.The optimal anti-typhoon strategy is evacuation with all risers suspended along a variable path when the direction angle is large,while evacuation with all risers suspended along a straight path at another di-rection angle.Besides,the influencing factors on anti-typhoon evacuation strategies indicate that the proposed optimization model and method have strong applicability to working conditions and remarkable optimization effects. 展开更多
关键词 Anti-typhoon evacuation strategy RISER multi-stage and multi-objective Optimization Genetic algorithm Least square method
原文传递
Algebraic or Algorithmic: Searching for Optimal Solutions in Multi-Stage Supply Chain Models
4
作者 Ab Rahman Ahmad Borkistang Mohamad Sami M. Halawani 《Journal of Software Engineering and Applications》 2017年第8期663-676,共14页
In this paper we proposed an AMH Supply Chain model to obtain optimal solutions for Two-, Three- and Four-Stage for deterministic models. Besides deriving its algebraic solutions, a simple searching method is successf... In this paper we proposed an AMH Supply Chain model to obtain optimal solutions for Two-, Three- and Four-Stage for deterministic models. Besides deriving its algebraic solutions, a simple searching method is successfully applied in obtaining optimal total costs and its integer multipliers. Our model has shown promising results in comparison to Equal Cycle Time and other existing ones. The tests focused on obtaining optimal total annual costs and other related details of Two-, Three- and Four-Stage for deterministic models. The results are run under Visual Basic Programming platform using Intel? CoreTM2 Duo T6500 Processor. 展开更多
关键词 AMH Model ALGEBRAIC Solution INVENTORY Coordination multi-stage Supply Chain MODELS Simple Search algorithm
在线阅读 下载PDF
Modeling and optimization of unbalanced multi-stage logistic system
5
作者 徐杭 徐榕 叶庆泰 《Journal of Southeast University(English Edition)》 EI CAS 2005年第2期220-224,共5页
To decompose an unbalanced multi-stage logistic system to multipleindependent single-stage logistic systems, a new notion of parameterized interface distribution ispresented. For encoding the logistic pattern on each ... To decompose an unbalanced multi-stage logistic system to multipleindependent single-stage logistic systems, a new notion of parameterized interface distribution ispresented. For encoding the logistic pattern on each stage, the Pruefer number is used. With theimproved decoding procedure, any Pruefer number produced stochastically can be decoded to a feasiblelogistic pattern, which can match with the capacities of the nodes of the logistic system. Withthese two innovations, a new modeling method based on parameterized interface distribution and thePriifer number coding is put forward. The corresponding genetic algorithm, named as PIP-GA, can findbetter solutions and require less computational time than st-GA. Although requiring a little moreconsumption of memory, PIP-GA is still an efficient and robust method in the modeling andoptimization of unbalanced multi-stage logistic systems. 展开更多
关键词 LOGISTICS optimization genetic algorithm Priifer number spanning tree parameterized interface distribution unbalanced multi-stage logistic system
在线阅读 下载PDF
Rule-based scheduling of multi-stage multi-product batch plants with parallel units 被引量:2
6
作者 Bin Shi Xinrui Qian +1 位作者 Shanshan Sun Liexiang Yan 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2017年第8期1022-1036,共15页
A novel rule-based model for multi-stage multi-product scheduling problem(MMSP)in batch plants with parallel units is proposed.The scheduling problem is decomposed into two sub-problems of order assignment and order s... A novel rule-based model for multi-stage multi-product scheduling problem(MMSP)in batch plants with parallel units is proposed.The scheduling problem is decomposed into two sub-problems of order assignment and order sequencing.Firstly,hierarchical scheduling strategy is presented for solving the former sub-problem,where the multi-stage multi-product batch process is divided into multiple sequentially connected single process stages,and then the production of orders are arranged in each single stage by using forward order assignment strategy and backward order assignment strategy respectively according to the feature of scheduling objective.Line-up competition algorithm(LCA)is presented to find out optimal order sequence and order assignment rule,which can minimize total flow time or maximize total weighted process time.Computational results show that the proposed approach can obtain better solutions than those of the literature for all scheduling problems with more than 10 orders.Moreover,with the problem size increasing,the solutions obtained by the proposed approach are improved remarkably.The proposed approach has the potential to solve large size MMSP. 展开更多
关键词 Line-up competition algorithm Order assignment role multi-stage multi-product Parallel unit Scheduling optimization
在线阅读 下载PDF
Multi-stage constant current charging strategy considering SOC intervals and voltage thresholds
7
作者 Yu Zhang Si Xu Tiezhou Wu 《Global Energy Interconnection》 EI CAS CSCD 2022年第2期143-153,共11页
Conventional multi-stage constant current charging strategies often use higher multiples of current to charge the battery in pursuit of shorter charging times.However,this leads to an increase in battery temperature,w... Conventional multi-stage constant current charging strategies often use higher multiples of current to charge the battery in pursuit of shorter charging times.However,this leads to an increase in battery temperature,while shortening the charging time.This in turn affects the safety of the charging process.Furthermore,the higher charging currents are not ideal for shortening the charging time in the later stages of charging.To solve the aforementioned problems,in this study,a multi-stage constant current charging strategy is presented.This strategy can shorten the battery charging time by using the increase in battery temperature during the charging process as a constraint,using a genetic algorithm to calculate the charging current value,and investigating the phased approach to charging.Finally,the charging strategy is experimentally validated at different ambient temperatures and different initial SOCs.The experimental results show that the charging strategy proposed in this paper not only reduces the amount of calculations,but also reduces the temperature rise by up to 46.4%and charging time by up to 4.2%under different operating conditions. 展开更多
关键词 Charging time Battery temperature rise Genetic algorithm multi-stage constant current charging
在线阅读 下载PDF
求解MSA问题的新型单亲遗传算法 被引量:3
8
作者 胡桂武 郑启伦 彭宏 《计算机工程与应用》 CSCD 北大核心 2004年第8期5-7,53,共4页
多序列联配(MSA)在生物信息学研究中占有重要地位,MSA问题是一个典型的NP问题,遗传算法是求解NP完全问题的一种理想方法。文章针对MSA问题,提出了一种新型单亲遗传算法(PGA),不使用交叉算子,只使用变异和选择算子。并根据群体的多样性... 多序列联配(MSA)在生物信息学研究中占有重要地位,MSA问题是一个典型的NP问题,遗传算法是求解NP完全问题的一种理想方法。文章针对MSA问题,提出了一种新型单亲遗传算法(PGA),不使用交叉算子,只使用变异和选择算子。并根据群体的多样性自适应调节变异概率,有效消除了算法中的欺骗性条件,使用灾变算子来确保算法的搜索能力。整个算法模拟了自然界进化的周期性,较好地解决了群体的多样性和收敛深度的矛盾。算法的分析和测试表明,该算法是有效的。 展开更多
关键词 msa 单亲遗传算法 生物信息学 算子
在线阅读 下载PDF
基于MSA特征和模拟退火优化的遥感图像多目标关联算法 被引量:1
9
作者 李晖晖 滑立 +1 位作者 杨宁 刘坤 《吉林大学学报(工学版)》 EI CAS CSCD 北大核心 2015年第4期1353-1359,共7页
由于当前遥感成像技术一般只能获取采样稀疏的遥感图像,无法准确估计目标的状态信息,因此传统的利用状态特征进行关联的方法并不适合遥感图像的目标关联。选取不依赖于时间的目标图像特征作为关联量又无法处理大场景中多个目标关联引起... 由于当前遥感成像技术一般只能获取采样稀疏的遥感图像,无法准确估计目标的状态信息,因此传统的利用状态特征进行关联的方法并不适合遥感图像的目标关联。选取不依赖于时间的目标图像特征作为关联量又无法处理大场景中多个目标关联引起的模糊性。针对上述问题,本文提出了基于多尺度自卷积不变矩特征匹配和模拟退火优化的多目标关联算法。首先提取目标的多尺度自卷积矩(MSA)特征,计算特征间匹配概率,构造整体关联代价矩阵,并设置自适应温度更新函数和双阈值对模拟退火算法进行改进,快速寻求全局最优解。实验结果表明,该算法能够有效地利用遥感图像特征信息,消除关联模糊性,高效解决多目标关联问题。 展开更多
关键词 摄影测量与遥感技术 目标关联 msa特征 关联代价矩阵 模拟退火算法
在线阅读 下载PDF
A systematic approach in load disaggregation utilizing a multi-stage classification algorithm for consumer electrical appliances classification 被引量:5
10
作者 Chuan Choong YANG Chit Siang SOH Vooi Voon YAP 《Frontiers in Energy》 SCIE CSCD 2019年第2期386-398,共13页
The potential to save energy in existing consumer electrical appliances is very high. One of the ways to achieve energy saving and improve energy use awareness is to recognize the energy consumption of individual elec... The potential to save energy in existing consumer electrical appliances is very high. One of the ways to achieve energy saving and improve energy use awareness is to recognize the energy consumption of individual electrical appliances. To recognize the energy consumption of consumer electrical appliances, the load disaggregation methodology is utilized. Non-intrusive appliance load monitoring (NIALM) is a load disaggrega-tion methodology that disaggregates the sum of power consumption in a single point into the power consumption of individual electrical appliances. In this study, load disaggregation is performed through voltage and current waveform, known as the V-I trajectory. The classification algorithm performs cropping and image pyramid reduction of the V-I trajectory plot template images before utilizing the principal component analysis (PCA) and the k-nearest neighbor (k-NN) algorithm. The novelty of this paper is to establish a systematic approach of load disaggregation through V-I trajectory-based load signature images by utilizing a multi-stage classification algorithm methodol-ogy. The contribution of this paper is in utilizing the “k- value,” the number of closest data points to the nearest neighbor, in the k-NN algorithm to be effective in classification of electrical appliances. The results of the multi-stage classification algorithm implementation have been discussed and the idea on future work has also been proposed. 展开更多
关键词 LOAD DISAGGREGATION voltage-current (V-I) trajectory multi-stage CLASSIFICATION algorithm principal component analysis (PCA) k-nearest NEIGHBOR (k-NN)
原文传递
A Shortest Path Algorithm for Multi-stage Network with Linear Parameter 被引量:2
11
作者 GAOTai-ping WANGChuan-long 《Systems Science and Systems Engineering》 CSCD 2002年第3期341-344,共4页
In this paper, we give the shortest path algorithm for multi-stage network with a linear parameter, and study its complexity.
关键词 the shortest path algorithm multi-stage network linear parameter
原文传递
Automatic and Rapid Throughflow-Based Optimal Design Method for Multi-Stage Axial-Flow Compressors
12
作者 LEI Fan ZHANG Xiawen +1 位作者 JU Yaping ZHANG Chuhua 《Journal of Thermal Science》 2025年第1期77-91,共15页
Throughflow design has the advantages of less time consumption and large optimization space,and thus is the corner stone of advanced design system of multi-stage axial-flow compressors.The majority of relevant studies... Throughflow design has the advantages of less time consumption and large optimization space,and thus is the corner stone of advanced design system of multi-stage axial-flow compressors.The majority of relevant studies were limited to the throughflow inverse designs,and quite few works have been till now devoted to the throughflow optimal designs.In this work,an automatic and rapid throughflow-based optimal design method is proposed for axial-flow compressors in which a throughflow inverse design solver is embedded in optimal genetic algorithm to improve the design efficiency of axial-flow compressor.Two types of design parameters in the throughflow inverse design of axial-flow compressors,i.e.,swirl and shroud curve,are simultaneously used to optimize both the blade shape and flow path.The proposed method is validated by the redesign optimization of the benchmark axial-flow compressor NASA Stage 35,and the CFD predictions show that the throughflow-based optimization leads to 1.18% efficiency benefit at design condition.The proposed method is then utilized to the two-dimensional throughflow optimal design of a large-scale 6.5-stage axial-flow industrial compressor.The optimal design results are confirmed by CFD predictions,indicating that the proposed method can effectively improve the design adiabatic efficiency of the compressors by 1.09% within a few minutes on desk-top computer.Two throughflow design implications are also obtained for advanced axial-flow industrial compressors.This work could enhance the capability of throughflow design method and has engineering application value to explore the throughflow optimization space of multi-stage axial-flow compressors. 展开更多
关键词 multi-stage axial-flow compressor throughflow design empirical correlations genetic algorithm aerodynamic optimization
原文传递
Three-Stage Based Hybrid Metaheuristic Algorithm for Agile Satellites Joint Imaging and Data Transmission Scheduling
13
作者 Yi Gu Lei Li Guohua Wu 《Tsinghua Science and Technology》 2026年第1期238-258,共21页
As the observation data generated by Earth Observation Satellites(EOSs)increase,the joint scheduling of satellite imaging and data transmission has become a bottleneck in EOS resource applications.This study has propo... As the observation data generated by Earth Observation Satellites(EOSs)increase,the joint scheduling of satellite imaging and data transmission has become a bottleneck in EOS resource applications.This study has proposed a three-stage-based hybrid meta-heuristic scheduling algorithm for the Agile Satellite Joint Imaging and Data Transmission Scheduling(ASJIDTS)problem.The original complex problem is decomposed into three distinct phases:joint task allocation for imaging and data transmission,scheduling of imaging tasks,and scheduling data transmission tasks.During the initial phase of joint task allocation,both imaging and data transmission resources are preemptively allocated using a greedy-based strategy,which considers data transmission opportunities,the conflict degree,and the spatial distribution of different resources.Subsequently,the imaging task scheduling phase generates an optimized sequence for imaging tasks.Based on this sequence,a rule-based multi-insertion strategy for the data transmission scheduling phase has been designed,which ensures rapid responsiveness to data transmission tasks.Extensive experiments have been conducted to verify the proposed algorithm.For the scheduling scenarios with 200 tasks,The Hybrid Metaheuristic Algorithm based on Multi-Stage(HMA-MS)shows at least a 14.11%increase in scheduling profit compared to several excellent algorithms.The experimental results validate the superior capability of the proposed algorithm in handling large-scale scheduling problems. 展开更多
关键词 agile satellites imaging and data transmission scheduling heuristic algorithm multi-stage framework
原文传递
基于行程质量的随机用户平衡分配模型 被引量:26
14
作者 刘海旭 蒲云 《中国公路学报》 EI CAS CSCD 北大核心 2004年第4期93-95,118,共4页
提出行程质量的概念以描述出行者在不确定环境下的路径选择准则。将行程质量定义为行程时间和行程时间可靠性的线性加权和,综合了影响路径选择的两个不同的重要因素:行程时间和行程时间可靠性。假定在路段通行能力随机变化的情况下出行... 提出行程质量的概念以描述出行者在不确定环境下的路径选择准则。将行程质量定义为行程时间和行程时间可靠性的线性加权和,综合了影响路径选择的两个不同的重要因素:行程时间和行程时间可靠性。假定在路段通行能力随机变化的情况下出行者以估计行程质量费用最小作为路径选择的标准,建立了基于行程质量的随机用户平衡分配模型。证明了模型解的等价性和唯一性,给出了求解模型的MSA算法。在一个小型测试网络上的计算结果表明:模型能够反映出行者在随机路网中的路径选择行为。 展开更多
关键词 交通工程 随机用户平衡 msa算法 行程质量 行程时间可靠性 路段通行能力
在线阅读 下载PDF
基于网络均衡的交叉口分流率计算方法 被引量:3
15
作者 程琳 于春青 +1 位作者 王炜 许项东 《西南交通大学学报》 EI CSCD 北大核心 2008年第2期165-172,共8页
为研究交通需求的空间分布对网络瓶颈的影响,提出了基于网络均衡的交叉口分流率计算方法.以随机型用户均衡网络为对象,研究网络均衡状态下的路段选择率、交叉口分流率及其相互关系.以Dial加载为基础,根据概率原理和权理论推导得出单路... 为研究交通需求的空间分布对网络瓶颈的影响,提出了基于网络均衡的交叉口分流率计算方法.以随机型用户均衡网络为对象,研究网络均衡状态下的路段选择率、交叉口分流率及其相互关系.以Dial加载为基础,根据概率原理和权理论推导得出单路段和双路段选择率的计算公式.根据交通网络均衡状态下的路段选择率和MSA算法与Dial加载的关系,推导了交叉口分流率和分叉流量的计算公式.用数值实验验证了提出的方法的可行性. 展开更多
关键词 Dial加载 msa算法 路段选择率 交叉口分流率 网络均衡
在线阅读 下载PDF
交通分布-交通分配组合模型研究 被引量:8
16
作者 刘桢根 邓卫 《武汉理工大学学报(交通科学与工程版)》 2006年第6期1031-1033,共3页
在交通规划实践中,交通分布和交通分配问题作为“四阶段预测模型”各自独立,尽管两个问题紧密相关.因此,有必要建立交通分布-交通分配组合模型,来反映这种反馈.文中介绍了Evans模型,并说明了逐次平均法求解模型的步骤,最后用算例说明了... 在交通规划实践中,交通分布和交通分配问题作为“四阶段预测模型”各自独立,尽管两个问题紧密相关.因此,有必要建立交通分布-交通分配组合模型,来反映这种反馈.文中介绍了Evans模型,并说明了逐次平均法求解模型的步骤,最后用算例说明了具体算法.这种方法完全可以用M icrosoft Exce l计算,计算方法简单,可以为组合模型的求解提供新的思路. 展开更多
关键词 Evans算法 交通分布-交通分配组合算法 逐次平均法
在线阅读 下载PDF
基于遗传算法与星比对的多序列比对混合算法 被引量:2
17
作者 胡桂武 郑启伦 彭宏 《计算机应用》 CSCD 北大核心 2004年第5期90-91,112,共3页
多序列比对(MSA)是一个典型的NP完全问题,星比对是一种有效的多序列比对算法。文章针对MSA问题提出了将遗传算法与星比对算法结合在一起的混合算法,该算法充分发挥了遗传算法和星比对算法的优越性,可提高求解MSA问题的计算精度和计算速... 多序列比对(MSA)是一个典型的NP完全问题,星比对是一种有效的多序列比对算法。文章针对MSA问题提出了将遗传算法与星比对算法结合在一起的混合算法,该算法充分发挥了遗传算法和星比对算法的优越性,可提高求解MSA问题的计算精度和计算速度,整个算法模拟了自然界进化的周期性,较好的解决了群体的多样性和收敛深度的矛盾。实验表明,该算法是有效的。 展开更多
关键词 多序列比对 生物信息学 遗传算法 星比对 算子
在线阅读 下载PDF
准循环LDPC码的两种典型快速译码算法研究 被引量:2
18
作者 刘晓健 吴晓富 赵春明 《电子与信息学报》 EI CSCD 北大核心 2009年第1期79-82,共4页
该文从译码速率、硬件实现的复杂度和误码率3个方面对比研究了两种典型的高速译码算法:Turbo型和积算法与并行加权比特翻转算法。以准循环LDPC码为对象,给出了Turbo型和积算法和并行加权比特翻转算法的实现时序、硬件复杂度以及误码率性... 该文从译码速率、硬件实现的复杂度和误码率3个方面对比研究了两种典型的高速译码算法:Turbo型和积算法与并行加权比特翻转算法。以准循环LDPC码为对象,给出了Turbo型和积算法和并行加权比特翻转算法的实现时序、硬件复杂度以及误码率性能,其中,并行加权比特翻转算法的高效时序结构是首次给出的。计算机仿真结果表明,这两种算法都能够在迭代次数较少时取得良好的性能。 展开更多
关键词 Turbo型和积算法 并行加权比特翻转算法 最小和算法 准循环LDPC码
在线阅读 下载PDF
截断随机出行时间下可靠网络均衡模型 被引量:5
19
作者 凃强 程琳 +2 位作者 孙超 唐芳 李嫚嫚 《东南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2020年第1期175-181,共7页
针对现有随机交通网络均衡模型未考虑路径出行时间的有界性和准时到达概率对出行者路径选择行为影响的问题,基于截断随机出行时间,提出了克服其局限性的可靠网络均衡条件,该均衡条件下没有出行者可以通过单方面改变出行路径来提高准时... 针对现有随机交通网络均衡模型未考虑路径出行时间的有界性和准时到达概率对出行者路径选择行为影响的问题,基于截断随机出行时间,提出了克服其局限性的可靠网络均衡条件,该均衡条件下没有出行者可以通过单方面改变出行路径来提高准时到达概率.构建了该均衡条件的等价变分不等式(VI)模型,并证明了其等价性和解的存在性.设计了基于路径的相继平均(MSA)算法对模型求解.采用Nguyen-Dupuis网络对可靠网络均衡模型和MSA算法的有效性进行了测试.研究结果表明:该算法能够快速收敛到较高精度;与不考虑随机出行时间有界性的模型相比,网络均衡状态下的准时到达概率和流量分布均存在差异,最大路段流量相对变化值达到38.5%;增加出行时间预算和降低出行时间上界均可以有效提高起讫点间的准时到达概率. 展开更多
关键词 交通工程 截断正态分布 可靠网络均衡 变分不等式模型 msa算法
在线阅读 下载PDF
出行策略与行程时间不确定下的公交客流分配方法 被引量:6
20
作者 柳伍生 贺剑 +1 位作者 李甜甜 谌兰兰 《交通运输系统工程与信息》 EI CSCD 北大核心 2018年第6期117-124,139,共9页
利用杭州市公交线路站点GIS数据和车辆运行GPS数据进行分析,将公交车到站时间分为站点停靠时间和站间行程时间,得到公交车站点之间运行可能总时间的分布概率.通过实际的公交路网结构,定义扩展的公交网络有效路径.在考虑公交线路联合发... 利用杭州市公交线路站点GIS数据和车辆运行GPS数据进行分析,将公交车到站时间分为站点停靠时间和站间行程时间,得到公交车站点之间运行可能总时间的分布概率.通过实际的公交路网结构,定义扩展的公交网络有效路径.在考虑公交线路联合发车频率和根据乘客路径选择的广义成本下,建立出行策略与行程时间不确定下的公交客流分配模型,并将公交线路发车时刻表引入用户均衡模型中,设计了基于扩展网络最短路的Method of Successive Average(MSA)算法求解,通过对两个交通小区间高峰小时的客流分配结果验证模型和算法的有效性. 展开更多
关键词 交通工程 客流分配 msa算法 城市公共交通 行程时间 出行策略 不确定性
在线阅读 下载PDF
上一页 1 2 3 下一页 到第
使用帮助 返回顶部