Simultaneous Determination of Guaifenesin and Theophylline by Chemometrics Methods

In this study, simultaneous spectrophotometry determination of guaifenesin and theophylline in pharmaceuticals by chemometric approaches has been reported. Spectra of mixtures of these drugs were recorded and corresponding first derivatives were calculated. Partial least squares regression (PLS) alone and ant colony optimization (ACO) coupled with PLS were used in analysis of the data. Ant colony system (ACS) as an efficient ACO algorithm was used. In addition, ACS was combined to genetic algorithm (GA) to produce better results. The analytical performances of these chemometric methods were characterized by relative prediction errors. These methods were successfully applied to pharmaceutical formulation.     

多层防御模式下武器目标分配决策的群体智能优化算法

武器目标分配(WTA)是军事运筹学中经典的NP完全问题,迄今为止未找到求精确解的多项式时间算法.针对武器数量、布防空间、运行维护成本以及人力资源等多约束下的多层防御WTA问题,采用粒子群优化(PSO)和蚁群优化(ACO)两种群体智能算法求解.给出了PSO和ACO算法实现方案,通过一个算例评估两个算法的性能.结果表明,两种算法都能给出高质量的近似最优解,对求解WTA问题是有效的.PSO在解的质量、算法鲁棒性和计算效率方面均优于ACO.     

Stochastic dynamic lot-sizing problem using bi-level programming base on artificial intelligence techniques

Simulation is generally used to study non-deterministic problems in industry. When a simulation process finds the solution to an NP-hard problem, its efficiency is lowered, and computational costs increase. This paper proposes a stochastic dynamic lot-sizing problem with asymmetric deteriorating commodity, in which the optimal unit cost of material and unit holding cost would be determined. This problem covers a sub-problem of replenishment planning, which is NP-hard in the computational complexity theory. Therefore, this paper applies a decision system, based on an artificial neural network (ANN) and modified ant colony optimization (ACO) to solve this stochastic dynamic lot-sizing problem. In the methodology, ANN is used to learn the simulation results, followed by the application of a real-valued modified ACO algorithm to find the optimal decision variables. The test results show that the intelligent system is applicable to the proposed problem, and its performance is better than response surface methodology.     

基于智能优化算法的车间调度问题研究

车间的生产调度是一个非常复杂的问题,本文主要介绍车间调度问题模型以及蚁群算法、遗传算法、模拟退火算法等智能优化算法的研究情况,有效的生产调度方法和智能优化算法的应用,在很大程度上可以提高企业的效益.     

基于蚁群算法的桁架结构布局离散变量优化方法

提出的布局优化方法是将桁架结构的截面变量、拓扑变量及形状变量统一为离散变量.将离散变量转化为适应于蚁群算法求解TSP问题的离散变量,应用MATLAB语言编写求解桁架结构布局优化程序,最终实现对问题的分析与求解.通过对几个经典的平面、空间桁架结构布局优化算例的验算表明:本文设计的基于蚁群算法的桁架结构布局离散变量优化方法较单独处理截面优化、拓扑优化及形状优化问题具有更大的效益,相对于其他布局优化方法也展现出更好的优化效果.“基于蚁群算法的桁架结构布局离散变量优化方法”在程序设计、求解速度、求解空间及其方法通用性等方面都表现出良好的性能,并且简单、实用,适应于实际工程应用.     

Multi-ant colony system (MACS) for a vehicle routing problem with backhauls

The vehicle routing problem with backhaul (VRPB) is an extension of the capacitated vehicle routing problem (CVRP). In VRPB, there are linehaul as well as backhaul customers. The number of vehicles is considered to be fixed and deliveries for linehaul customers must be made before any pickups from backhaul customers. The objective is to design routes for the vehicles so that the total distance traveled is minimized. We use multi-ant colony system (MACS) to solve VRPB which is a combinatorial optimization problem. Ant colony system (ACS) is an algorithmic approach inspired by foraging behavior of real ants. Artificial ants are used to construct a solution by using pheromone information from previously generated solutions. The proposed MACS algorithm uses a new construction rule as well as two multi-route local search schemes. An extensive numerical experiment is performed on benchmark problems available in the literature.     

Distributed supply chain management using ant colony optimization

Successful supply chain management requires a cooperative integration between all the partners in the network. At the operational level, the partners individual behavior should be optimal and therefore their activities have to be planned using sophisticated optimization tools. However, these tools should take into account the planning of the remaining partners, through the exchange of information, in order to allow some kind of cooperation between the elements of the chain. This paper introduces a new supply chain management technique, based on modeling a generic supply chain with suppliers, logistics and distributers, as a distributed optimization problem. The different operational activities are solved by the optimization meta-heuristic called ant colony optimization, which allows the exchange of information between different optimization problems by means of a pheromone matrix. The simulation results show that the new methodology is more efficient than a simple decentralized methodology for different instances of a supply chain.     

一种变系数的自适应蚂蚁算法

蚂蚁算法是一种新型的模拟进化算法,也是一种随机型智能搜索算法.较为系统的总结了算法的基本理论,分析了其基本算法解决TSP问题的模型,给出基于熵的变系数改进蚂蚁算法,并针对TSP问题进行优化性能的比较分析.     

基于改进蚁群算法的交通最优路径方法研究

本文提出一种基于改进蚁群算法的交通路径最优方法,首先根据图论的思想构建了城市交通网络模型,结合层次分析法考虑了道路长度、交叉口停滞、交通拥挤、道路容量、天气状况等五个主要因素。然后在MATLAB平台下,采用改进的蚁群算法对静态交通网络和动态交通网络分别进行最短路径的求解,最后进行了对比分析。研究结果表明,在综合考虑以上五种因素的情况下,动态交通网络下的路径最优算法能为出行者找到更准确更便捷的路线。     

Ant colony optimization for continuous domains

In this paper we present an extension of ant colony optimization (ACO) to continuous domains. We show how ACO, which was initially developed to be a metaheuristic for combinatorial optimization, can be adapted to continuous optimization without any major conceptual change to its structure. We present the general idea, implementation, and results obtained. We compare the results with those reported in the literature for other continuous optimization methods: other ant-related approaches and other metaheuristics initially developed for combinatorial optimization and later adapted to handle the continuous case. We discuss how our extended ACO compares to those algorithms, and we present some analysis of its efficiency and robustness.