Results 31 to 40 of about 450,572 (276)
Engineering Science and Technology, an International Journal, 2021 The design of a production line directly affects the system performance which is usually measured by its throughput. The problem involving determination of the optimal capacity and location of the buffers in a production line is known as the buffer ...
Mehmet Ulaş Koyuncuoğlu, Leyla Demir
doaj +1 more source
A General Large Neighborhood Search Framework for Solving Integer Programs [PDF]
, 2020 This paper studies how to design abstractions of large-scale combinatorial optimization problems that can leverage existing state-of-the-art solvers in general purpose ways, and that are amenable to data-driven design.
Dilkina, Bistra +3 more
core
A machine learning framework for neighbor generation in metaheuristic search
Frontiers in Applied Mathematics and Statistics, 2023 This paper presents a methodology for integrating machine learning techniques into metaheuristics for solving combinatorial optimization problems. Namely, we propose a general machine learning framework for neighbor generation in metaheuristic search. We
Defeng Liu +3 more
doaj +1 more source
SLIDER: Mining correlated motifs in protein-protein interaction networks [PDF]
, 2009 —Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereby provide a computational method for predicting binding sites for protein ...
Boyen, P. +3 more
core +2 more sources
Adaptive large neighborhood search for mixed integer programming [PDF]
Mathematical Programming Computation, 2021 AbstractLarge Neighborhood Search (LNS) heuristics are among the most powerful but also most expensive heuristics for mixed integer programs (MIP). Ideally, a solver adaptively concentrates its limited computational budget by learning which LNS heuristics work best for the MIP problem at hand.
openaire +1 more source
Algorithms, 2021 This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into a variable neighborhood search for solving the permutation flow-shop scheduling problem. The algorithm first constructs a permutation as a
Mehrdad Amirghasemi
doaj +1 more source
A GPU-based Iterated Tabu Search for Solving the Quadratic 3-dimensional Assignment Problem [PDF]
, 2010 International audienceThe quadratic 3-dimensional assignment problem (Q3AP) is an extension of the well-known NP-hard quadratic assignment problem. It has been proved to be one of the most difficult combinatorial optimization problems.
Luong, Thé Van +2 more
core +2 more sources
Large neighborhood local search optimization on graphics processing units [PDF]
2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as ``walks through neighborhoods'' where the walks are performed by iterative procedures that allow to move from a solution to another one in the solution space.
Luong, Thé Van +2 more
openaire +2 more sources
Identification of probabilistic cellular automata [PDF]
, 2003 The identification of probabilistic cellular automata (PCA) is studied using a new two stage neighborhood detection algorithm. It is shown that a binary probabilistic cellular automaton (BPCA) can be described by an integer-parameterized polynomial ...
Billings, S.A., Yang, Y.X.
core +1 more source
EURO Journal on Transportation and Logistics, 2021 Delivery options are at the heart of the generalized vehicle routing problem with time windows (GVRPTW) allowing that customer requests are shipped to alternative delivery locations which can also have different time windows.
Dorian Dumez +4 more
doaj +1 more source