14 results
Search Results
2. Enriched Coati Osprey Algorithm: A Swarm-based Metaheuristic and Its Sensitivity Evaluation of Its Strategy.
- Author
-
Kusuma, Purba Daru and Hasibuan, Faisal Candrasyah
- Subjects
- *
OPTIMIZATION algorithms , *METAHEURISTIC algorithms , *SET functions , *SWARM intelligence , *NEIGHBORHOODS , *ALGORITHMS - Abstract
A new swarm-based metaheuristic, namely the enriched coati osprey algorithm (ECOA), is proposed in this paper. As its name suggests, ECOA hybridizes two new metaheuristics, the coati optimization algorithm (COA) and the osprey optimization algorithm (OOA). ECOA is constructed by five searches performed sequentially by the swarm members. The first three are directed searches, while the last two are neighborhood searches. All three directed searches are adopted from COA and OOA. Meanwhile, the four-bordered neighborhood search is developed based on a new approach. During the assessment, ECOA was challenged to overcome the set of 23 functions and contended with five new metaheuristics: total interaction algorithm (TIA), golden search optimization (GSO), average and subtraction-based optimization (ASBO), COA, and OOA. The result shows that ECOA outperforms TIA, GSO, ASBO, COA, and OOA in 16, 23, 18, 21, and 21 functions. Meanwhile, the individual search test result shows that the directed searches perform better than the neighborhood searches. Moreover, the directed search toward the best member becomes the most dominant search. [ABSTRACT FROM AUTHOR]
- Published
- 2024
3. Improved Artificial Bee Colony Algorithm Guided by Experience.
- Author
-
Chunfeng Wang, Pengpeng Shang, and Lixia Liu
- Subjects
- *
BEES algorithm , *SWARM intelligence , *HONEYBEES , *ALGORITHMS - Abstract
At present, artificial bee colony algorithm (ABC) is one of the hot issues in swarm intelligence algorithm. Since it was proposed, people have done a lot of improvement work for ABC algorithm. To address the shortcomings of ABC, an improved ABC guided by experience (named as EABC) is proposed in this paper. In EABC, it collects the experience of individual improvement caused by dimension change in the iterative process, and selects the dimensions to change according to a ratio when a new position needs to be generated. In this way, the individual can choose a good direction to improve its quality. Numerical experiments show that EABC has a better performance. [ABSTRACT FROM AUTHOR]
- Published
- 2022
4. Discrete Hamiltonians for Minimum of Available Energy in Bubble Fluidized Drying Operations.
- Author
-
Poświata, Artur and Szwast, Zbigniew
- Subjects
- *
MATHEMATICAL models , *ENERGY consumption , *FLUIDIZED bed reactors , *HAMILTONIAN systems , *MASS transfer , *HEAT transfer , *MATHEMATICAL optimization , *ALGORITHMS - Abstract
In this paper we study optimization of multistage drying process in fluidized bed. The drying of fine particles in fluidized bed is very effective operation because of good contact of phases and a large interfacial surface. Using a relatively high gas velocity improves conditions of mass and heat transfers but a portion of gas begins to flow as bubbles or canals, so an energy carried by this gas is not used efficiently. This is a reason to search for best operating parameters to minimize cost or to maximize efficiency of the process. A method of determining optimal parameters of drying gas (flowrate, temperature and humidity) is described in this paper. As a performance index, i.e. function being optimized, we apply a function describing the exergy input in the drying process. This function consists of three parts, the first two describing the thermal and chemical exergy of gas whereas the third one referring to investment costs expressed in exergy units. The chemical exergy of gas is connected with the difference between gas humidity and ambient humidity. In the optimization calculations we search for a minimum of exergy consumption Any effective method of optimization involves an algorithm of maximum principle for multistage problems. The earliest algorithms of this sort was the Katz' and Fan's algorithm. As it is less suitable for our purposes due to its undefined symplectic structure, we apply a modification of Sieniutycz's and Szwast's algorithm with a constant Hamiltonian (formally similar to the well-know continuous algorithm of Pontryagin). In this paper a modification of the basis algorithm is applied. This modification admits constrained intervals of time. In our calculations we take into consideration the bed hydrodynamics and kinetics of transport processes To describe behavior of fluidized bed we use the well-known two-phase model of Kunii and Levenspiel In this model, the gas excess flows in form of bubbles. The heat and mass transfer between the solid and gas as well between the dense phase (with gas and solid) and bubble phase determines values of optimal gas parameters. We discuss optimal parameters of gas and solid associated with minimum exergy consumption in drying proces. [ABSTRACT FROM AUTHOR]
- Published
- 2012
5. Continuous Curvature Path Generation Based on Bézier Curves for Autonomous Vehicles.
- Author
-
Ji-wung Choi, Curry, Renwick E., and Elkaim, Gabriel Hugh
- Subjects
- *
ALGORITHMS , *CURVATURE , *VEHICLES , *TRAJECTORIES (Mechanics) , *STEERING gear - Abstract
In this paper we present two path planning algorithms based on Bézier curves for autonomous vehicles with waypoints and corridor constraints. Bézier curves have useful properties for the path generation problem. This paper describes how the algorithms apply these properties to generate the reference trajectory for vehicles to satisfy the path constraints. Both algorithms join a set of low-degree Bézier curves segments smoothly to generate the path. Additionally, we discuss the constrained optimization problem that optimizes the resulting path for a user-defined cost function. The simulation demonstrates the improvement of trajectory generation in terms of smoother steering control and smaller cross track error compared to previous work. [ABSTRACT FROM AUTHOR]
- Published
- 2010
6. Modified Harmony Search Algorithm for the Capacitated Vehicle Routing Problem.
- Author
-
Pichpibul, Tantikorn and Kawtummachai, Ruengsak
- Subjects
VEHICLE routing problem ,COMBINATORIAL optimization ,MATHEMATICAL programming ,ALGORITHMS ,MATHEMATICAL optimization ,MACHINE theory - Abstract
This paper presents the modification of a harmony search algorithm (HS) for the capacitated vehicle routing problem (CVRP). The objective is to find a feasible set of vehicle routes that minimizes the total traveling distance and the number of vehicles used. The modified HS has two stages. First, the probabilistic Clarke-Wright savings algorithm was incorporated into harmony memory mechanism to improve its initial solution. Second, the roulette wheel selection procedure was employed into new harmony improvisation mechanism to improve its selection process. Computational results on the well-known CVRP benchmark problems show that the modified HS is competitive to the best existing algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2013
7. A Simple C++ Template Program for Simulating Operation Research Problems for Students' Learning.
- Author
-
Rizi, Zahra Asgari
- Subjects
COMPUTER programming ,MATHEMATICAL models ,QUANTITATIVE research ,ALGORITHMS ,C++ - Abstract
Operation research is the representation of real-world systems by mathematical models together with the use of quantitative methods (algorithms) for solving such models, with a view to optimizing. As we know, C++ language is a middle level language and a computer program with this language is executed faster than application softwares of the operation research area. In this paper, a simple template program with simple C++ instructions is presented for simulating many types of optimization problems. This template is very easy to learn and understand for students or anyone who works in the operation research area. They can quickly and easily simulate many types of optimization problems with this template. [ABSTRACT FROM AUTHOR]
- Published
- 2012
8. An lp Norm Minimization Using Auxiliary Function for Compressed Sensing.
- Author
-
TSUTSU, Hiroshi and MORIKAWA, Yoshitaka
- Subjects
DIAGNOSTIC imaging ,IMAGE reconstruction ,LENGTH measurement ,LINEAR programming ,ALGORITHMS ,HUMAN voice - Abstract
Compressed sensing (CS) is a powerful tool for signal measurement and processing, so it has caught much attention in many fields such as medical imaging and image restoration. In CS, we assume the latent signals, such as voices and images, are sparse; i.e. they have many zero components. On this assumption, we search the sparsest signal sufficing the linear measurement equalities. Usually instead of minimizing the number of nonzero components of signal, we minimize the l
1 norm of the solution vector to satisfy the convex condition. Linear programming such as simplex method is often used for this l1 norm minimization. This paper proposes a fast algorithm for lp (00.95 norm minimization is 6.47 times faster than l
1 simplex method. [ABSTRACT FROM AUTHOR]- Published
- 2012
9. Traffic Engineering and Optimization Routing for VoIP Traffic in Wireless Mesh Networks.
- Author
-
ZARHOUNI, Houda, ORHANOU, Ghizlane, EL HAJJI, Said, and BENAINI, Redouane
- Subjects
- *
TELECOMMUNICATION traffic , *INTERNET telephony , *WIRELESS sensor networks , *ALGORITHMS , *NETWORK performance , *GRAPH coloring , *PROBLEM solving , *ROUTING (Computer network management) - Abstract
This paper proposes a traffic engineering model to provide a better quality of service for VoIP in Wireless Mesh Networks (WMNs). We have developed an efficient algorithm in order to find the optimal path by combining the search for feasible routes with an optimization model to enhance the performance of VoIP over WMNs. Our goal of the joint optimization and the computation of feasible route is to minimize the network cost. The selection path use the independent set which are widely used in graph coloring problem to minimize interference. The idea is to build the independent set for the node Source (S) and Destination (D); also we make an intersection between those sets. Moreover, we formulate an optimization model which determines the optimal set of these criteria: hop count, link criticality and load balancing and we present initial performance results. [ABSTRACT FROM AUTHOR]
- Published
- 2012
10. From Beam to Chassis: How to Increase NVH Performances with an Optimized Moment of Inertia Distribution.
- Author
-
Torricelli, E., Baldini, A., Moruzzi, P., and D'Agostino, L.
- Subjects
AUTOMOBILE weight ,STIFFNESS (Engineering) ,MATHEMATICAL optimization ,ALGORITHMS ,VIBRATION (Mechanics) - Abstract
Car weight reduction is becoming more and more important for every kind of vehicle: minor mass implies, in fact, minor consumption, makes easier to fulfill homologation rules and assures a better handling behavior. Despite that, several vehicle missions have always been solved by adding more mass, e.g. NVH. In this paper, a methodology to optimize the stiffness distribution is proposed in order to obtain better vibrational performances without increasing the mass. At first, the problem has been solved for a simple beam using finite element and optimization algorithms. At a second stage, the optimal moment of inertia distribution found has been applied to a chassis thanks to a topometry optimization. Finally, the improvement in NVH performances has been verified comparing the inertances of the optimized model with those of the non-optimized one. [ABSTRACT FROM AUTHOR]
- Published
- 2011
11. Best Wavelength Selection for Gabor Wavelet using GA in EBGM Algorithm.
- Author
-
Mohamad Hoseyn Sigari and Mahmood Fathy
- Subjects
WAVELENGTHS ,MATHEMATICAL optimization ,ALGORITHMS ,GABOR transforms ,WAVELETS (Mathematics) ,GENETIC algorithms ,FACE perception ,COMBINATORIAL optimization - Abstract
In this paper a new method for optimization of Elastic Bunch Graph Matching (EBGM) algorithm in frontal face recognition is presented. In EBGM algorithm, some pre-determined wavelength of Gabor wavelet is used to extract features from face image. For optimization of EBGM algorithm, Genetic Algorithm (GA) is used to select the best wavelengths of Gabor wavelet. For evaluation, algorithm has been tested on 300 classes of FERET face database. In training phase, only one image per class is trained. The recognition rate of optimized EBGM is about 91%. Also the optimized EBGM can run 1.5 times faster than original EBGM. [ABSTRACT FROM AUTHOR]
- Published
- 2008
12. Raw Material Purchase and Storage Optimization System Based on Chaos Immune Algorithm.
- Author
-
Dongxiao Niu and Xihua Gu
- Subjects
INVENTORY control ,BUSINESS logistics management ,INVENTORY management systems ,MATERIALS management ,ALGORITHMS - Abstract
Inventory control is an important aspect of logistics management in modern enterprise. According to the characteristic of raw material purchase and stock, the paper puts forward an optimal inventory model to minimize the cost, and converts it into the shortest-circuit problem to solve. A novel chaos immune optimization combination algorithm of solving the shortest-circuit problem is improved. This algorithm integrates space-searching advantages of the immune evolutionary algorithm (IEA) and chaos optimization algorithm (COA). It uses the ergodic property of the chaos system to overcome redundancies, and uses the chaos initial sensitivity to enlarge the searching space. Thus, the diversity of population is retained, the local optimization is avoided, and the rapidity of global optimization is improved. Then, this model is applied to the process of searching the optimization in the purchase and storage model. At last, example shows the chaos immune algorithm is effective and reliable. [ABSTRACT FROM AUTHOR]
- Published
- 2007
13. Time Series Prediction using Backpropagation Network Optimized by Hybrid K-means-Greedy Algorithm.
- Author
-
Tan, J. Y. B., Bong, D. B. L., and Rigit, A. R. H.
- Subjects
- *
TIME series analysis , *PREDICTION models , *BACK propagation , *ARTIFICIAL neural networks , *MATHEMATICAL optimization , *ALGORITHMS - Abstract
A multilayer perceptron with backpropagation algorithm (BP) network that has the optimal number of neurons in its hidden layer would be able to predict accurately unknown values of a time series that it is trained with. A model known as K-means-Greedy Algorithm (KGA) model which combines greedy algorithm with k-means++ clustering is proposed in this paper to find the optimal number of neurons inside the hidden layer of the BP network. Experiments performed show that the proposed KGA model is effective in finding the optimal number of neurons for the hidden layer of a BP network that is used to perform prediction of unknown values of the Mackey-Glass time series. [ABSTRACT FROM AUTHOR]
- Published
- 2012
14. An Adjusted Recursive Operator Allocation Optimization Algorithm for Line Balancing Control.
- Author
-
Song, B. L., Wong, W. K., Fan, J., and Chan, S. F.
- Subjects
MATHEMATICAL optimization ,ASSEMBLY line balancing ,RECURSIVE functions ,ALGORITHMS ,MATHEMATICAL analysis - Abstract
This paper aims to solve the operator allocation optimization problem for line balancing control under two unsatisfied conditions. With the help of a combination condition adjustment approach, an adjusted recursive operator allocation optimization algorithm is developed for these two adjusted conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2006
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.