Results 31 to 40 of about 452,067 (293)
Operations Research Perspectives, 2020 This article introduces a new variant of the inventory routing problem related to real-world businesses. Specifically, in the beverage industry, business customers such as restaurants and bars, demand consistent delivery times, have different opening ...
Emilio J. Alarcon Ortega +2 more
doaj +1 more source
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
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
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
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
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
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
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
Dynamic Programming Methodologies in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem [PDF]
, 2003 We provide two different neighborhood construction techniques for creating exponentially large neighborhoods that are searchable in polynomial time using dynamic programming.
Ergun, Özlem, Orlin, James B.
core +3 more sources
A study on exponential-size neighborhoods for the bin packing problem with conflicts
, 2017 We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various ...
Capua, Renatha +3 more
core +1 more source