large combinatorial optimization problems
A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems
... a large, international trading company with over 100 warehouses in different countries and with an inventory of around 150,000 items on permanent ...a large, complex and heterogeneous logistics ...
11
A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm
... The TSP is a representative of a large class of problems known as the combinatorial optimization problems. Among them, TSP is one of the most important, since it is very easy to ...
22
Grammatical evolution hyper heuristic for combinatorial optimization problems
... The most straightforward answer to the above question might be to employ trial-and-error to find the most suitable meta- heuristic from the large variety of those available, and then employ trial-and-error to ...
22
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
... We found that the increased complexity of master problems with type 2 cuts are worth the effort, as less iterations are required to solve the minmax regret problem to optimality. The advantage is particularly ...
27
Solving Hard Graph Problems with Combinatorial Computing and Optimization
... Many problems arising in graph theory are difficult by nature, and finding solutions to large or complex instances of them often require the use of ...such problems are NP-hard or lie even higher in ...
108
Combinatorial optimization and metaheuristics
... Today, combinatorial optimization is one of the youngest and most active areas of discrete ...of optimization in applied mathematics and computer science, related to operational research, algorithm ...
47
Local Search Approximation Algorithms for Clustering Problems
... a combinatorial optimization problem we look for a that either maximizes or mini- mizes a given objective ...a combinatorial optimization problem is discrete or ...of combinatorial ...
115
Weld sequence optimization: the use of surrogate models for solving sequential combinatorial problems
... Welding can cause contractions, which occur when the melted material in the weld pool cools after the arc is removed. This causes stresses of large magnitude to be distributed throughout the component and can also ...
17
Metaheuristics and combinatorial optimization problems
... too large a portion of the worst members, will lead to quick and premature convergence while the others can ignore good genetic material in preference of inferior solutions, ultimately resulting in inferior ...
92
Approximating Incremental Combinatorial Optimization Problems
... of combinatorial optimization, a single solution is sought which optimizes a given objective ...be large, and implementing it may mean proceeding in ...design problems, disaster recovery, and ...
14
AN IOT BASED FRAMEWORK FOR STUDENTS INTERACTION AND PLAGIARISM DETECTION IN PROGRAMMING ASSIGNMENTS
... As shown in figure 12, the number of feasible solutions within population rapidly increases after some feasible solutions are discovered. However, the number of feasible solutions still fluctuate during the later period ...
13
Automated Algorithm Selection and Configuration (Dagstuhl Seminar 16412)
... P-hard problems, such as propositional satisfiability (SAT) and mixed integer programming (MIP), are known to have a huge impact on sectors such as manufacturing, logistics, healthcare, finance, agriculture and ...
42
IMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM
... This section includes the conclusion on the basis of information gathered and the test results. This project implements the complete ACO algorithm for edge detection of the image. Along this, the project also implement ...
12
Nature inspired optimization of large problems.
... particle optimization (ISPO) was proposed to explore the search space using a single particle instead of a swarm, and some further discussions on the ISPO can also be found in a recently published literature ...
229
Metaheuristic research: a comprehensive survey
... tough optimization problems, Yang [89] asserts that it is hard to affirm mathematically why metaheuristic algorithms are that ...of large-scale problems to be solved by metaheuristics; as ...
35
Improved performance by integrated corrugator and converter scheduling
... Both the CSP and production scheduling are discussed extensively in literature. However, only a few authors address the problem of integrating the CSP and production scheduling. In most industries the CSP is performed in ...
105
A review of literature on parallel constraint solving
... Rolf and Kuchcinski (2010) parallelise both search and consistency (we discuss paral- lelisation of search in Section 5). They take a different approach to parallelising consis- tency, by splitting the set of constraints ...
33
On Problems With Closure Properties
... of combinatorial search or optimization problems where the search space gives rise to a closure operator and essentially the hulls are the only relevant subsets that must be checked in a brute force ...
5
Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems
... population-based optimization algorithm which exploits the estimation capability of Kalman filter to search for a solution in a continuous search ...numerical optimization problems which involve ...
8
Bi objective branch and cut algorithms based on LP relaxation and bound sets
... bi–objective combinatorial optimization ...multi–objective problems with more than two ...objective combinatorial optimization to the multi-objective ...with problems having a ...
27