Titlebook: Hybrid Metaheuristics; 10th International W Maria J. Blesa,Christian Blum,El-Ghazali Talbi Conference proceedings 2016 Springer Internation

阻塞

Multi-chaotic Approach for Particle Acceleration in PSO,. The Particle Swarm Optimization algorithm is enhanced with two pseudo-random number generators based on chaotic systems. The chaotic pseudo-random number generators (CPRNGs) are used to guide the particles movement through multiplying the accelerating constants. Different CPRNGs are used simultane

Abjure

Districting and Routing for Security Control,ly, security workers patrol through a set of objects where each object requires a particular number of visits on all or some days within a given planning horizon, and each of these visits has to be performed in a specific time window. An important goal of the security company is to partition all obj

宣傳

A GRASP/VND Heuristic for a Generalized Ring Star Problem,t-costs and core-costs. The goal is to find the minimum-cost spanning graph, where the core is a two-node-connected component, and the remaining nodes are pendant to this component..First, we show that the 2NCSP belongs to the .-Hard class. Therefore, a GRASP heuristic is developed, enriched with a

GUEER

,Neighborhood Composition Strategies in?Stochastic Local Search,e design of SLS methods which use many neighborhoods poses difficult questions regarding the exploration of these neighborhoods: how much computational effort should be invested in each neighborhood? Should this effort remain fixed during the entire search or should it be dynamically updated as the

Mri485

有害處

Hybridization of Chaotic Systems and Success-History Based Adaptive Differential Evolution,on of Chaotic map based Pseudo-Random Number Generator (CPRNG) into the process of parent selection in Success-History Based Adaptive Differential Evolution (SHADE) algorithm. The impact on performance of the algorithm is tested on CEC2015 benchmark set where five different chaotic maps are used for

happiness

Tabu Search Hybridized with Multiple Neighborhood Structures for the Frequency Assignment Problem, minimum order frequency assignment problem. This problem involves assigning frequencies to a set of requests while minimizing the number of frequencies used. Several novel and existing techniques are used to improve the efficiency of this algorithm. This includes a novel technique that aims to dete

積習(xí)已深

The Capacitated m Two-Node Survivable Star Problem: A Hybrid Metaheuristic Approach,is to connect terminals by . rings which meet at a distinguished node, and possibly by some pendant links, at minimum cost. In this paper, we introduce a relaxation for the CmRSP, called Capacitated . Two-Node Survivable Star Problem (CmTNSSP for short). The CmTNSSP belongs to the .-Hard class of co

Innocence

,Robust Berth Allocation Using a Hybrid Approach Combining Branch-and-Cut and?the?Genetic Algorithm,weather conditions and others. Finding a robust plan which can accommodate this uncertainty is therefore desirable to port operators. This paper suggests ways to generate robust berth allocation plans in container terminals. The problem is first formulated as a mixed-integer programming model whose

Arteriography

Dealing with the Strategic Level of Decisions Related to Automated Transit Networks: A Hybrid Heuri In ATN, driverless vehicles run on exclusive guideways in order to provide on-demand transportation service. In this paper, we focus on the strategic level of decision related to ATN. We deal with the problem of determining the best size of fleet of ATN vehicles while satisfying a set of transporta