[PDF][PDF] A history of metaheuristics
A History of Metaheuristics arXiv:1704.00853v1 [cs.AI] 4 Apr 2017 Page 1 A History of
Metaheuristics ∗ Kenneth Sörensen Marc Sevaux Fred Glover Abstract This chapter …
Metaheuristics ∗ Kenneth Sörensen Marc Sevaux Fred Glover Abstract This chapter …
An overview of AI methods for in-core fuel management: tools for the automatic design of nuclear reactor core configurations for fuel reload,(re) arranging new and …
E Nissan - Designs, 2019 - mdpi.com
An important aspect of managing a nuclear reactor is how to design refuellings, and from the
1980s to the present different artificial intelligence (AI) techniques have been applied to this …
1980s to the present different artificial intelligence (AI) techniques have been applied to this …
The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems
We study the uncapacitated 2-allocation p-hub median problem (U2ApHMP), which is a
special case of the well-studied hub median problem. The hub median problem designs a …
special case of the well-studied hub median problem. The hub median problem designs a …
An intermodal hub location problem for container distribution in Indonesia
In this paper, we extend traditional hub location models for an intermodal network design on
a sparse network structure. While traditional hub location problems have been employed for …
a sparse network structure. While traditional hub location problems have been employed for …
A new approach based on particle swarm optimization algorithm for solving data allocation problem
The effectiveness distributed database systems highly depends on the state of site that its
task is to allocate fragments. This allocation purpose is performed for obtaining the minimum …
task is to allocate fragments. This allocation purpose is performed for obtaining the minimum …
Facility location models to locate data in information networks: a literature review
The usage of the Internet has grown substantially in recent times. This has resulted in high
volumes of data traffic. There is a concomitant rise in bandwidth demands that could result in …
volumes of data traffic. There is a concomitant rise in bandwidth demands that could result in …
Multiple allocation p-hub location problem for content placement in VoD services: a differential evolution based approach
In video-on-demand (VoD) services, large volumes of digital data are kept at hubs which are
spatially distributed over large geographic areas and users are connected to these hubs …
spatially distributed over large geographic areas and users are connected to these hubs …
Data allocation in distributed database systems: a novel hybrid method based on differential evolution and variable neighborhood search
N Lotfi - SN Applied Sciences, 2019 - Springer
Data allocation problem (DAP) in distributed database systems is a NP-hard optimization
problem with significant importance in parallel processing environments. The solution of …
problem with significant importance in parallel processing environments. The solution of …
A new variant of the p-hub location problem with a ring backbone network for content placement in VoD services
In this article, the single allocation p-hub location problem (SApHLP) with a ring backbone
network for content placement in VoD services is proposed. In VoD services, a large volume …
network for content placement in VoD services is proposed. In VoD services, a large volume …
A new approach based on greedy minimizing algorithm for solving data allocation problem
Distributed database functionality depends on sites responsible for the allocation of
fragments. The aims of the data allocation problem (DAP) are to achieve the minimum …
fragments. The aims of the data allocation problem (DAP) are to achieve the minimum …