Designing a Multi Echelon Flexible Logistics Network Using Co-Evolutionary Immune-Particle Swarm Optimization with Penetrated Hyper-Mutation (COIPSO-PHM)

2011 ◽  
Vol 110-116 ◽  
pp. 3713-3719
Author(s):  
N. C. Hiremath ◽  
Sadanand Sahu ◽  
Manoj Kumar Tiwari
Keyword(s):  
Particle Swarm Optimization ◽  
Real Life ◽  
Particle Swarm ◽  
Mixed Integer ◽  
Data Set ◽  
Swarm Optimization ◽  
Automotive Manufacturing ◽  
Logistics Network ◽  
Delivery Modes ◽  
Flexible Delivery

The strategic design and operation of outbound logistics network in an automotive manufacturing supply chain is directly related with the competitive strategy adopted by the firm. We discuss here an outbound logistics network model with four echelons and flexible delivery modes by incorporating cross-dock facility in the network. The paper aims to achieve a minimum total logistics cost for flexible delivery modes adopted in the network. The mathematical model is formulated as a mixed integer programming model and solved by using a hybrid algorithm named co-evolutionary immune-particle swarm optimization with penetrated hyper-mutation (COIPSO-PHM). The proposed model is combinatorial in nature owing to varying problem instances. The proposed solution methodology is tested on a sample data set mimicking the real life situation and the results are found to be satisfactory.

Optimization of Shell and Tube Heat Exchanger Using Alpha Tuning Elephant Herding Optimization (EHO) Technique

2021 ◽  
Vol 52 ◽  
pp. 92-101
Author(s):  
Jiten Makadia ◽  
C.D. Sankhavara
Keyword(s):  
Particle Swarm Optimization ◽  
Heat Exchanger ◽  
Optimization Problems ◽  
Cost Optimization ◽  
Real Life ◽  
Particle Swarm ◽  
Benchmark Problems ◽  
Swarm Optimization ◽  
Tube Heat Exchanger ◽  
Shell And Tube

Swarm Intelligence algorithms like PSO (Particle Swarm Optimization), ACO (Ant Colony Optimization), ABC (Artificial Bee Colony), Glow-worm swarm Optimization, etc. have been utilized by researchers for solving optimization problems. This work presents the application of a novel modified EHO (Elephant Herding Optimization) for cost optimization of shell and tube heat exchanger. A comparison of the results obtained by EHO in two benchmark problems shows that it is superior to those obtained with genetic algorithm and particle swarm optimization. The overall cost reduction is 13.3 % and 9.68% for both the benchmark problem compared to PSO. Results indicate that EHO can be effectively utilized for solving real-life optimization problems.

scholarly journals Efficient Computation Offloading in Multi-Tier Multi-Access Edge Computing Systems: A Particle Swarm Optimization Approach

2019 ◽  
Vol 10 (1) ◽  
pp. 203 ◽  
Author(s):  
Luan N. T. Huynh ◽  
Quoc-Viet Pham ◽  
Xuan-Qui Pham ◽  
Tri D. T. Nguyen ◽  
Md Delowar Hossain ◽  
...  
Keyword(s):  
Resource Allocation ◽  
Particle Swarm Optimization ◽  
Optimization Problem ◽  
Particle Swarm ◽  
Edge Computing ◽  
Computation Offloading ◽  
Mixed Integer ◽  
5G Networks ◽  
Swarm Optimization ◽  
Multi Access

In recent years, multi-access edge computing (MEC) has become a promising technology used in 5G networks based on its ability to offload computational tasks from mobile devices (MDs) to edge servers in order to address MD-specific limitations. Despite considerable research on computation offloading in 5G networks, this activity in multi-tier multi-MEC server systems continues to attract attention. Here, we investigated a two-tier computation-offloading strategy for multi-user multi-MEC servers in heterogeneous networks. For this scenario, we formulated a joint resource-allocation and computation-offloading decision strategy to minimize the total computing overhead of MDs, including completion time and energy consumption. The optimization problem was formulated as a mixed-integer nonlinear program problem of NP-hard complexity. Under complex optimization and various application constraints, we divided the original problem into two subproblems: decisions of resource allocation and computation offloading. We developed an efficient, low-complexity algorithm using particle swarm optimization capable of high-quality solutions and guaranteed convergence, with a high-level heuristic (i.e., meta-heuristic) that performed well at solving a challenging optimization problem. Simulation results indicated that the proposed algorithm significantly reduced the total computing overhead of MDs relative to several baseline methods while guaranteeing to converge to stable solutions.

Flexible Synthesis of Heat Exchanger Network with Particle Swarm Optimization Algorithm

2011 ◽  
Vol 214 ◽  
pp. 569-572 ◽  
Author(s):  
Xio Ling Zhang ◽  
Hong Chao Yin ◽  
Zhao Yi Huo
Keyword(s):  
Particle Swarm Optimization ◽  
Heat Exchanger ◽  
Operating Cost ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Mixed Integer ◽  
Optimization Approach ◽  
Nonlinear Program ◽  
Heat Exchanger Network ◽  
Swarm Optimization

In this paper, the flexible synthesis problem for heat exchanger network(HEN) is formulated to a mixed integer nonlinear program(MINLP) model. The objection function of the model consists of two components: First, a candidate HEN structure has to satisfy flexible criterion during input span. Second, a minimized annual cost consisting of investment cost and operating cost is investigated. The solution strategy based on particle swarm optimization(PSO) algorithm is proposed to obtain the optimal solution of the presented model. Finally, a four streams example is investigated to show the advantage of the whole proposed optimization approach.

scholarly journals PSOVina: The hybrid particle swarm optimization algorithm for protein–ligand docking

2015 ◽  
Vol 13 (03) ◽  
pp. 1541007 ◽  
Author(s):  
Marcus C. K. Ng ◽  
Simon Fong ◽  
Shirley W. I. Siu
Keyword(s):  
Particle Swarm Optimization ◽  
Virtual Screening ◽  
Particle Swarm ◽  
Ligand Docking ◽  
Conformational Search ◽  
Search Problem ◽  
Data Set ◽  
Swarm Optimization ◽  
Screening Experiments ◽  
Hybrid Particle Swarm Optimization

Protein–ligand docking is an essential step in modern drug discovery process. The challenge here is to accurately predict and efficiently optimize the position and orientation of ligands in the binding pocket of a target protein. In this paper, we present a new method called PSOVina which combined the particle swarm optimization (PSO) algorithm with the efficient Broyden–Fletcher–Goldfarb–Shannon (BFGS) local search method adopted in AutoDock Vina to tackle the conformational search problem in docking. Using a diverse data set of 201 protein–ligand complexes from the PDBbind database and a full set of ligands and decoys for four representative targets from the directory of useful decoys (DUD) virtual screening data set, we assessed the docking performance of PSOVina in comparison to the original Vina program. Our results showed that PSOVina achieves a remarkable execution time reduction of 51–60% without compromising the prediction accuracies in the docking and virtual screening experiments. This improvement in time efficiency makes PSOVina a better choice of a docking tool in large-scale protein–ligand docking applications. Our work lays the foundation for the future development of swarm-based algorithms in molecular docking programs. PSOVina is freely available to non-commercial users at http://cbbio.cis.umac.mo .

scholarly journals The Biobjective Bike-Sharing Rebalancing Problem with Balance Intervals: A Multistart Multiobjective Particle Swarm Optimization Algorithm

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-19
Author(s):  
Yongji Jia ◽  
Yuanyuan Xu ◽  
Dong Yang ◽  
Jia Li
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Mixed Integer ◽  
Variable Neighbourhood Search ◽  
Pareto Optimal ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization ◽  
Bike Sharing

The bike-sharing system (BSS), as a sustainable way to deal with the “last mile” problem of mass transit systems, is increasingly popular in recent years. Despite its success, the BSS tends to suffer from the mismatch of bike supply and user demand. BSS operators have to transfer bikes from surplus stations to deficit stations to redistribute them among stations by means of trucks. In this paper, we deal with the bike-sharing rebalancing problem with balance intervals (BRP-BIs), which is a variant of the static bike-sharing rebalancing problem. In this problem, the equilibrium of station is characterized by a balance interval instead of a balance point in the literature. We formulate the BRP-BI as a biobjective mixed-integer programming model with the aim of determining both the minimum cost route for a single capacitated vehicle and the maximum average rebalance utility, an index for the balanced degree of station. Then, a multistart multiobjective particle swarm optimization (MS-MOPSO) algorithm is proposed to solve the model such that the Pareto optimal solutions can be derived. The proposed algorithm is extended with crossover operator and variable neighbourhood search to enhance its exploratory capability. Compared with Hybrid NSGA-II and MOPSO, the computational experimental results demonstrate that our MS-MOPSO can obtain Pareto optimal solutions with higher quality.

scholarly journals An Improved Solution for Reactive Power Dispatch Problem Using Diversity-Enhanced Particle Swarm Optimization

Energies ◽  
2020 ◽  
Vol 13 (11) ◽  
pp. 2862 ◽  
Author(s):  
Mini Vishnu ◽  
Sunil Kumar T. K.
Keyword(s):  
Particle Swarm Optimization ◽  
Reactive Power ◽  
Particle Swarm ◽  
Load Condition ◽  
Active Power ◽  
Mixed Integer ◽  
Swarm Optimization ◽  
Power Dispatch ◽  
Reactive Power Dispatch ◽  
Enhanced Particle Swarm Optimization

Well-structured reactive power policies and dispatch are major concerns of operation and control technicians of any power system. Obtaining a suitable reactive power dispatch for any given load condition of the system is a prime duty of the system operator. It reduces loss of active power occurring during transmission by regulating reactive power control variables, thus boosting the voltage profile, enhancing the system security and power transfer capability, thereby attaining an improvement in overall system operation. The reactive power dispatch (RPD) problem being a mixed-integer discrete continuous (MIDC) problem demands the solution to contain all these variable types. This paper proposes a methodology to achieve an optimal and practically feasible solution to the RPD problem through the diversity-enhanced particle swarm optimization (DEPSO) technique. The suggested method is characterized by the calculation of the diversity of each particle from its mean position after every iteration. The movement of the particles is decided based on the calculated diversity, thereby preventing both local optima stagnation and haphazard unguided wandering. DEPSO accounts for the accuracy of the variables used in the RPD problem by providing discrete values and integer values compared to other algorithms, which provide all continuous values. The competency of the proposed method is tested on IEEE 14-, 30-, and 118-bus test systems. Simulation outcomes show that the proposed approach is feasible and efficient in attaining minimum active power losses and minimum voltage deviation from the reference. The results are compared to conventional particle swarm optimization (PSO) and JAYA algorithms.

scholarly journals A Decomposition Model for HPLC-DAD Data Set and Its Solution by Particle Swarm Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Lizhi Cui ◽  
Zhihao Ling ◽  
Josiah Poon ◽  
Simon K. Poon ◽  
Junbin Gao ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
High Performance ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Physical Principle ◽  
Reference Curve ◽  
Optimal Parameters ◽  
General Reference ◽  
Data Set ◽  
Swarm Optimization

This paper proposes a separation method, based on the model of Generalized Reference Curve Measurement and the algorithm of Particle Swarm Optimization (GRCM-PSO), for the High Performance Liquid Chromatography with Diode Array Detection (HPLC-DAD) data set. Firstly, initial parameters are generated to construct reference curves for the chromatogram peaks of the compounds based on its physical principle. Then, a General Reference Curve Measurement (GRCM) model is designed to transform these parameters to scalar values, which indicate the fitness for all parameters. Thirdly, rough solutions are found by searching individual target for every parameter, and reinitialization only around these rough solutions is executed. Then, the Particle Swarm Optimization (PSO) algorithm is adopted to obtain the optimal parameters by minimizing the fitness of these new parameters given by the GRCM model. Finally, spectra for the compounds are estimated based on the optimal parameters and the HPLC-DAD data set. Through simulations and experiments, following conclusions are drawn: (1) the GRCM-PSO method can separate the chromatogram peaks and spectra from the HPLC-DAD data set without knowing the number of the compounds in advance even when severe overlap and white noise exist; (2) the GRCM-PSO method is able to handle the real HPLC-DAD data set.

Feature selection using binary particle swarm optimization and support vector machines for medical diagnosis

2012 ◽  
Vol 57 (5) ◽  
Author(s):  
Mohammad Reza Daliri
Keyword(s):  
Feature Selection ◽  
Particle Swarm Optimization ◽  
Support Vector Machines ◽  
Particle Swarm ◽  
Support Vector ◽  
Emission Computed Tomography ◽  
Binary Particle Swarm Optimization ◽  
Data Set ◽  
Swarm Optimization ◽  
Vector Machines

AbstractIn this article, we propose a feature selection strategy using a binary particle swarm optimization algorithm for the diagnosis of different medical diseases. The support vector machines were used for the fitness function of the binary particle swarm optimization. We evaluated our proposed method on four databases from the machine learning repository, including the single proton emission computed tomography heart database, the Wisconsin breast cancer data set, the Pima Indians diabetes database, and the Dermatology data set. The results indicate that, with selected less number of features, we obtained a higher accuracy in diagnosing heart, cancer, diabetes, and erythematosquamous diseases. The results were compared with the traditional feature selection methods, namely, the F-score and the information gain, and a superior accuracy was obtained with our method. Compared to the genetic algorithm for feature selection, the results of the proposed method show a higher accuracy in all of the data, except in one. In addition, in comparison with other methods that used the same data, our approach has a higher performance using less number of features.

Sign in / Sign up

Export Citation Format

Share Document