检索结果-内蒙古大学图书馆

Optimization of chemical synthesis with heuristic algorithms

PHYSICAL CHEMISTRY CHEMICAL PHYSICS 2023年第5期25卷 4323-4331页

作者： Chen, Jialu Xu, Wenjun Zhang, Ruiqin City Univ Hong Kong Dept Phys Hong Kong Peoples R China Beijing Computat Sci Res Ctr Beijing 100193 Peoples R China

Optimizing reaction conditions to improve the yield is fundamental for chemical synthesis and industrial processes. Experiments can only be performed under a small portion of reaction conditions for a system, so a strategy of experimental design is required. Bayesian optimization, a global optimization algorithm, was found to outperform human decision-making in reaction optimization. Similarly, heuristic algorithms also have the potential to solve optimization problems. In this work, we optimize these reaction conditions for Buchwald-Hartwig and Suzuki systems by predicting reaction yields with three heuristic algorithms and three encoding methods. Our results demonstrate that particle swarm optimization with numerical encoding is better than the genetic algorithm or simulated annealing. Moreover, its performance is comparable to Bayesian optimization without the computational costs of descriptors. Particle swarm optimization is simple and easy to perform, and it can be implemented into laboratory practice to promote chemical synthesis.

关键词： heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluating Meta-heuristic algorithms for Dynamic Capacitated Arc Routing Problems Based on a Novel Lower Bound Method

引用

IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE 2024年第4期19卷 31-44页

作者： Tong, Hao Minku, Leandro L. Menzel, Stefan Sendhoff, Bernhard Yao, Xin Univ Birmingham Birmingham England Honda Res Inst Europe GmbH Offenbach Germany Lingnan Univ Hong Kong Peoples R China

Meta-heuristic algorithms, especially evolutionary algorithms, have been frequently used to find near optimal solutions to combinatorial optimization problems. The evaluation of such algorithms is often conducted through comparisons with other algorithms on a set of benchmark problems. However, even if one algorithm is the best among all those compared, it still has difficulties in determining the true quality of the solutions found because the true optima are unknown, especially in dynamic environments. It would be desirable to evaluate algorithms not only relatively through comparisons with others, but also in absolute terms by estimating their quality compared to the true global optima. Unfortunately, true global optima are normally unknown or hard to find since the problems being addressed are NP-hard. In this paper, instead of using true global optima, lower bounds are derived to carry out an objective evaluation of the solution quality. In particular, the first approach capable of deriving a lower bound for dynamic capacitated arc routing problem (DCARP) instances is proposed, and two optimization algorithms for DCARP are evaluated based on such a lower bound approach. An effective graph pruning strategy is introduced to reduce the time complexity of our proposed approach. Our experiments demonstrate that our approach provides tight lower bounds for small DCARP instances. Two optimization algorithms are evaluated on a set of DCARP instances through the derived lower bounds in our experimental studies, and the results reveal that the algorithms still have room for improvement for large complex instances.

关键词： heuristic algorithms Metaheuristics Avalanche photodiodes Evolutionary computation Routing Approximation algorithms Vehicle dynamics Time complexity Performance evaluation Benchmark testing Optimization methods

来源：评论

学校读者我要写书评

暂无评论

Path Planning Optimization of the Load Transport Process Using heuristic algorithms

引用

APPLIED SCIENCES-BASEL 2024年第21期14卷 9940页

作者： Kwiaton, Pawel Cekus, Dawid Skrobek, Dorian Sofer, Michal Poruba, Zdenek Czestochowa Tech Univ Fac Mech Engn Dept Mech & Machine Design Fundamentals Dabrowskiego 73 PL-42201 Czestochowa Poland Jan Dlugosz Univ Czestochowa Fac Sci & Technol Dept Adv Computat Methods Armii Krajowej 13-15 PL-42200 Czestochowa Poland VSB Tech Univ Ostrava Fac Mech Engn Dept Appl Mech 17 Listopadu 15-2127 Ostrava 70833 Czech Republic

The paper presents the process of optimizing the duty cycle of a rotary crane. The minimization of the carried load's trajectory was chosen as the objective function. The research was conducted using the genetic algorithm and the particle swarm algorithm. The influence of particular algorithm parameters on the obtained optimal solution was characterized. For the obtained best case, the inverse kinematics problem was solved, allowing us to determine the control functions of individual crane members. The presented redundant system was solved with the use of an algorithm for temporarily limiting the movement of specific kinematic pairs. On the basis of the obtained results, it was determined which of the algorithms used is more favorable, taking into account the crane's operational safety and lifting capacity.

关键词： heuristic algorithms optimization load transport PSO genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Balancing Bandwidth Utilization and Interrupts: Two heuristic algorithms for the Optimized Design of Automotive CPS

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2020年第4期16卷 2382-2392页

作者： Xie, Yong Zeng, Gang Kurachi, Ryo Peng, Xin Xie, Guoqi Takada, Hiroaki Xiamen Univ Technol Dept Comp & Informat Engn Key Lab Internet Of Things Applicat Fujian Prov Xiamen 361024 Peoples R China Nagoya Univ Grad Sch Engn Nagoya Aichi 4648601 Japan Nagoya Univ Grad Sch Informat Sci Nagoya Aichi 4648601 Japan Hunan Inst Sci & Technol Sch Informat Sci & Engn Key Lab Hunan Prov Intelligent Control & Optimiza Yueyang 414000 Peoples R China Hunan Univ Key Lab Embedded & Network Comp Hunan Prov Coll Comp Sci & Elect Engn Changsha 410073 Peoples R China

To realize the optimized design of the automotive cyber-physical system, it is required to consider the interplay between the communication and computation. However, the existing research about the design of the controller area network (CAN) with flexible data rate (CAN FD) ignores this, it only considers the minimization of the bandwidth utilization and neglects the fact that it would trigger too many unnecessary message receiving interrupts (MRIs) on message receiving electronic control units. To address this problem, this article formulates a tradeoff problem that balances the bandwidth utilization and the number of unnecessary MRIs during the design of the CAN FD. We first propose an algorithm to analyze the number of unnecessary MRIs triggered by the packed messages, and then, two heuristic algorithms, namely, the Top-Down approach and the Hybrid approach, are proposed to resolve the tradeoff problem for midsized and large signal sets, respectively. The experiment results show that compared with the state-of-the-art algorithm, the Top-Down approach reduces the unnecessary MRIs by 10.48 & x0025;-99.89 & x0025;with only 0.02 & x0025;-1.32 & x0025;bandwidth utilization overhead, the Hybrid approach reduces the unnecessary MRIs by 23.15 & x0025;-99.63 & x0025;with only 0.13 & x0025;-2.07 & x0025;bandwidth utilization overhead.

关键词： Bandwidth Magnetic resonance imaging heuristic algorithms Task analysis Informatics Automotive engineering Real-time systems Automotive cyber-physical systems (ACPS) bandwidth utilization controller area network with flexible data rate (CAN FD) heuristic algorithms message receiving interrupts (MRIs)

来源：评论

学校读者我要写书评

暂无评论

NEW heuristic algorithms FOR EFFICIENT HIERARCHICAL PATH PLANNING

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1991年第1期7卷 9-26页

作者： ZHU, D LATOMBE, JC Robotics Laboratory Computer Science Department University of Stanford Stanford CA USA

One of the ultimate goals of robotics research is to create autonomous robots. Progress toward this goal requires advances in many domains, including automatic motion planning. The "basic problem" in motion planning is to construct a collision-free path for a moving object among fixed obstacles. In this paper, we consider one of the most popular approaches to path planning: hierarchical approximate cell decomposition. This approach consists of constructing successive decompositions of the robot's configuration space into rectangloid cells and searching the connectivity graph built at each level of decomposition for a path. Despite its conceptual simplicity, an efficient implementation of this approach raises many delicate questions that have not yet been addressed. The major contributions of this paper are 1) a novel approach to cell decomposition based on "constraint reformulation" and 2) a new algorithm for hierarchical search with a mechanism for recording failure conditions. We have implemented these algorithms in a path planner and experimented with this planner on various examples (some of which are reported in this paper). These experiments show that our planner is significantly (approximately 10 times) faster than previous planners based on the same general approach.

关键词： heuristic algorithms Path planning Robotics and automation Motion planning Orbital robotics Robots Humans Automatic control Computational Intelligence Society Computer science

来源：评论

学校读者我要写书评

暂无评论

Benchmarking of heuristic algorithms for Energy Router-Based Packetized Energy Management in Smart Homes

引用

IEEE SYSTEMS JOURNAL 2023年第2期17卷 2721-2732页

作者： Hussain, Hafiz Majid Ahmad, Ashfaq Narayanan, Arun Nardelli, Pedro H. J. Yang, Yongheng Lappeenranta Univ Technol Dept Elect Engn Lappeenranta 53850 Finland Air Univ Dept Elect & Comp Engn Islamabad 44000 Pakistan Zhejiang Univ Coll Elect Engn Hangzhou 310027 Zhejiang Peoples R China

This article presents an ER-based PEM strategy for PV integrated smart homes to jointly optimize their load scheduling delays, energy transactions cost, and battery degradation cost. The proposed approach incorporates a MA case, where, the ER acts as a main selecting agent realized by all other system elements. This leads to a combinatorial optimization problem, which can be effectively solved by heuristic optimization methods (HOMs), namely, genetic algorithm (GA), binary particle swarm optimization (BPSO), differential evolution (DE) algorithm, and harmony search algorithm (HSA). Specifically, we investigate the impact of the hyperparameters of the HOMs on the designed ER-based PEM system. Simulations are carried out for multiple smart homes under varying weather conditions to evaluate the effectiveness of HOMs in terms of selected performance metrics. Results show that the ER-based PEM reduces the average aggregated system cost, ensures economic benefits by selling surplus energy, while meeting customers energy packet demand, satisfying their quality-of-service, and operational constraints.

关键词： Smart homes Costs Delays Biological system modeling Optimization heuristic algorithms Scheduling Energy Internet (EI) energy router (ER) heuristic algorithms packetized energy management systems (PEMs)

来源：评论

学校读者我要写书评

暂无评论

Designing a new medicine supply chain network considering production technology policy using two novel heuristic algorithms

引用

RAIRO-OPERATIONS RESEARCH 2021年第2期55卷 1015-1042页

作者： Goodarzian, Fariba Hoseini-Nasab, Hassan Toloo, Mehdi Fakhrzad, Mohammad Bagher Sci Network Innovat & Res Excellence Machine Intelligence Res Labs MIR Labs 113rd St NWPOB 2259 Auburn WA 98071 USA Univ Tehran Coll Engn Sch Ind Engn Tehran Iran Yazd Univ Dept Ind Engn Yazd Iran Tech Univ Ostrava Fac Econ Republ Dept Syst Engn Ostrava Czech Republic Sultan Qaboos Univ Coll Econ & Polit Sci Dept Operat Management & Business Stat Muscat Oman

The role of medicines in health systems is increasing day by day. The medicine supply chain is a part of the health system that if not properly addressed, the concept of health in that community is unlikely to experience significant growth. To fill gaps and available challenging in the medicine supply chain network (MSCN), in the present paper, efforts have been made to propose a location-production-distribution-transportation-inventory holding problem for a multi-echelon multi-product multi-period bi-objective MSCN network under production technology policy. To design the network, a mixed-integer linear programming (MILP) model capable of minimizing the total costs of the network and the total time the transportation is developed. As the developed model was NP-hard, several meta-heuristic algorithms are used and two heuristic algorithms, namely, Improved Ant Colony Optimization (IACO) and Improved Harmony Search (IHS) algorithms are developed to solve the MSCN model in different problems. Then, some experiments were designed and solved by an optimization solver called GAMS (CPLEX) and the presented algorithms to validate the model and effectiveness of the presented algorithms. Comparison of the provided results by the presented algorithms and the exact solution is indicative of the high-quality efficiency and performance of the proposed algorithm to find a near-optimal solution within reasonable computational time. Hence, the results are compared with commercial solvers (GAMS) with the suggested algorithms in the small-sized problems and then the results of the proposed meta-heuristic algorithms with the heuristic methods are compared with each other in the large-sized problems. To tune and control the parameters of the proposed algorithms, the Taguchi method is utilized. To validate the proposed algorithms and the MSCN model, assessment metrics are used and a few sensitivity analyses are stated, respectively. The results demonstrate the high quality of the propose

关键词： Medicine supply chain network production-distribution problem heuristic algorithms Taguchi method

来源：评论

学校读者我要写书评

暂无评论

Evaluation of nine heuristic algorithms with data-intensive jobs and computing-intensive jobs in a dynamic environment

引用

IET SOFTWARE 2015年第1期9卷 7-16页

作者： Hao, Yongsheng Liu, Guanfeng Nanjing Univ Informat Sci & Technol Network Ctr Nanjing 210044 Jiangsu Peoples R China Soochow Univ Sch Comp Sci & Technol Suzhou 215006 Jiangsu Peoples R China

This study focuses on a dynamic environment where data-intensive jobs and computing-intensive jobs are submitted to a grid at the same time. The authors analyse nine heuristic algorithms in a grid and give a comparison of them in a simulation environment. The nine heuristics are: (i) min-min, (ii) max-min, (iii) duplex, (iv) sufferage, (v) minimum execution time (MET), (vi) opportunistic load balancing (OLB), (vii) fast-fit, (viii) best-fit and (ix) adaptive scoring job scheduling (ASJS). In the simulation, different ratios between the data-intensive jobs and computing-intensive jobs are used to investigate for the performance of the nine heuristics under different arrival rates. Five parameters are used to estimate the performance of those methods. Those parameters include average execution time, average waiting time, the number of finished jobs (FB), the sum of file size that has been submitted to the grid (SFS) and the total number of instructions of all finished jobs (SINI). Simulation results show that four out of the nine heuristics have relative good performance in the job scheduling in the grid systems. They are best-fit, MET, ASJS and OLB.

关键词： heuristic algorithms LOAD balancing (Computer networks) COMPUTER software development COMPUTER simulation COMPUTER software -- Execution

来源：评论

学校读者我要写书评

暂无评论

The car pooling problem: heuristic algorithms based on savings functions

引用

JOURNAL OF ADVANCED TRANSPORTATION 2003年第3期37卷 243-272页

作者： Ferrari, E Manzini, R Pareschi, A Persona, A Regattieri, A Univ Bologna Dept Ind Mech Plants Bologna Italy Univ Padua Dept Management & Engn Vicenza Italy

The present research deals with car pooling as a means of making better use of existing infrastructure and as a means of reducing traffic congestion with all its associated induced effects. Car pooling schemes involve several drivers getting together to share a private vehicle simultaneously, in order to reach their destinations points according to a semi-common route rather than each driver using their own vehicle. The Car Pooling Problem belongs to the non-polynomial computational complexity family of operations problems. In the current literature there are only a few studies on this optimization problem: the research group has designed several different new automatic and heuristic data processing routines to support efficient matching in car pool schemes. These are based on savings functions and belong to two distinct macro classes of algorithms to give two different modelings of this problem. They offer average savings of more than 50% in traveled distances demonstrating the effectiveness of a trivial matching scheme for real applications.

关键词： CARPOOLS heuristic algorithms TRAFFIC congestion COMPUTATIONAL complexity ELECTRONIC data processing

来源：评论

学校读者我要写书评

暂无评论

A general model for meta-heuristic algorithms using the concept of fields of forces

引用

ACTA MECHANICA 2011年第1-2期221卷 99-118页

作者： Kaveh, A. Talatahari, S. Iran Univ Sci & Technol Ctr Excellence Fundamental Studies Struct Engn Tehran 16 Iran Univ Tabriz Dept Civil Engn Tabriz Iran

A general model is presented to unify the explanation of different meta-heuristic algorithms. This model is based on the concept of fields of forces from physics and covers many meta-heuristic algorithms consisting of Genetic algorithms, Ant Colony Optimization, Particle Swarm Optimization, Big Bang-Big Crunch algorithm and Harmony Search. The properties of these algorithms can be explained using the presented general model that is called the fields of forces (FOF) model. This extension provides efficient means to improve, expand, modify and hybridize the meta-heuristic algorithms. An improved and hybridized algorithm is then developed using the FOF model.

关键词： heuristic algorithms FIELD theory (Physics) FORCE & energy MATHEMATICAL models PHYSICS PARTICLE swarm optimization ANT algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：