Results 191 to 200 of about 12,515 (232)
Some of the next articles are maybe not open access.
A biased random‐key genetic algorithm for single‐round divisible load scheduling
International Transactions in Operational Research, 2015AbstractA divisible load is an amount W of computational work that can be arbitrarily divided into chunks and distributed among a set P of worker processors to be processed in parallel. Divisible load applications occur in many fields of science and engineering.
Brandão, Julliany S. +3 more
openaire +1 more source
A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
International Transactions in Operational Research, 2017AbstractA divisible load is an amount W of computational work that can be arbitrarily divided into independent chunks of load. In many divisible load applications, the load can be parallelized in a master–worker fashion, where the master distributes the load among a set P of worker processors to be processed in parallel.
Brandão, Julliany S. +3 more
openaire +2 more sources
A biased random key genetic algorithm for the field technician scheduling problem
Computers & Operations Research, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Damm, Ricardo B. +2 more
openaire +1 more source
A Hybrid Biased Random Key Genetic Algorithm for the Quadratic Assignment Problem
Information Processing Letters, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eduardo Lalla-Ruiz +3 more
openaire +2 more sources
Biased random-key genetic algorithms with applications in telecommunications
TOP, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
International Transactions in Operational Research, 2019
AbstractIn supermarkets, perishable products need to be sold to consumers before a given deadline, after which their monetary value is significantly diminished or even completely lost. In the case of valuable products that should not be wasted, the following operational decision needs to be made as this deadline approaches: which is the best way to ...
Alejandro Estrada‐Moreno +3 more
openaire +3 more sources
AbstractIn supermarkets, perishable products need to be sold to consumers before a given deadline, after which their monetary value is significantly diminished or even completely lost. In the case of valuable products that should not be wasted, the following operational decision needs to be made as this deadline approaches: which is the best way to ...
Alejandro Estrada‐Moreno +3 more
openaire +3 more sources
A Biased Random-Key Genetic Algorithm for Regression Test Case Prioritization
2018 IEEE Latin American Conference on Computational Intelligence (LA-CCI), 2018The Test Case Prioritization Problem (TCPP) is a real-world problem that arises in regression testing. It lies in finding an ordering of the test cases of a test suite, such that test cases ordered first should be run first. The classical approach to solve this problem employing GAs is to use permutational encoding, but it requires specific operators ...
Pablo Carballo +3 more
openaire +1 more source
A Biased-Randomized Algorithm for the Uncapacitated Facility Location Problem
2018Facility Location Problems (FLPs) have been widely studied in the fields of Operations Research and Computer Science. This is due to the fact that FLPs have numerous practical applications in different areas, from logistics (e.g., placement of distribution or retailing centers) to Internet computing (e.g., placement of cloud-service servers on a ...
Jesica de Armas +2 more
openaire +1 more source
A biased random-key genetic algorithm for routing and wavelength assignment
Journal of Global Optimization, 2010The problem of routing and wavelength assignment in wavelength division multiplexing optical networks consists in routing a set of lightpaths and assigning a wavelength to each of them, such that lightpaths whose routes share a common fiber are assigned different wavelengths.
Thiago F. Noronha +2 more
openaire +1 more source
Biased random key genetic algorithm for the Tactical Berth Allocation Problem
Applied Soft Computing, 2014The Tactical Berth Allocation Problem (TBAP) aims to allocate incoming ships to berthing positions and assign quay crane profiles to them (i.e. number of quay cranes per time step). The goals of the TBAP are both the minimization of the housekeeping costs derived from the transshipment container flows between ships, and the maximization of the total ...
Lalla, Eduardo Anibal +3 more
openaire +2 more sources