期刊文献+
共找到5,505篇文章
< 1 2 250 >
每页显示 20 50 100
基于混合局部搜索方法的大规模车辆路由问题求解研究 预览
1
作者 罗海峰 《安徽职业技术学院学报》 2019年第2期5-8,共4页
车辆路由问题(Vehicle Routing Problem,VRP)是一种复杂的组合优化问题,属NP-hard问题。文章对大规模的容量受限的车辆路由问题(Capacitated Vehicle Routing Problem,CVRP)进行了分析和建模,并设计了一种混合局部搜索方法(Hybrid Local... 车辆路由问题(Vehicle Routing Problem,VRP)是一种复杂的组合优化问题,属NP-hard问题。文章对大规模的容量受限的车辆路由问题(Capacitated Vehicle Routing Problem,CVRP)进行了分析和建模,并设计了一种混合局部搜索方法(Hybrid Local Search Approach,HLSA)对问题进行求解。所设计的HLSA中,主要利用传统局部搜索和大规模邻域搜索对解的邻域进行搜索。最后,通过对基准测试数据的计算,验证了HLSA对大规模CVRP的有效性。 展开更多
关键词 车辆路由问题 局部搜索 启发式算法 大规模
在线阅读 免费下载
Heuristics for Online Scheduling on Identical Parallel Machines with Two GoS Levels
2
作者 CAI Shuang LIU Ke 《系统科学与复杂性学报:英文版》 SCIE EI CSCD 2019年第4期1180-1193,共14页
This paper considers the online scheduling problem on m(m≥3)parallel machines(the first k machines with grade 1 and the remaining m-k machines with grade 2)with two Go S levels and makespan as the objective function.... This paper considers the online scheduling problem on m(m≥3)parallel machines(the first k machines with grade 1 and the remaining m-k machines with grade 2)with two Go S levels and makespan as the objective function.The jobs arrive over time with grade 1 or 2 and an arrival job can be assigned to a machine only when the grade of the job is no less than the grade of the machine.Three cases are considered:(i)For k=1,the authors present an online algorithm with competitive ratio of9/5.(ii)For 1<k<m-1,an online algorithm with competitive ratio of 2.280 is proposed.(iii)For k=m-1,an online algorithm is presented with competitive ratio of 2.All the three algorithms are based on greedy algorithm with a similar structure.At last,numerical instances are given and the average competitive ratios of the instances show good performance of the proposed algorithms. 展开更多
关键词 GRADE of Service(GoS)constraints HEURISTIC algorithm online SCHEDULING parallel machine SCHEDULING
A branching heuristic for SAT solvers based on complete implication graphs
3
作者 Fan XIAO Chu-Min LI +3 位作者 Mao LUO Felip MANYA Zhipeng Lü Yu LI 《中国科学:信息科学(英文版)》 SCIE EI CSCD 2019年第7期170-182,共13页
The performance of modern conflict-driven clause learning(CDCL) SAT solvers strongly depends on branching heuristics. State-of-the-art branching heuristics, such as variable state independent decaying sum(VSIDS) and l... The performance of modern conflict-driven clause learning(CDCL) SAT solvers strongly depends on branching heuristics. State-of-the-art branching heuristics, such as variable state independent decaying sum(VSIDS) and learning rate branching(LRB), are computed and maintained by aggregating the occurrences of the variables in conflicts. However, these heuristics are not sufficiently accurate at the beginning of the search because they are based on very few conflicts. We propose the distance branching heuristic, which,given a conflict, constructs a complete implication graph and increments the score of a variable considering the longest distance between the variable and the conflict rather than the simple presence of the variable in the graph. We implemented the proposed distance branching heuristic in Maple LCM and Glucose-3.0, two of the best CDCL SAT solvers, and used the resulting solvers to solve instances from the application and crafted tracks of the 2014 and 2016 SAT competitions and the main track of the 2017 SAT competition. The empirical results demonstrate that using the proposed distance branching heuristic in the initialization phase of Maple LCM and Glucose-3.0 solvers improves performance. The Maple LCM solver with the proposed distance branching heuristic in the initialization phase won the main track of the 2017 SAT competition. 展开更多
关键词 SAT branching HEURISTIC conflict-driven CLAUSE learning IMPLICATION GRAPH
Voice Recognition by Neuro-Heuristic Method
4
作者 Dawid Pofap Marcin Wozniak 《清华大学学报自然科学版(英文版)》 EI CAS CSCD 2019年第1期9-17,共9页
The amount of digital data is increasing every day.At every step of our daily lives,we deal with technologies in which our data are stored (e.g.,mobile phones and laptops),and this is one of the main reasons for the d... The amount of digital data is increasing every day.At every step of our daily lives,we deal with technologies in which our data are stored (e.g.,mobile phones and laptops),and this is one of the main reasons for the design of various types of encryption and user identity verification algorithms.These algorithms are meant not only to fulfill the desire of protecting data but also to address the possibility of granting access of specific digital data to selected individuals.This process brings with it the problem of identity verification.This paper discusses the problem of voice verification and presents a voice verification method based on artificial intelligence methods. Numerous tests are performed herein to demonstrate the effectiveness of the presented solution.The research results are shown and discussed in terms of the advantages and disadvantages of the solution. 展开更多
关键词 neural network HEURISTIC ALGORITHMS DISCRETE FOURIER TRANSFORM (DFT) image processin
有限元仿真的一堂课--兼说实例驱动型启发式教学法 预览
5
作者 杨帆 王莉华 赵金峰 《力学与实践》 北大核心 2019年第4期463-469,共7页
有限元仿真课程已成为力学等专业新工科人才培养中的重要环节。本文针对该课程的特点,提出了实例驱动型启发式的教学方法。通过对带孔方板受拉问题的教学实例的阐述,详细介绍了实例驱动型教学方法的组成部分和实施要点,讨论了启发式理... 有限元仿真课程已成为力学等专业新工科人才培养中的重要环节。本文针对该课程的特点,提出了实例驱动型启发式的教学方法。通过对带孔方板受拉问题的教学实例的阐述,详细介绍了实例驱动型教学方法的组成部分和实施要点,讨论了启发式理念在该实例教学中的体现。通过同济大学的教学实践,表明所提方法能显著提高教学效果。 展开更多
关键词 有限元 实例驱动 启发式 带孔方板
在线阅读 下载PDF
“激励-启发式”教学方法在《信息系统分析与设计》课程中的应用研究 预览
6
作者 谢晓玲 《电脑与信息技术》 2019年第5期77-79,共3页
《信息系统分析和设计》是信息管理和信息系统专业学生的一门必修的专业基础课。针对该课程教学中存在的学生兴趣不高和课程要求高、实践性强、枯燥、繁琐和复杂的问题,提出了一种对应的“激励-启发式”教学方法。该教学方法主要包括制... 《信息系统分析和设计》是信息管理和信息系统专业学生的一门必修的专业基础课。针对该课程教学中存在的学生兴趣不高和课程要求高、实践性强、枯燥、繁琐和复杂的问题,提出了一种对应的“激励-启发式”教学方法。该教学方法主要包括制度激励、问题启发和实例启发三个基本部分,用于引导学生积极思考,活跃课堂气氛,达到提升学生学习兴趣和增强学习效果的目的。实施结果表明,该教学方法能有效提高《信息系统分析与设计》课程的教学效果。 展开更多
关键词 信息系统分析与设计 激励 启发 教学方法
在线阅读 下载PDF
决策双系统视角下的亲环境行为述评 预览
7
作者 邓雅丹 郭蕾 路红 《心理研究》 2019年第2期154-161,共8页
面对环境问题威胁,心理学界进行亲环境行为研究的最终目标是助推亲环境行为的发生。现存的模型不能很好地解决行为意图和行为表现之间的不一致性。为此,本文对亲环境行为领域中计划行为理论、规范激活模型以及价值观-信念-规范理论的整... 面对环境问题威胁,心理学界进行亲环境行为研究的最终目标是助推亲环境行为的发生。现存的模型不能很好地解决行为意图和行为表现之间的不一致性。为此,本文对亲环境行为领域中计划行为理论、规范激活模型以及价值观-信念-规范理论的整合阶段进行梳理,并指出潜在的原因可能是当前的主流模型是基于分析式系统的,低估了启发式系统的作用。从决策双系统理论出发,论证了关注启发式系统的必要性和可行性,以及整理常见的作用机制,并提出了启发式系统下亲环境行为研究的未来研究取向。 展开更多
关键词 亲环境行为 启发式 双系统理论
在线阅读 免费下载
Deflation and Stock Prices 预览
8
作者 Michael Clemens 《管理研究:英文版》 2019年第2期113-129,共17页
While the literature on inflation and stock prices is plentiful,there is little literature on deflation and stock prices.This paper explores the empirical data and makes a theoretical analysis of the likely impact on ... While the literature on inflation and stock prices is plentiful,there is little literature on deflation and stock prices.This paper explores the empirical data and makes a theoretical analysis of the likely impact on stock prices when expectations change from inflation to deflation.Deflation has a bad name among some economists and most investors.However,from a stock market perspective,deflations’bad name may not be well-deserved.Several observations support this:1)The 1930s was a statistical outlier and not representative for a deflationary period and deflation does not seem to create recessions,causality goes the other way;2)real stock returns are positive and around average in the periods leading up to and following the onset of deflation;3)when moving from low inflation to mild deflation,P/E ratios are virtually unchanged;and 4)peak P/E ratios seem to be reached at inflation rates close to zero.The author proposes three possible explanations for the seemingly disconnect between the empirical data and the“default”ex ante belief of most economists and investors:availability heurist,deflation illusion,and tax related issues in connection with the tax hypothesis. 展开更多
关键词 DEFLATION stock prices price-to-earnings ratio availability HEURISTIC DEFLATION ILLUSION TAX HYPOTHESIS
在线阅读 下载PDF
Heuristic Computing Methods for Contact Plan Design in the Spatial-Node-Based Internet of Everything 预览
9
作者 Cuiqin Dai Qingyang Song 《中国通信:英文版》 SCIE CSCD 2019年第3期53-68,共16页
To satisfy the increasing demands of high-speed transmission,high-efficiency computing,and real-time communications in the high-dynamic and heterogeneous networks,the Contact Plan Design(CPD)has attracted continuous a... To satisfy the increasing demands of high-speed transmission,high-efficiency computing,and real-time communications in the high-dynamic and heterogeneous networks,the Contact Plan Design(CPD)has attracted continuous attention in recent years,especially for the spatial-node-based Internet of Everything(IoE).In this paper,we study the NP-hardness of contact scheduling and the attenuation of atmospheric precipitation in the spatial-node-based IoE.Two heuristic computing methods for contact plan design are proposed by comprehensively considering the time-varying topology,the intermittent connectivity,and the adaptive transmission in different weather conditions,which are named Contact Plan Design-Particle Swarm Optimization(CPD-PSO)and Contact Plan Design-Greedy algorithm with the Minimum Delivery Time(CPD-GMDT)separately.For the population-based algorithm,CPD-PSO not only solves the CPD problem with a limited-resource condition,but also dynamically adjusts the search scope to ensure the continuous searching capability of the algorithm.For the CPD-GMDT that makes CP decisions based on the current state,the algorithm uses the idea of greedy algorithm to schedule Satellite-Platform Links(SPLs)and Inter Satellite Links(ISLs)respectively using the strategies of optimal matching and load balancing.The simulation results show that the proposed CPD-PSO outperforms Contact Plan Design-Genetic Algorithm(CPD-GA)in terms of fitness and delivery time,and CPD-GMDT presents better overall delay than Fair Contact Plan(FCP). 展开更多
关键词 INTERNET of Everything HEURISTIC computing CONTACT plan design particle SWARM optimization GREEDY algorithms
在线阅读 下载PDF
An improved artificial bee colony algorithm with MaxTF heuristic rule for two-sided assembly line balancing problem
10
作者 Xiaokun DUAN Bo WU +2 位作者 Youmin HU Jie LIU Jing XIONG 《机械工程前沿:英文版》 CSCD 2019年第2期241-253,共13页
Two-sided assembly line is usually used for the assembly of large products such as cars,buses,and trucks.With the development of technical progress,the assembly line needs to be reconfigured and the cycle time of the ... Two-sided assembly line is usually used for the assembly of large products such as cars,buses,and trucks.With the development of technical progress,the assembly line needs to be reconfigured and the cycle time of the line should be optimized to satisfy the new assembly process.Two-sided assembly line balancing with the objective of minimizing the cycle time is called TALBP-2.This paper proposes an improved artificial bee colony(IABC)algorithm with the MaxTF heuristic rule.In the heuristic initialization process,the MaxTF rule defines a new task's priority weight.On the basis of priority weight,the assignment of tasks is reasonable and the quality of an initial solution is high.In the IABC algorithm,two neighborhood strategies are embedded to balance the exploitation and exploration abilities of the algorithm.The employed bees and onlooker bees produce neighboring solutions in different promising regions to accelerate the convergence rate.Furthermore,a well-designed random strategy of scout bees is developed to escape local optima.The experimental results demonstrate that the proposed MaxTF rule performs better than other heuristic rules,as it can find the best solution for all the 10 test cases.A comparison of the IABC algorithm and other algorithms proves the effectiveness of the proposed IABC algorithm.The results also denote that the IABC algorithm is efficient and stable in minimizing the cycle time for the TALBP-2,and it can find 20 new best solutions among 25 large-sized problem cases. 展开更多
关键词 two-sided assembly line balancing PROBLEM artificial BEE COLONY algorithm HEURISTIC RULES time BOUNDARY
异构计算环境下一种新型的多DAG任务调度算法 预览
11
作者 焦一鸣 周川 +1 位作者 郭健 崔玉伟 《计算机工程》 CAS CSCD 北大核心 2019年第7期1-5,共5页
随着计算机技术的发展与用户需求的不断提升,多有向无环图(DAG)共享一组异构计算资源的问题受到广泛的关注。但由于实际任务的复杂多变,多个DAG之间存在一定的差异,导致多DAG调度策略存在公平性问题。为此,提出一种改进的启发式公平调... 随着计算机技术的发展与用户需求的不断提升,多有向无环图(DAG)共享一组异构计算资源的问题受到广泛的关注。但由于实际任务的复杂多变,多个DAG之间存在一定的差异,导致多DAG调度策略存在公平性问题。为此,提出一种改进的启发式公平调度算法IFairness。在选择待调度DAG阶段采用一种新的评判指标DAG完成度,代替原Fairness算法中的剩余 Makespan 作为DAG选择依据,在计算每个DAG的滞后程度阶段,采用“向后看”一步的原则,解决某些DAG在初期得不到调度的问题。仿真结果表明,与原Fairness算法相比,IFairness算法不公平程度降低了7.28 %,资源利用率提升了11.97 %,有效提高了调度算法的公平性及资源利用率。 展开更多
关键词 多有向无环图 公平性 启发式 完成度 资源利用率
在线阅读 下载PDF
"启发式"教学查房在心血管疾病教学中的应用效果评价
12
作者 马丽娟 李发鹏 +1 位作者 彭巧君 李英 《中华医学教育探索杂志》 2019年第6期614-619,共6页
目的将"启发式"教学查房应用于心血管内科疾病教学中,观察其应用效果。方法于2017年1至3月将新疆医科大学第一附属医院内科基地住培医师56名,随机分为试验组和对照组,每组28名,试验组主要采取"启发式"教学查房,对... 目的将"启发式"教学查房应用于心血管内科疾病教学中,观察其应用效果。方法于2017年1至3月将新疆医科大学第一附属医院内科基地住培医师56名,随机分为试验组和对照组,每组28名,试验组主要采取"启发式"教学查房,对照组主要采取传统教学查房。应用访谈法对两组指导教师、住培医师、上级医生、护理人员针对教学查房的准备、实施过程、预期达到的目标及效果分别进行访谈;56名住培医师对指导教师的准备、指导过程、指导方法、查房效果进行满意度评价;采用SPSS 19.0进行统计分析,各项评价结果采用秩和检验。结果试验组住培医师在指导教师对病情的熟悉程度(82.15% vs. 30.86%)、指导培训对象人文关怀(92.86% vs. 39.29%)、查体(96.43% vs. 28.57%)、分析辅助检查(85.71% vs. 35.71%)、书写病历(85.72% vs. 14.29%)、总结病例特点(78.57% vs. 35.71%)、诊断及鉴别诊断(85.71% vs. 21.43%)、作出诊疗计划(85.71% vs. 25.00%)、提问方式(89.29% vs. 30.72%)、讲解疑难问题和新进展(78.57% vs. 17.86%)、小结学习内容(92.85% vs. 28.58%)方面的满意度明显高于对照组;试验组住培医师在教学查房对沟通(96.43% vs. 46.43%)、病史采集技巧(85.72% vs. 21.43%)、检查手法(92.86% vs. 28.57%)、临床思维(92.86% vs. 28.57%)、学习兴趣(96.43% vs. 25.00%)和效率(85.71% vs. 14.28%)、知识的理解和记忆(85.72% vs. 28.57%)、分析解决问题的能力(89.29% vs. 21.43%)、团队协作能力(67.86% vs. 28.57%)提高方面的满意度明显高于对照组(P<0.05)。结论"启发式"教学查房重视课前准备、课后小结,注重住培医师主动参与,融入人文关怀与沟通技巧,重视团队协作,可充分发挥住培医师能动性,保证高效学习。 展开更多
关键词 启发式 教学查房 住培医师
钢琴面板螺钉错漏智能视觉检测方法研究 预览
13
作者 董元发 袁庆松 +1 位作者 查靓 吴正佳 《机械设计与制造》 北大核心 2019年第4期73-77,共5页
表观质量对产品的用户体验影响很大,钢琴面板作为用户使用过程中接触最频繁的区域,其铰链区域螺钉装配质量的好坏直接影响用户对产品的认知。针对钢琴面板手工装配过程成像条件差、产品变更频繁等特点导致现有视觉检测算法鲁棒性较低的... 表观质量对产品的用户体验影响很大,钢琴面板作为用户使用过程中接触最频繁的区域,其铰链区域螺钉装配质量的好坏直接影响用户对产品的认知。针对钢琴面板手工装配过程成像条件差、产品变更频繁等特点导致现有视觉检测算法鲁棒性较低的问题,构建了钢琴面板手工装配质量智能视觉检测系统框架,通过分析影响视觉检测算法鲁棒性的因素建立了P-AHL视觉检测空间模型及参数自适应修正方法,采用区域相关哈希编码表征螺钉装配特征提出了启发式哈希匹配算法,开发了钢琴面板装配质量机器视觉检测系统。在某钢琴制造企业的实际应用表明所提方法在手工装配作业复杂成像条件下具有较好的鲁棒性和抗干扰能力。 展开更多
关键词 钢琴装配 手工装配 表观质量 机器视觉 启发式 哈希检索
在线阅读 下载PDF
Heterogeneous pigeon-inspired optimization
14
作者 Hao WANG Zhuxi ZHANG +4 位作者 Zhen DAI Jun CHEN Xi ZHU Wenbo DU Xianbin CAO 《中国科学:信息科学(英文版)》 SCIE EI CSCD 2019年第7期64-72,共9页
Pigeon-inspired optimization(PIO) is a swarm intelligence optimizer inspired by the homing behavior of pigeons. PIO consists of two optimization stages which employ the map and compass operator,and the landmark operat... Pigeon-inspired optimization(PIO) is a swarm intelligence optimizer inspired by the homing behavior of pigeons. PIO consists of two optimization stages which employ the map and compass operator,and the landmark operator, respectively. In canonical PIO, these two operators treat every bird equally,which deviates from the fact that birds usually act heterogenous roles in nature. In this paper, we propose a new variant of PIO algorithm considering bird heterogeneity — HPIO. Both of the two operators are improved through dividing the birds into hub and non-hub roles. By dividing the birds into two groups, these two groups of birds are respectively assigned with different functions of 'exploitation' and 'exploration', so that they can closely interact with each other to locate the best promising solution. Extensive experimental studies illustrate that the bird heterogeneity produced by our algorithm can benefit the information exchange between birds so that the proposed PIO variant significantly outperforms the canonical PIO. 展开更多
关键词 heuristic OPTIMIZATION pigeon-inspired OPTIMIZATION particle heterogeneity network-based topology SCALE-FREE network selective-informed learning
一类多商品设施选址问题的基于线性松弛解的启发式方法 预览
15
作者 杨沐明 黄亚魁 戴彧虹 《运筹学学报》 北大核心 2019年第3期15-26,共12页
多商品设施选址问题是众多设施选址问题中一类重要而困难的问题.在这一问题中,顾客的需求可能包含不止一种商品.对于大规模问题,成熟的商业求解器往往不能在满意的时间内找到高质量的可行解.研究了无容量限制的单货源多商品设施选址问... 多商品设施选址问题是众多设施选址问题中一类重要而困难的问题.在这一问题中,顾客的需求可能包含不止一种商品.对于大规模问题,成熟的商业求解器往往不能在满意的时间内找到高质量的可行解.研究了无容量限制的单货源多商品设施选址问题的一般形式,并给出了应用于此类问题的两个启发式方法.这两个方法基于原选址问题的线性规划松弛问题的最优解,分别通过求解紧问题和邻域搜索的方式给出了原问题的一个可行上界.理论分析指出所提方法可以实施于任意可行问题的实例.数值结果表明所提方法可以显著地提高求解器求解此类设施选址问题的求解效率. 展开更多
关键词 多商品设施选址问题 启发式 线性规划 整数规划 紧问题 邻域搜索
在线阅读 下载PDF
立法背景资料在法律解释中的功能与地位——英美的司法实践及其对中国的镜鉴
16
作者 王云清 《法学家》 CSSCI 北大核心 2019年第1期72-86,192-193共16页
考察英美法的司法实践,可以发现立法背景资料经历了从不被接受到被接受再到限制适用等阶段。作为一种发生学论据,立法背景资料和文义解释、体系解释、意图解释和目的解释等具体解释方法存在着密切的关系。为了从立法背景资料中获致可靠... 考察英美法的司法实践,可以发现立法背景资料经历了从不被接受到被接受再到限制适用等阶段。作为一种发生学论据,立法背景资料和文义解释、体系解释、意图解释和目的解释等具体解释方法存在着密切的关系。为了从立法背景资料中获致可靠、妥当的解释结论,法官应该综合考量效力位阶、证据属性、文义优先原则、制定法的存续期间等因素。囿于意图缺失和出释入造、司法误判、选择性偏差等问题,这些资料宜作为法院确定系争词语之含义的出发点而非终点。中国的司法实践已经形成了一些经验性做法,但依然存在解释功能单一且偏重语义直觉、综合模式未成形且存在选择性偏见、忽视价值选择且误判裁量空间等问题,有待予以改进。 展开更多
关键词 立法背景资料 立法后背景资料 法律解释 立法原意 认知启发式
An Emergency Blood Allocation Approach Considering Blood Group Compatibility in Disaster Relief Operations
17
作者 Zu-Jun Ma Ke-Ming Wang Ying Dai 《国际灾害风险科学学报:英文版》 CSCD 2019年第1期74-88,共15页
Large-scale sudden-onset disasters may cause massive injuries and thus place great pressure on the emergency blood supplies of local blood banks. When blood is in short supply, blood products gathered urgently to a lo... Large-scale sudden-onset disasters may cause massive injuries and thus place great pressure on the emergency blood supplies of local blood banks. When blood is in short supply, blood products gathered urgently to a local blood center should be appropriately allocated to blood banks in the affected area. Moreover, ABO/Rh(D) compatibilities among blood groups must be considered during emergency situations. To minimize the total unmet demand of blood products considering the optimal ABO/Rh(D)-compatible blood substitution scheme, a mixed integer programming model is developed and solved efficiently by using a greedy heuristic algorithm. Finally, a numerical example derived from the emergency blood supply scenario of the Wenchuan Earthquake is presented to verify the proposed model and algorithm. The results show that considering ABO/Rh(D)-compatible blood substitution can remarkably increase the efficiency of emergency blood allocation while lowering blood shortage, and the preference order of possible ABO/Rh(D)-compatible substitutions has an influence on the allocation solution. 展开更多
关键词 BLOOD group compatibility BLOOD substitution Disaster RELIEF EMERGENCY BLOOD ALLOCATION GREEDY HEURISTIC algorithm
基于启发式动态规划的自动化停车场调度方法 预览
18
作者 禹鑫燚 卢靓 +1 位作者 朱熠琛 欧林林 《高技术通讯》 CAS 北大核心 2019年第4期352-361,共10页
为了降低自动化停车场中产生的能耗、车辆等待时间等代价,本文提出基于启发式动态规划的自动化停车场调度方法。该方法分别对车辆的质量和停放时间构造归一化函数,用于评价车辆与库位的匹配度,以实现对停车场中库位的整体规划。针对停... 为了降低自动化停车场中产生的能耗、车辆等待时间等代价,本文提出基于启发式动态规划的自动化停车场调度方法。该方法分别对车辆的质量和停放时间构造归一化函数,用于评价车辆与库位的匹配度,以实现对停车场中库位的整体规划。针对停车场中停放车辆不饱和的问题,提出基于贪心算法的动态调整策略。该策略通过库位划分与状态反馈,动态调整评价函数的计算结果,从而进一步优化了对库位的整体规划。实验将贪心算法与以质量、停放时间以及两者组合作为决策函数的算法相比较。结果表明,本文提出的启发式动态规划算法能够实时决策,适应进车速率波动较大的情况,同时降低整个停放过程产生的代价。 展开更多
关键词 车辆路径 启发式 动态规划 实时决策 自动化
在线阅读 下载PDF
A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows
19
作者 Bohong Wang Yongtu Liang +2 位作者 Meng Yuan Haoran Zhang Qi Liao 《石油科学:英文版》 SCIE CAS CSCD 2019年第3期701-712,共12页
The petrol truck routing problem is an important part of the petrol supply chain.This study focuses on determining routes for distributing petrol products from a depot to petrol stations with the objective of minimizi... The petrol truck routing problem is an important part of the petrol supply chain.This study focuses on determining routes for distributing petrol products from a depot to petrol stations with the objective of minimizing the total travel cost and the fixed cost required to use the trucks.We propose a mathematical model that considers petrol trucks returning to a depot multiple times and develop a heuristic algorithm based on a local branch-and-bound search with a tabu list and the Metropolis acceptance criterion.In addition,an approach that accelerates the solution process by adding several valid inequalities is presented.In this study,the trucks are homogeneous and have two compartments,and each truck can execute at most three tasks daily.The sales company arranges the transfer amount and the time windows for each station.The performance of the proposed algorithm is evaluated by comparing its results with the optimal results.In addition,a real-world case of routing petrol trucks in Beijing is studied to demonstrate the effectiveness of the proposed approach. 展开更多
关键词 PETROL TRUCK routing problem HEURISTIC algorithm VALID INEQUALITIES Time windows
A Novel Improved Bird Swarm Algorithm for Solving Bound Constrained Optimization Problems
20
作者 WANG Yuhe WAN Zhongping PENG Zhenhua 《武汉大学学报:自然科学英文版》 CAS CSCD 2019年第4期349-359,共11页
Bird swarm algorithm(BSA), a novel bio-inspired algorithm, has good performance in solving numerical optimization problems. In this paper, a new improved bird swarm algorithm is conducted to solve unconstrained optimi... Bird swarm algorithm(BSA), a novel bio-inspired algorithm, has good performance in solving numerical optimization problems. In this paper, a new improved bird swarm algorithm is conducted to solve unconstrained optimization problems. To enhance the performance of BSA, handling boundary constraints are applied to fix the candidate solutions that are out of boundary or on the boundary in iterations, which can boost the diversity of the swarm to avoid the premature problem. On the other hand, we accelerate the foraging behavior by adjusting the cognitive and social components the sin cosine coefficients. Simulation results and comparison based on sixty benchmark functions demonstrate that the improved BSA has superior performance over the BSA in terms of almost all functions. 展开更多
关键词 IMPROVED BIRD SWARM ALGORITHM handling boundary constraints FORAGING behavior HEURISTIC ALGORITHM
上一页 1 2 250 下一页 到第
使用帮助 返回顶部 意见反馈