497 research outputs found
Recommended from our members
A survey of swarm intelligence for dynamic optimization: algorithms and applications
Swarm intelligence (SI) algorithms, including ant colony optimization, particle swarm optimization, bee-inspired algorithms, bacterial foraging optimization, firefly algorithms, fish swarm optimization and many more, have been proven to be good methods to address difficult optimization problems under stationary environments. Most SI algorithms have been developed to address stationary optimization problems and hence, they can converge on the (near-) optimum solution efficiently. However, many real-world problems have a dynamic environment that changes over time. For such dynamic optimization problems (DOPs), it is difficult for a conventional SI algorithm to track the changing optimum once the algorithm has converged on a solution. In the last two decades, there has been a growing interest of addressing DOPs using SI algorithms due to their adaptation capabilities. This paper presents a broad review on SI dynamic optimization (SIDO) focused on several classes of problems, such as discrete, continuous, constrained, multi-objective and classification problems, and real-world applications. In addition, this paper focuses on the enhancement strategies integrated in SI algorithms to address dynamic changes, the performance measurements and benchmark generators used in SIDO. Finally, some considerations about future directions in the subject are given
Roulette-Wheel Selection-Based PSO Algorithm for Solving the Vehicle Routing Problem with Time Windows
The well-known Vehicle Routing Problem with Time Windows (VRPTW) aims to
reduce the cost of moving goods between several destinations while
accommodating constraints like set time windows for certain locations and
vehicle capacity. Applications of the VRPTW problem in the real world include
Supply Chain Management (SCM) and logistic dispatching, both of which are
crucial to the economy and are expanding quickly as work habits change.
Therefore, to solve the VRPTW problem, metaheuristic algorithms i.e. Particle
Swarm Optimization (PSO) have been found to work effectively, however, they can
experience premature convergence. To lower the risk of PSO's premature
convergence, the authors have solved VRPTW in this paper utilising a novel form
of the PSO methodology that uses the Roulette Wheel Method (RWPSO). Computing
experiments using the Solomon VRPTW benchmark datasets on the RWPSO demonstrate
that RWPSO is competitive with other state-of-the-art algorithms from the
literature. Also, comparisons with two cutting-edge algorithms from the
literature show how competitive the suggested algorithm is
Green Vehicle Routing Optimization Based on Carbon Emission and Multiobjective Hybrid Quantum Immune Algorithm
© 2018 Xiao-Hong Liu et al. Green Vehicle Routing Optimization Problem (GVROP) is currently a scientific research problem that takes into account the environmental impact and resource efficiency. Therefore, the optimal allocation of resources and the carbon emission in GVROP are becoming more and more important. In order to improve the delivery efficiency and reduce the cost of distribution requirements through intelligent optimization method, a novel multiobjective hybrid quantum immune algorithm based on cloud model (C-HQIA) is put forward. Simultaneously, the computational results have proved that the C-HQIA is an efficient algorithm for the GVROP. We also found that the parameter optimization of the C-HQIA is related to the types of artificial intelligence algorithms. Consequently, the GVROP and the C-HQIA have important theoretical and practical significance
Good practice proposal for the implementation, presentation, and comparison of metaheuristics for solving routing problems
Researchers who investigate in any area related to computational algorithms (both
dening new algorithms or improving existing ones) usually nd large diculties to test
their work. Comparisons among dierent researches in this eld are often a hard task,
due to the ambiguity or lack of detail in the presentation of the work and its results. On
many occasions, the replication of the work conducted by other researchers is required,
which leads to a waste of time and a delay in the research advances. The authors of this
study propose a procedure to introduce new techniques and their results in the eld of
routing problems. In this paper this procedure is detailed, and a set of good practices
to follow are deeply described. It is noteworthy that this procedure can be applied to
any combinatorial optimization problem. Anyway, the literature of this study is focused
on routing problems. This eld has been chosen because of its importance in real world,
and its relevance in the actual literature
Cooperative Optimization QoS Cloud Routing Protocol Based on Bacterial Opportunistic Foraging and Chemotaxis Perception for Mobile Internet
In order to strengthen the mobile Internet mobility management and cloud platform resources utilization, optimizing the cloud routing efficiency is established, based on opportunistic bacterial foraging bionics, and puts forward a chemotaxis perception of collaborative optimization QoS (Quality of Services) cloud routing mechanism. The cloud routing mechanism is based on bacterial opportunity to feed and bacterial motility and to establish the data transmission and forwarding of the bacterial population behavior characteristics. This mechanism is based on the characteristics of drug resistance of bacteria and the structure of the field, and through many iterations of the individual behavior and population behavior the bacteria can be spread to the food gathering area with a certain probability. Finally, QoS cloud routing path would be selected and optimized based on bacterial bionic optimization and hedge mapping relationship between mobile Internet node and bacterial population evolution iterations. Experimental results show that, compared with the standard dynamic routing schemes, the proposed scheme has shorter transmission delay, lower packet error ratio, QoS cloud routing loading, and QoS cloud route request overhead
Swarm Intelligent in Bio-Inspired Perspective: A Summary
This paper summarizes the research performed in the field of swarm intelligent in recent years. The classification of swarm intelligence based on behavior is introduced. The principles of each behaviors, i.e. foraging, aggregating, gathering, preying, echolocation, growth, mating, clustering, climbing, brooding, herding, and jumping are described. 3 algorithms commonly used in swarm intelligent are discussed. At the end of summary, the applications of the SI algorithms are presented
Задачи построения комбинированных и раздельных маршрутов перевозки мелкопартионных грузов во внутренних зонах иерархической автотранспортной сети
В работе предложены математические формулировки задач построения комбинированных и раздельных маршрутов для перевозки мелкопартионных грузов во внутренних зонах обслуживания магистральных узлов иерархической транспортной сети. Проведен обзор методов и алгоритмов решения подобных задач. Отмечается возможность решения сформулированных задач с помощью известных пакетов смешанного и целочисленного линейного программирования.В роботі запропоновані математичні формулювання задач побудови комбінованих і роздільних маршрутів для перевезення дрібнопартіонних вантажів у внутрішніх зонах обслуговування магістральних вузлів ієрархічної транспортної мережі. Проведено огляд методів і алгоритмів розв’язання подібних задач. Відзначається можливість розв’язання сформульованих задач за допомогою відомих пакетів змішаного і цілочисельного лінійного програмування.The paper presents mathematical formulations of the vehicle routing problems with simultaneous and split delivery and pickup of small-lot cargo in the internal service areas of trunk nodes of hierarchical transport network. A review of methods and algorithms for solving such problems is conducted. It is marked the possibility of solving the formulated problems by known packages of mixed and integer linear programming
A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications
Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms
- …