scholarly journals Locating abrupt disaster emergency logistics centres using improved artificial bee colony (IABC) algorithm

2021 ◽  
Vol 104 (2) ◽  
pp. 003685042110162
Author(s):  
Qiang Sun ◽  
Shupei Liu
Keyword(s):  
Objective Function ◽  
Optimal Solution ◽  
Global Search ◽  
Emergency Relief ◽  
Multi Objective ◽  
Bee Colony ◽  
Emergency Logistics ◽  
Objective Function Values ◽  
The Stability ◽  
Better Than

Emergency management is conceptualized as a complex, multi-objective optimization problem related to facility location. However, little research has been performed on the horizontal transportation of emergency logistics centres. This study makes contributions to the multi-objective locating abrupt disaster emergency logistics centres model with the smallest total cost and the largest customer satisfaction. The IABC algorithm is proposed in this paper to solve the multi-objective emergency logistics centres locating problem. IABC algorithm can effectively calculate the optimal location of abrupt disaster emergency logistics centres and the demand for relief materials, and it can solve the rescue time satisfaction for different rescue sites. (1) IABC has better global search capabilities to avoid premature convergence and provide a faster convergence speed, and it has optimal solution accuracy, solution diversity and robustness. (2) From the three optimal objective function values obtained, the optimal objective function values obtained by IABC algorithm are obviously better than ABC and GABC algorithms. (3) From the convergence curves of three objective functions the global search ability and the stability of IABC algorithm are better than those of ABC and GABC algorithm. The improved ABC algorithm has proven to be effective and feasible. However, emergency relief logistics systems are very complex and involve many factors, the proposed model needs to be refined further in the future.

A Closeness Degree Method for Multi-Objective Optimization of Belt Transmission

1992 ◽  
Author(s):  
Lin Qun ◽  
Wu Meijuan
Keyword(s):  
Mathematical Model ◽  
Objective Function ◽  
Optimization Design ◽  
Optimal Solution ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Objective Function Values ◽  
Belt Transmission ◽  
Fuzzy Subsets ◽  
The Ideal

Abstract A mathematical model for multi objective optimization design of belt transmission is proposed in this paper. The normal fuzzy distribution is used to convert the ideal and non-inferior solutions into fuzzy subsets over the space of objective function values. The optimal solution which is closest to the ideal one could then be found on the basis of closeness degree method.

scholarly journals MODIFIKASI BARU ALGORITMA KOLONI LEBAH BUATAN UNTUK MASALAH OPTIMASI GLOBAL

2018 ◽  
Vol 10 (1) ◽  
pp. 17
Author(s):  
Nursyiva Irsalinda ◽  
Sugiyarto Surono
Keyword(s):  
Food Source ◽  
Artificial Bee Colony ◽  
Selection Process ◽  
Optimization Technique ◽  
Food Sources ◽  
Abc Algorithm ◽  
Average Value ◽  
Bee Colony ◽  
Objective Function Values ◽  
Better Than

Artificial Bee Colony (ABC) algorithm is one of metaheuristic optimization technique based on population. This algorithm mimicking honey bee swarm to find the best food source. ABC algorithm consist of four phases: initialization phase, employed bee phase, onlooker bee phase and scout bee phase. This study modify the onlooker bee phase in selection process to find the neighborhood food source. Not all food sources obtained are randomly sought the neighborhood as in ABC algorithm. Food sources are selected by comparing their objective function values. The food sources that have value lower than average value in that iteration will be chosen by onlooker bee to get the better food source. In this study the modification of this algorithm is called New Modification of Artificial Bee Colony Algorithm (MB-ABC). MB-ABC was applied to 4 Benchmark functions. The results show that MB-ABC algorithm better than ABC algorithm

Design and robustness analysis of fuzzy PID controller for automatic voltage regulator system using genetic algorithm

2022 ◽  
pp. 014233122110667
Author(s):  
Tufan Dogruer ◽  
Mehmet Serhat Can
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Pid Controller ◽  
Robustness Analysis ◽  
Optimal Solution ◽  
Voltage Regulator ◽  
Fuzzy Pid ◽  
Multi Objective ◽  
Fuzzy Pid Controller ◽  
Automatic Voltage Regulator

In this paper, a Fuzzy proportional–integral–derivative (Fuzzy PID) controller design is presented to improve the automatic voltage regulator (AVR) transient characteristics and increase the robustness of the AVR. Fuzzy PID controller parameters are determined by a genetic algorithm (GA)-based optimization method using a novel multi-objective function. The multi-objective function, which is important for tuning the controller parameters, obtains the optimal solution using the Integrated Time multiplied Absolute Error (ITAE) criterion and the peak value of the output response. The proposed method is tested on two AVR models with different parameters and compared with studies in the literature. It is observed that the proposed method improves the AVR transient response properties and is also robust to parameter changes.

scholarly journals Online Clique Clustering

Algorithmica ◽  
2019 ◽  
Vol 82 (4) ◽  
pp. 938-965
Author(s):  
Marek Chrobak ◽  
Christoph Dürr ◽  
Aleksander Fabijan ◽  
Bengt J. Nilsson
Keyword(s):  
Objective Function ◽  
Competitive Ratio ◽  
Online Algorithm ◽  
Optimal Solution ◽  
Deterministic Algorithm ◽  
Input Graph ◽  
Online Clustering ◽  
Objective Value ◽  
Asymptotic Competitive Ratio ◽  
Better Than

Abstract Clique clustering is the problem of partitioning the vertices of a graph into disjoint clusters, where each cluster forms a clique in the graph, while optimizing some objective function. In online clustering, the input graph is given one vertex at a time, and any vertices that have previously been clustered together are not allowed to be separated. The goal is to maintain a clustering with an objective value close to the optimal solution. For the variant where we want to maximize the number of edges in the clusters, we propose an online algorithm based on the doubling technique. It has an asymptotic competitive ratio at most 15.646 and a strict competitive ratio at most 22.641. We also show that no deterministic algorithm can have an asymptotic competitive ratio better than 6. For the variant where we want to minimize the number of edges between clusters, we show that the deterministic competitive ratio of the problem is $$n-\omega (1)$$n-ω(1), where n is the number of vertices in the graph.

scholarly journals Green Product Module Partition Method Based on Improved Multi-objective Artificial Bee Colony Algorithm

2019 ◽  
Vol 301 ◽  
pp. 00021
Author(s):  
Wei Wei ◽  
Yang Zhan
Keyword(s):  
Life Cycle ◽  
Objective Function ◽  
Correlation Matrix ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Green Product ◽  
Multi Objective ◽  
Bee Colony ◽  
Axiomatic Design Theory ◽  
Module Partition

Modular design is an important design method in the mass customization for manufacturing industry. The purpose of this paper is to meet diverse market demands while reducing the impact of products on the ecological environment. Firstly, aiming at the product life cycle process, this paper summarizes the problems encountered in each stage of the product, and introduces five green product module partition principles. Then, through the component correlation matrix, the resource greenness objective function based on the whole life cycle and the polymerization degree objective function based on the component correlation matrix are established respectively by the axiomatic design theory which makes the product mapping from functional domain to structural domain. Next, an improved artificial bee colony algorithm is proposed. Based on the artificial bee colony algorithm, the algorithm applies congestion strategy and fast nondominated sorting strategy to solve the module partition problem of product platform with multi-objective optimization, and a uniformly distributed pare to solution set is generated. Through above steps, the optimization results of module partition are obtained. Finally, an application example of aircraft tail horizontal stabilizer parts is given, and the advantages of the algorithm are proved by comparing with other algorithms.

scholarly journals A fuzzy multi-objective linear programming with interval-typed triangular fuzzy numbers

2019 ◽  
Vol 17 (1) ◽  
pp. 607-626 ◽  
Author(s):  
Chunquan Li
Keyword(s):  
Linear Programming ◽  
Fuzzy Numbers ◽  
Programming Model ◽  
Optimal Solution ◽  
Objective Functions ◽  
Triangular Fuzzy Numbers ◽  
Matlab Toolbox ◽  
Multi Objective ◽  
Cut Set ◽  
The Stability

Abstract A multi-objective linear programming problem (ITF-MOLP) is presented in this paper, in which coefficients of both the objective functions and constraints are interval-typed triangular fuzzy numbers. An algorithm of the ITF-MOLP is provided by introducing the cut set of interval-typed triangular fuzzy numbers and the dominance possibility criterion. In particular, for a given level, the ITF-MOLP is converted to the maximization of the sum of membership degrees of each objective in ITF-MOLP, whose membership degrees are established based on the deviation from optimal solutions of individual objectives, and the constraints are transformed to normal inequalities by utilizing the dominance possibility criterion when compared with two interval-typed triangular fuzzy numbers. Then the equivalent linear programming model is obtained which could be solved by Matlab toolbox. Finally several examples are provided to illuminate the proposed method by comparing with the existing methods and sensitive analysis demonstrates the stability of the optimal solution.

Design and Optimization of Multiple Microchannel Heat Transfer Systems Based on Multiple Prioritized Preferences

2012 ◽  
Author(s):  
Po Ting Lin ◽  
Jingru Zhang ◽  
Yogesh Jaluria ◽  
Hae Chang Gea
Keyword(s):  
Heat Transfer ◽  
Objective Function ◽  
Optimal Solution ◽  
Optimization Strategy ◽  
Pressure Drops ◽  
Design And Optimization ◽  
Heat Flows ◽  
First Case ◽  
Efficiency Measures ◽  
Objective Function Values

Multiple microchannel heat transfer systems have been developed for the urge of rapid and effective cooling of the electronic devices, which have become smaller and more powerful but also produced more heat. Two different types of single-phase liquid cooling, including the straight and U-shaped microchannel heat sinks, have been utilized to reduce the temperature of the electronic chips. The cooling performances however depend on the preferences of different factors such as the thermal resistances, the pressure drops, and the heat flows at the solid-fluid interfaces. Lower thermal resistance represents higher temperature reduction; lower pressure drop means lower usage of the pumping power; and higher heat flows indicates more effective cooling between the heat spreader and the liquid. In this paper, an optimization strategy based on the prioritized performances has been developed to find the optimal design variables for multiple objectives: minimal thermal resistances, minimal pressure drops and maximal heat flows. The fuzzy and correlated preferences are modeled by the Gaussian membership functions with respect to different levels of the objective function values. The overall performances are formulated based on the prioritized preferences and maximized on the Pareto-optimal solution set to find the solutions for various preference conditions. Two case studies have been discussed. The first case considered the prioritized preferences based on uni-objective function values while the second one focused on the preferences of the thermal resistances and the efficiency measures, correlatively evaluated by the flow rates, pressure drops, and heat flows.

An Improved Method of Artificial Bee Colony Algorithm

2011 ◽  
Vol 101-102 ◽  
pp. 315-319 ◽  
Author(s):  
Xin Jie Wu ◽  
Duo Hao ◽  
Chao Xu
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Simulation Experiment ◽  
Optimization Problems ◽  
Local Extremum ◽  
Global Search ◽  
Improved Method ◽  
Object Function ◽  
Bee Colony ◽  
Better Than

The basic artificial bee colony algorithm gets local extremum easily and converges slowly in optimization problems of the multi-object function. In order to enhance the global search ability of basic artificial bee colony algorithm, an improved method of artificial bee colony algorithm is proposed in this paper. The basic idea of this method is as follows: On the basis of traditional artificial bee colony algorithm, the solution vectors that found by each bee colony are recombined after each iteration, then the solution vectors of combinations are evaluated again, thus the best result is found in this iteration. In this way the possibility of sticking at local extremum is reduced. Finally the simulation experiment has been finished. The simulation experiment results have shown that the method proposed in this paper is feasible and effective, it is better than basic artificial bee colony algorithm in the global search ability.

scholarly journals Modified Discrete Grey Wolf Optimizer Algorithm for Multilevel Image Thresholding

2017 ◽  
Vol 2017 ◽  
pp. 1-16 ◽  
Author(s):  
Linguo Li ◽  
Lijuan Sun ◽  
Jian Guo ◽  
Jin Qi ◽  
Bin Xu ◽  
...  
Keyword(s):  
Image Segmentation ◽  
Optimal Solution ◽  
Weight Coefficient ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Original Algorithm ◽  
Image Thresholding ◽  
Bee Colony ◽  
Optimal Thresholds ◽  
Objective Function Values

The computation of image segmentation has become more complicated with the increasing number of thresholds, and the option and application of the thresholds in image thresholding fields have become an NP problem at the same time. The paper puts forward the modified discrete grey wolf optimizer algorithm (MDGWO), which improves on the optimal solution updating mechanism of the search agent by the weights. Taking Kapur’s entropy as the optimized function and based on the discreteness of threshold in image segmentation, the paper firstly discretizes the grey wolf optimizer (GWO) and then proposes a new attack strategy by using the weight coefficient to replace the search formula for optimal solution used in the original algorithm. The experimental results show that MDGWO can search out the optimal thresholds efficiently and precisely, which are very close to the result examined by exhaustive searches. In comparison with the electromagnetism optimization (EMO), the differential evolution (DE), the Artifical Bee Colony (ABC), and the classical GWO, it is concluded that MDGWO has advantages over the latter four in terms of image segmentation quality and objective function values and their stability.

Diagnostic Strategy Optimization Based on Predatory Search Algorithm

2012 ◽  
Vol 591-593 ◽  
pp. 2441-2444
Author(s):  
Jin Luo ◽  
Qi Bin Deng ◽  
Chen Meng
Keyword(s):  
Local Search ◽  
Objective Function ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Search Space ◽  
Global Search ◽  
State Probability ◽  
Diagnostic Strategy ◽  
Local Optimal Solution ◽  
Predatory Search Algorithm

With respect to the inherent NP-hard complexity of Optimization of testability diagnostic strategy problem, a predatory search algorithm simulating animal predatory strategies was designed. This algorithm adopted the gross test expense including state probability, isolation matrix and test expense as its objective function, defined local and global search by the restriction value of search space based on two points exchange, and realized the conversion between local and global search by adjusting the restriction value of search space. It had better ability to conduct local search and jump out of local optimal solution simultaneously, and provided a better resolution for the optimization of testability diagnostic strategy.

Sign in / Sign up

Export Citation Format

Share Document