期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到3,465篇文章
< 1 2 … 174 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Research on heuristic approximation algorithm of the densest k-subgraph discovery in large-scale dynamic graphs 认领 引用
1
作者 HAN Tao TIAN Yuxi +1 位作者 ZHAO Jianwei WANG Senzhang 《Journal of Southeast University(English Edition)》 EI CAS 2026年第1期74-79,共6页
To address the issue that static densest subgraph mining algorithms often exhibit low efficiency when handling large scale dynamic graphs,this paper proposes a heuristic approximation algorithm.The algorithm approxima... To address the issue that static densest subgraph mining algorithms often exhibit low efficiency when handling large scale dynamic graphs,this paper proposes a heuristic approximation algorithm.The algorithm approximates the densest k-subgraphs of the entire graph through four steps:partitioning the large-scale dynamic graph,constructing a partial set of the densest k-subgraphs,heuristically merging the subgraph sets,and finally extracting the densest k-subgraphs.This approach significantly reduces the computational time for large-scale dynamic graphs while simultaneously improving the quality of the resulting subgraphs.This algorithm is applicable to various definitions of“density”and can accommodate diverse requirements on the number of edges.When integrated with existing static densest subgraph detection algorithms,it achieves scalability and computational efficiency.Theoretical analysis demonstrates that the optimal density of the densest k-subgraphs extracted by the proposed algorithm reaches 0.9.To evaluate the performance of the algorithm,experiments were conducted on four billion-scale datasets:Friendster,Orkut,YouTube,and DBLP.The results indicate that the proposed algorithm outperforms static methods in both runtime efficiency and subgraph quality on large-scale dynamic graphs. 展开更多
关键词 the densest k-subgraph features heuristic approximation algorithm optimal density
暂未订购 下载PDF
A novel heuristic pathfinding algorithm for 3D security modeling and vulnerability assessment 认领 引用 被引量：1
2
作者 Jun Yang Yue-Ming Hong +2 位作者 Yu-Ming Lv Hao-Ming Ma Wen-Lin Wang 《Nuclear Science and Techniques》 SCIE EI CAS CSCD 2025年第5期152-166,共15页
Vulnerability assessment is a systematic process to identify security gaps in the design and evaluation of physical protection systems.Adversarial path planning is a widely used method for identifying potential vulner... Vulnerability assessment is a systematic process to identify security gaps in the design and evaluation of physical protection systems.Adversarial path planning is a widely used method for identifying potential vulnerabilities and threats to the security and resilience of critical infrastructures.However,achieving efficient path optimization in complex large-scale three-dimensional(3D)scenes remains a significant challenge for vulnerability assessment.This paper introduces a novel A*-algorithmic framework for 3D security modeling and vulnerability assessment.Within this framework,the 3D facility models were first developed in 3ds Max and then incorporated into Unity for A*heuristic pathfinding.The A*-heuristic pathfinding algorithm was implemented with a geometric probability model to refine the detection and distance fields and achieve a rational approximation of the cost to reach the goal.An admissible heuristic is ensured by incorporating the minimum probability of detection(PDmin)and diagonal distance to estimate the heuristic function.The 3D A*heuristic search was demonstrated using a hypothetical laboratory facility,where a comparison was also carried out between the A*and Dijkstra algorithms for optimal path identification.Comparative results indicate that the proposed A*-heuristic algorithm effectively identifies the most vulnerable adversarial pathfinding with high efficiency.Finally,the paper discusses hidden phenomena and open issues in efficient 3D pathfinding for security applications. 展开更多
关键词 Physical protection system 3D modeling and simulation Vulnerability assessment A*Heuristic Pathfinding Dijkstra algorithm
暂未订购 下载PDF
Unveiling Effective Heuristic Strategies: A Review of Cross-Domain Heuristic Search Challenge Algorithms 认领 引用
3
作者 Mohamad Khairulamirin Md Razali MasriAyob +5 位作者 Abdul Hadi Abd Rahman Razman Jarmin Chian Yong Liu Muhammad Maaya Azarinah Izaham Graham Kendall 《Computer Modeling in Engineering & Sciences》 SCIE EI 2025年第2期1233-1288,共56页
The Cross-domain Heuristic Search Challenge(CHeSC)is a competition focused on creating efficient search algorithms adaptable to diverse problem domains.Selection hyper-heuristics are a class of algorithms that dynamic... The Cross-domain Heuristic Search Challenge(CHeSC)is a competition focused on creating efficient search algorithms adaptable to diverse problem domains.Selection hyper-heuristics are a class of algorithms that dynamically choose heuristics during the search process.Numerous selection hyper-heuristics have different imple-mentation strategies.However,comparisons between them are lacking in the literature,and previous works have not highlighted the beneficial and detrimental implementation methods of different components.The question is how to effectively employ them to produce an efficient search heuristic.Furthermore,the algorithms that competed in the inaugural CHeSC have not been collectively reviewed.This work conducts a review analysis of the top twenty competitors from this competition to identify effective and ineffective strategies influencing algorithmic performance.A summary of the main characteristics and classification of the algorithms is presented.The analysis underlines efficient and inefficient methods in eight key components,including search points,search phases,heuristic selection,move acceptance,feedback,Tabu mechanism,restart mechanism,and low-level heuristic parameter control.This review analyzes the components referencing the competition’s final leaderboard and discusses future research directions for these components.The effective approaches,identified as having the highest quality index,are mixed search point,iterated search phases,relay hybridization selection,threshold acceptance,mixed learning,Tabu heuristics,stochastic restart,and dynamic parameters.Findings are also compared with recent trends in hyper-heuristics.This work enhances the understanding of selection hyper-heuristics,offering valuable insights for researchers and practitioners aiming to develop effective search algorithms for diverse problem domains. 展开更多
关键词 Hyper-heuristics search algorithms optimization heuristic selection move acceptance learning diversification parameter control
暂未订购 下载PDF
Patterns in Heuristic Optimization Algorithms: A Comprehensive Analysis 认领 引用
4
作者 Robertas Damasevicius 《Computers, Materials & Continua》 SCIE EI 2025年第2期1493-1538,共46页
Heuristic optimization algorithms have been widely used in solving complex optimization problems in various fields such as engineering,economics,and computer science.These algorithms are designed to find high-quality ... Heuristic optimization algorithms have been widely used in solving complex optimization problems in various fields such as engineering,economics,and computer science.These algorithms are designed to find high-quality solutions efficiently by balancing exploration of the search space and exploitation of promising solutions.While heuristic optimization algorithms vary in their specific details,they often exhibit common patterns that are essential to their effectiveness.This paper aims to analyze and explore common patterns in heuristic optimization algorithms.Through a comprehensive review of the literature,we identify the patterns that are commonly observed in these algorithms,including initialization,local search,diversity maintenance,adaptation,and stochasticity.For each pattern,we describe the motivation behind it,its implementation,and its impact on the search process.To demonstrate the utility of our analysis,we identify these patterns in multiple heuristic optimization algorithms.For each case study,we analyze how the patterns are implemented in the algorithm and how they contribute to its performance.Through these case studies,we show how our analysis can be used to understand the behavior of heuristic optimization algorithms and guide the design of new algorithms.Our analysis reveals that patterns in heuristic optimization algorithms are essential to their effectiveness.By understanding and incorporating these patterns into the design of new algorithms,researchers can develop more efficient and effective optimization algorithms. 展开更多
关键词 Heuristic optimization algorithms design patterns initialization local search diversity maintenance adaptation stochasticity exploration exploitation search space metaheuristics
暂未订购 下载PDF
A Heuristic Mutation Based Genetic Algorithm for Fast Parallel Scheduling of Steel Cold Rolling 认领 引用
5
作者 Hairong Yang Yangyi Du +2 位作者 Yonggang Li Weidong Qian Bing Hu 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2025年第6期227-237,共11页
A well-designed production schedule for cold rolling can enhance steel enterprises'operational efficiency and profitability.Nevertheless,the intricate constraints and numerous steps involved in cold rolling pose c... A well-designed production schedule for cold rolling can enhance steel enterprises'operational efficiency and profitability.Nevertheless,the intricate constraints and numerous steps involved in cold rolling pose challenges to devising a rational scheduling plan.Therefore,considering the practical production constraints,this paper investigates a cold rolling scheduling problem for processing jobs with specific due dates and batch attributions on parallel heterogeneous machines with continuous production requirements.Firstly,the scheduling problem is formulated as a mixed integer linear program(MILP)model with an economic objective.Then,a modified genetic algorithm(GA)is proposed to search for the optimal solution to the MILP problem.Specifically,this method includes a heuristic initialization mechanism to generate feasible initial solutions,three heuristic mutation operators to generate promising candidate solutions,and a parallel computing mechanism to accelerate the evaluation process of the GA.The simulation results demonstrate that the proposed method can be effectively implemented to generate optimized scheduling schemes in the cold rolling process. 展开更多
关键词 Steel cold rolling Job shop scheduling Genetic algorithm Heuristic mutation Parallel computation
暂未订购 下载PDF
A Novel Heuristic Algorithm for theModeling and Risk Assessment of the COVID-19 Pandemic Phenomenon 认领 引用 被引量：8
6
作者 Panagiotis G.Asteris Maria G.Douvika +6 位作者 Chrysoula A.Karamani Athanasia D.Skentou Katerina Chlichlia Liborio Cavaleri Tryfon Daras Danial J.Armaghani Theoklis E.Zaoutis 《Computer Modeling in Engineering & Sciences》 SCIE EI 2020年第11期815-828,共14页
Themodeling and risk assessment of a pandemic phenomenon such as COVID-19 is an important and complicated issue in epidemiology,and such an attempt is of great interest for public health decision-making.To this end,in... Themodeling and risk assessment of a pandemic phenomenon such as COVID-19 is an important and complicated issue in epidemiology,and such an attempt is of great interest for public health decision-making.To this end,in the present study,based on a recent heuristic algorithm proposed by the authors,the time evolution of COVID-19 is investigated for six different countries/states,namely New York,California,USA,Iran,Sweden and UK.The number of COVID-19-related deaths is used to develop the proposed heuristic model as it is believed that the predicted number of daily deaths in each country/state includes information about the quality of the health system in each area,the age distribution of population,geographical and environmental factors as well as other conditions.Based on derived predicted epidemic curves,a new 3D-epidemic surface is proposed to assess the epidemic phenomenon at any time of its evolution.This research highlights the potential of the proposed model as a tool which can assist in the risk assessment of the COVID-19.Mapping its development through 3D-epidemic surface can assist in revealing its dynamic nature as well as differences and similarities among different districts. 展开更多
关键词 Algorithm COVID-19 Gaussian-function heuristic model pandemic trend prediction SARS-CoV-2
暂未订购 下载PDF
HEURISTIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR AIR COMBAT DECISION-MAKING ON CMTA 认领 引用 被引量：27
7
作者 罗德林 杨忠 +2 位作者 段海滨 吴在桂 沈春林 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2006年第1期20-26,共7页
Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm opt... Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem. 展开更多
关键词 air combat decision-making cooperative multiple target attack particle swarm optimization heuristic algorithm
暂未订购 下载PDF
Data-Driven Heuristic Assisted Memetic Algorithm for Efficient Inter-Satellite Link Scheduling in the BeiDou Navigation Satellite System 认领 引用 被引量：13
8
作者 Yonghao Du Ling Wang +2 位作者 Lining Xing Jungang Yan Mengsi Cai 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2021年第11期1800-1816,共17页
Inter-satellite link(ISL)scheduling is required by the BeiDou Navigation Satellite System(BDS)to guarantee the system ranging and communication performance.In the BDS,a great number of ISL scheduling instances must be... Inter-satellite link(ISL)scheduling is required by the BeiDou Navigation Satellite System(BDS)to guarantee the system ranging and communication performance.In the BDS,a great number of ISL scheduling instances must be addressed every day,which will certainly spend a lot of time via normal metaheuristics and hardly meet the quick-response requirements that often occur in real-world applications.To address the dual requirements of normal and quick-response ISL schedulings,a data-driven heuristic assisted memetic algorithm(DHMA)is proposed in this paper,which includes a high-performance memetic algorithm(MA)and a data-driven heuristic.In normal situations,the high-performance MA that hybridizes parallelism,competition,and evolution strategies is performed for high-quality ISL scheduling solutions over time.When in quick-response situations,the data-driven heuristic is performed to quickly schedule high-probability ISLs according to a prediction model,which is trained from the high-quality MA solutions.The main idea of the DHMA is to address normal and quick-response schedulings separately,while high-quality normal scheduling data are trained for quick-response use.In addition,this paper also presents an easy-to-understand ISL scheduling model and its NP-completeness.A seven-day experimental study with 10080 one-minute ISL scheduling instances shows the efficient performance of the DHMA in addressing the ISL scheduling in normal(in 84 hours)and quick-response(in 0.62 hour)situations,which can well meet the dual scheduling requirements in real-world BDS applications. 展开更多
关键词 BeiDou Navigation Satellite System(BDS) data-driven heuristic inter-satellite link(ISL)scheduling memetic algorithm metaheuristic quick-response
暂未订购 下载PDF
A Heuristic Algorithm for the Fabric Spreading and Cutting Problem in Apparel Factories 认领 引用 被引量：4
9
作者 Xiuqin Shang Dayong Shen +1 位作者 Fei-Yue Wang Timo R. Nyberg 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2019年第4期961-968,共8页
We study the fabric spreading and cutting problem in apparel factories.For the sake of saving the material costs,the cutting requirement should be met exactly without producing additional garment components.For reduci... We study the fabric spreading and cutting problem in apparel factories.For the sake of saving the material costs,the cutting requirement should be met exactly without producing additional garment components.For reducing the production costs,the number of lays that corresponds to the frequency of using the cutting beds should be minimized.We propose an iterated greedy algorithm for solving the fabric spreading and cutting problem.This algorithm contains a constructive procedure and an improving loop.Firstly the constructive procedure creates a set of lays in sequence,and then the improving loop tries to pick each lay from the lay set and rearrange the remaining lays into a smaller lay set.The improving loop will run until it cannot obtain any smaller lay set or the time limit is due.The experiment results on 500 cases show that the proposed algorithm is effective and efficient. 展开更多
关键词 Construction and improvement cutting and packing fabric spreading and cutting heuristic algorithm
暂未订购 下载PDF
An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem 认领 引用 被引量：4
10
作者 ZHANG De-Fu CHEN Sheng-Da LIU Yan-Juan 《自动化学报》 EI CAS 北大核心 2007年第9期911-916,共6页
An improved heuristic recursive strategy combining with genetic algorithm is presented in this paper.Firstly,this method searches some rectangles,which have the same length or width,to form some layers without waste s... An improved heuristic recursive strategy combining with genetic algorithm is presented in this paper.Firstly,this method searches some rectangles,which have the same length or width,to form some layers without waste space,then it uses the heuristic recursive strategies to calculate the height of the remaining packing order and uses the evolutionary capability of genetic algorithm to reduce the height.The computational results on several classes of benchmark problems have shown that the presented algorithm can compete with known evolutionary heuristics.It performs better especially for large test problems. 展开更多
关键词 Strip packing problems heuristic recursive genetic algorithm
暂未订购 下载PDF
Heuristic algorithm based on the principle of minimum total potential energy(HAPE):a new algorithm for nesting problems 认领 引用 被引量：7
11
作者 Xiao LIU Jia-wei YE 《Journal of Zhejiang University-SCIENCE A》 SCIE EI CAS CSCD 2011年第11期860-872,共13页
We present a new algorithm for nesting problems.Many equally spaced points are set on a sheet,and a piece is moved to one of the points and rotated by an angle.Both the point and the rotation angle constitute the pack... We present a new algorithm for nesting problems.Many equally spaced points are set on a sheet,and a piece is moved to one of the points and rotated by an angle.Both the point and the rotation angle constitute the packing attitude of the piece.We propose a new algorithm named HAPE(Heuristic Algorithm based on the principle of minimum total Potential Energy) to find the optimal packing attitude at which the piece has the lowest center of gravity.In addition,a new technique for polygon overlap testing is proposed which avoids the time-consuming calculation of no-fit-polygon(NFP).The detailed implementation of HAPE is presented and two computational experiments are described.The first experiment is based on a real industrial problem and the second on 11 published benchmark problems.Using a hill-climbing(HC) search method,the proposed algorithm performs well in comparison with other published solutions. 展开更多
关键词 Packing Cutting Nesting Irregular Heuristic algorithm Minimum total potential energy
暂未订购 下载PDF
A game theoretic model and a double oracle algorithm for the heterogeneous weapon target assignment problem 认领 引用
12
作者 MA Yingying LUO He +2 位作者 WANG Guoqiang ZHU Waiming HU Xiaoxuan 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2026年第2期548-566,共19页
Weapon target assignment(WTA)problem is a critical problem in multiplatform confrontation.This paper studies a static WTA problem with heterogeneous weapons in multi-platform air combat scenarios,called heterogeneous ... Weapon target assignment(WTA)problem is a critical problem in multiplatform confrontation.This paper studies a static WTA problem with heterogeneous weapons in multi-platform air combat scenarios,called heterogeneous WTA(HWTA)problem.Heterogeneous indicates that the engagement platforms carry multiple kinds of weapons for different tactical purposes.The targets assigned and the weapons used by one side’s platforms will affect the survival probability and capability of the other side’s platforms.The goal of each side in HWTA is to find a solution to determine the kind of weapon used and the target assigned for each platform,so as to maximize their combat effectiveness.The problem is formulated as a two-player noncooperative game model with considering the conflicts between the engaged sides.The Nash equilibrium is an effective solution to the game in which no player has an incentive to deviate.However,the number of pure strategies in HWTA increases exponentially with the engagement platforms.To improve computing efficiency,a double oracle algorithm with constructive heuristic(DOCH)is developed,within which the constructive heuristic is embedded to solve the oracle subproblems efficiently.Numerical experiments are conducted to verify the effectiveness of the DOCH.The results show that the DOCH can find effective strategies for platforms to improve combat effectiveness.Moreover,the DOCH can find high-quality solutions in seconds,significantly outperforming the state-of-the-art algorithms in terms of computational efficiency,especially for large-scale problems. 展开更多
关键词 weapon target assignment noncooperative game double oracle algorithm constructive heuristic
暂未订购 下载PDF
Analysis of Petri net model and task planning heuristic algorithms for product reconfiguration 认领 引用 被引量：1
13
作者 林春深 Tang Xiaoqiang Duan Guanghong 《High Technology Letters》 EI CAS 2007年第3期254-260,共7页
Reconfiguration planning is recognized as an important factor for reducing the cost of manufacturing reconfigurable products, and the associated main task is to generate a set of optimal or near-optimal reconfiguratio... Reconfiguration planning is recognized as an important factor for reducing the cost of manufacturing reconfigurable products, and the associated main task is to generate a set of optimal or near-optimal reconfiguration sequences using some effect algorithms. A method is developed to generate a Petri net as the reconfiguration tree to represent two-state-transit of product, which solved the representation problem of reconfiguring interfaces replacement. Relating with this method, two heuristic algorithms are proposed to generate task sequences which considering economics to search reconfiguration paths effectively. At last, an objective evaluation is applied to compare these two heuristic algorithms to other ones. The developed reconfiguration task planning heuristic algorithms can generate better strategies and plans for reconfiguration. The research finds are exemplified with struts reconfiguration of reconfigurable parallel kinematics machine （RPKM）. 展开更多
关键词 heuristic algorithms reconfiguration planning Petri net parallel kinematics machines
暂未订购 下载PDF
High speed ghost imaging based on a heuristic algorithm and deep learning 认领 引用
14
作者 Yi-Yi Huang Chen Ou-Yang +4 位作者 Ke Fang Yu-Feng Dong Jie Zhang Li-Ming Chen Ling-An Wu 《Chinese Physics B》 SCIE EI CAS CSCD 2021年第6期287-293,共7页
We report an overlapping sampling scheme to accelerate computational ghost imaging for imaging moving targets,based on reordering a set of Hadamard modulation matrices by means of a heuristic algorithm. The new conden... We report an overlapping sampling scheme to accelerate computational ghost imaging for imaging moving targets,based on reordering a set of Hadamard modulation matrices by means of a heuristic algorithm. The new condensed overlapped matrices are then designed to shorten and optimize encoding of the overlapped patterns, which are shown to be much superior to the random matrices. In addition, we apply deep learning to image the target, and use the signal acquired by the bucket detector and corresponding real image to train the neural network. Detailed comparisons show that our new method can improve the imaging speed by as much as an order of magnitude, and improve the image quality as well. 展开更多
关键词 high speed computational ghost imaging heuristic algorithm deep learning
暂未订购 下载PDF
Damage Identification of A TLP Floating Wind Turbine by Meta-Heuristic Algorithms 认领 引用 被引量：4
15
作者 M.M.Ettefagh 《China Ocean Engineering》 SCIE EI CSCD 2015年第6期891-902,共12页
Damage identification of the offshore floating wind turbine by vibration/dynamic signals is one of the important and new research fields in the Structural Health Monitoring（SHM）. In this paper a new damage identific... Damage identification of the offshore floating wind turbine by vibration/dynamic signals is one of the important and new research fields in the Structural Health Monitoring（SHM）. In this paper a new damage identification method is proposed based on meta-heuristic algorithms using the dynamic response of the TLP（Tension-Leg Platform） floating wind turbine structure. The Genetic Algorithms（GA）, Artificial Immune System（AIS）, Particle Swarm Optimization（PSO）, and Artificial Bee Colony（ABC） are chosen for minimizing the object function, defined properly for damage identification purpose. In addition to studying the capability of mentioned algorithms in correctly identifying the damage, the effect of the response type on the results of identification is studied. Also, the results of proposed damage identification are investigated with considering possible uncertainties of the structure. Finally, for evaluating the proposed method in real condition, a 1/100 scaled experimental setup of TLP Floating Wind Turbine（TLPFWT） is provided in a laboratory scale and the proposed damage identification method is applied to the scaled turbine. 展开更多
关键词 floating wind turbine multi-body dynamics damage identification meta-heuristic algorithms optimization
暂未订购 下载PDF
Heuristics Scheduling Algorithm on the Links Scheduling of Satellite-Ground Clock Synchronization and Ephemeris Uploading in COMPASS System 认领 引用
16
作者 张忠山 闫俊刚 +1 位作者 谭跃进 王沛 《Journal of Donghua University(English Edition)》 CAS 2016年第3期462-466,共5页
The execution process of satellite-ground clock synchronization and ephemeris uploading in the system is analyzed,as well as their characterized operation and their relationship.Based on the analysis of the scheduling... The execution process of satellite-ground clock synchronization and ephemeris uploading in the system is analyzed,as well as their characterized operation and their relationship.Based on the analysis of the scheduling goal and constraint character,a heuristics rule-based multi-stage link scheduling algorithm was put forward.The algorithm distinguishes the on-off-frontier satellites from the others and schedules them by turns.The paper presented the main flow as well as the detailed design of the rule.Finally based on the current COMPASS global system,some typical resources and constraints are selected to generate an instance.Then the comparison analysis between the heuristics scheduling algorithm and three other traditional scheduling strategies are carried out.The result shows the validity and reasonability of the multi-stage strategy. 展开更多
关键词 heuristics algorithm COMPASS system crosslinks satelliteground clock synchronization and ephemeris uploading scheduling
暂未订购 下载PDF
Heuristic Quasi-physical Algorithm for Protein Structure Prediction 认领 引用
17
作者 刘景发 黄文奇 《Journal of Southwest Jiaotong University(English Edition)》 2006年第4期308-314,共7页
A three-dimensional off-lattice protein model with two species of monomers, hydrophobic and hydrophilic, is studied. Enligh- tened by the law of reciprocity among things in the physical world, a heuristic quasi-physic... A three-dimensional off-lattice protein model with two species of monomers, hydrophobic and hydrophilic, is studied. Enligh- tened by the law of reciprocity among things in the physical world, a heuristic quasi-physical algorithm for protein structure prediction problem is put forward. First, by elaborately simulating the movement of the smooth elastic balls in the physical world, the algorithm finds low energy configurations for a given monomer chain. An ＂off-trap＂ strategy is then proposed to get out of local minima. Experimental results show promising performance. For all chains with lengths 13≤n ≤55, the proposed algorithm finds states with lower energy than the putative ground states reported in literatures. Furthermore, for chain lengths n = 21, 34, and 55, the algorithm finds new low energy configurations different from those given in literatures. 展开更多
关键词 Protein structure prediction Three-dimensional protein model Quasi-physical algorithm Heuristics
暂未订购 下载PDF
Designing an optimal stope layout for underground mining based on a heuristic algorithm 认领 引用 被引量：4
18
作者 Sandanayake Don Suneth Sameera Topal Erkan Asad Mohammad Waqar Ali 《International Journal of Mining Science and Technology》 EI CAS CSCD 2015年第5期767-772,共6页
An optimal layout or three-dimensional spatial distribution of stopes guarantees the maximum profitability over life span of an underground mining operation.Thus,stope optimization is one of the key areas in undergrou... An optimal layout or three-dimensional spatial distribution of stopes guarantees the maximum profitability over life span of an underground mining operation.Thus,stope optimization is one of the key areas in underground mine planning practice.However,the computational complexity in developing an optimal stope layout has been a reason for limited availability of the algorithms offering solution to this problem.This article shares a new and efficient heuristic algorithm that considers a three-dimensional ore body model as an input,maximizes the economic value,and satisfies the physical mining and geotechnical constraints for generating an optimal stope layout.An implementation at a copper deposit demonstrates the applicability and robustness of the algorithm.A parallel processing based modification improving the performance of the original algorithm in terms of enormous computational time saving is also presented. 展开更多
关键词 Stope optimization Underground mining Underground mine planning Heuristic algorithm
暂未订购 下载PDF
Aheuristic Algorithm for Berth Scheduling Problem in Container Ports 认领 引用
19
作者 张海滨 《科技信息》 2011年第3期I0185-I0186,共2页
In this paper,the berth scheduling problem is transformed into a special two-dimensional packing problem with some constraints.A nonlinear programming model for the problem is established,and a heuristic algorithm is ... In this paper,the berth scheduling problem is transformed into a special two-dimensional packing problem with some constraints.A nonlinear programming model for the problem is established,and a heuristic algorithm is proposed to solve the model.Simulation results show that the algorithm can improve the utilization of berths on discrete berth scheduling in the container port. 展开更多
关键词 Berth scheduling Two-dimensional packing Heuristic algorithm
暂未订购 下载PDF
A Multi-stage Heuristic Algorithm for Matching Problem in the Modified Miniload Automated Storage and Retrieval System of E-commerce 认领 引用 被引量：2
20
作者 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 storageetrieval 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 storageetrieval system matching problem multi-stage heuristic algorithm
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 174 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈