Implementation of greedy and simulated annealing algorithms for wireless access point placement

NF Puspitasari, H Al Fatta… - 2015 3rd International …, 2015 - ieeexplore.ieee.org
Optimization of the access point layout is one of the issues in the field of networking. This
issue is relating to the layout of access point on the Wireless Fidelity (Wi-Fi) network that …

Flowshop scheduling problem with parallel semi-lines and final synchronization operation

IFG Guimarães, Y Ouazene, MC de Souza… - Computers & Operations …, 2019 - Elsevier
This paper deals with a particular variant of the flowshop scheduling problem motivated by a
real case configuration issued from an electro-electronic material industry. The shop floor …

A simulated annealing based optimization algorithm

Y Tenne - Computational Optimization in Engineering-Paradigms …, 2017 - books.google.com
In modern engineering finding an optimal design is formulated as an optimization problem
which involves evaluating a computationally expensive black-box function. To alleviate …

Parallel-machine scheduling problem: An experimental study of instances difficulty and algorithms performance

O Ramos-Figueroa, M Quiroz-Castellanos… - Recent Advances of …, 2021 - Springer
Parallel-machine scheduling problems are well-known NP-hard combinatorial optimization
problems with many real-world applications. Given the increasing appearance of these …

[PDF][PDF] Layout optimization of wireless access point placement using greedy and simulated annealing algorithms

NF Puspitasari, H Al Fatta, FW Wibowo - network, 2016 - ijssst.info
The development of Wi-Fi network is not only about the installment of access point
infrastructure, but also related to various factors such as signal strength of the access point …

[PDF][PDF] Efficient Heuristic Strategies for the Parallel-Machine Scheduling Problem with Unrelated Machines and Makespan Minimization

O Ramos-Figueroa - 2022 - researchgate.net
Many problems of practical and theoretical importance within the fields of Artificial
Intelligence and Operations Research are combinatorial. Combinatorial optimization …

[PDF][PDF] Assesing The Performance of Different S-Metaheuristics To Solve Unrestricted Parallel Identical Machines Scheduling Problem

CR Gatica, SC Esquivel, MG Leguizamón - … . Revista Iberoamericana de …, 2013 - redalyc.org
In this paper we present a comparative study of four trajectory or single-solution based
metaheuristics (S-metaheuristics): Iterated Local Search (ILS), Greedy Randomized …

Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines

CR Gatica, SC Esquivel… - XVIII Congreso Argentino …, 2012 - sedici.unlp.edu.ar
In this paper we present a comparative study of four trajectory metaheuristics or single-
solution based metaheuristics (S-meta heuristics): Iterated Local Search (ILS), Greedy …

[PDF][PDF] An Overview of the Extended Neighborhood Search Techniques for Shop Scheduling Problems

O Yavas - researchgate.net
The scheduling methods, introduced by the academicians and practitioners, have been
developed day by day. The new branches/subdivisions of the main methods are being …

A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems

CR Gatica, SC Esquivel… - XVIII Congreso Argentino …, 2013 - sedici.unlp.edu.ar
In this paper we propose a modification to the Simulated Annealing (SA) basic algorithm that
includes an additional local search cycle after finishing every Metropolis cycle. The added …