Combinatorial Problem
Mostrando 1-12 de 164 artigos, teses e dissertações.
-
1. NEW THEORETICAL INVESTIGATIONS ON THE GAP OF THE SKIVING STOCK PROBLEM
ABSTRACT The one-dimensional skiving stock problem is a combinatorial optimization problem being of high relevance whenever an efficient and sustainable utilization of given resources is intended. In the classical formulation, a given supply of (small) item lengths has to be used to build as many large objects (specified by some target length) as possible. F
Pesqui. Oper.. Publicado em: 09/05/2019
-
2. Study of pandrug and heavy metal resistance among E. coli from anthropogenically influenced Delhi stretch of river Yamuna
Abstract Escalating burden of antibiotic resistance that has reached new heights present a grave concern to mankind. As the problem is no longer confined to clinics, we hereby report identification of a pandrug resistant Escherichia coli isolate from heavily polluted Delhi stretch of river Yamuna, India. E. coli MRC11 was found sensitive only to tobramycin a
Braz. J. Microbiol.. Publicado em: 2018-09
-
3. AND SOLUTION METHOD TO A SIMULTANEOUS ROUTE DESIGN AND FREQUENCY SETTING PROBLEM FOR A BUS RAPID TRANSIT SYSTEM IN COLOMBIA
ABSTRACT We propose a model and solution method to a simultaneous route design and frequency setting problem on a main corridor from one of the Bus Rapid Transit (BRT) Systems of Colombia. The proposed model considers objectives of users and operators in a combinatorial multi-objective optimization framework and takes into account real constraints on the ope
Pesqui. Oper.. Publicado em: 2017-08
-
4. A SURVEY ON HEURISTICS FOR THE TWO-DIMENSIONAL RECTANGULAR STRIP PACKING PROBLEM
ABSTRACT Two-dimensional rectangular strip packing problems belong to the broader class of Cutting and Packing (C&P) problems, in which small items are required to be cut from or packed on a larger object, so that the waste (unused regions of the large object) is minimized. C&P problems differ from other combinatorial optimization problems by the intrinsic g
Pesqui. Oper.. Publicado em: 2016-08
-
5. A multiobjective metaheuristic approach for the integrated vehicle and crew scheduling
AbstractThe integrated vehicle and crew scheduling problem is a hard Combinatorial Optimization problem widely studied over the years. Taking into consideration the range of variables related to the planning process of vehicles and drivers, there are several practical characteristics of the problem that are not reflected in the solutions generated computatio
J. Transp. Lit.. Publicado em: 2016-06
-
6. QUANTUM INSPIRED PARTICLE SWARM COMBINED WITH LIN-KERNIGHAN-HELSGAUN METHOD TO THE TRAVELING SALESMAN PROBLEM
ABSTRACT The Traveling Salesman Problem (TSP) is one of the most well-known and studied problems of Operations Research field, more specifically, in the Combinatorial Optimization field. As the TSP is a NP (Non-Deterministic Polynomial time)-hard problem, there are several heuristic methods which have been proposed for the past decades in the attempt to solv
Pesqui. Oper.. Publicado em: 2015-12
-
7. METAHEURISTICS EVALUATION: A PROPOSAL FOR A MULTICRITERIA METHODOLOGY
ABSTRACT In this work we propose a multicriteria evaluation scheme for heuristic algorithms based on the classic Condorcet ranking technique. Weights are associated to the ranking of an algorithm among a set being object of comparison. We used five criteria and a function on the set of natural numbers to create a ranking. The discussed comparison involves th
Pesqui. Oper.. Publicado em: 2015-12
-
8. A ROBUST COMBINATORIAL APPROACH BASED ON P-GRAPH FOR SUPERSTRUCTURE GENERATION IN DOWNSTREAM BIOPROCESSES
Abstract In the production of chemicals from fermentation, the cost of downstream purification constitutes the major portion of the total production cost. Since the bioprocess generally contains a large amount of biochemical separation units, its flowsheets are complex. How to generate the rigorous superstructure of the downstream bioprocess is a primary pro
Braz. J. Chem. Eng.. Publicado em: 2015-03
-
9. Heuristics to solve the integrated airline crew assignment problem
A typical problem related to airline crew management consists of optimally assigning the required crew members to planned flights for a given period of time, while complying with a variety of labor regulations, safety rules and policies of the airline. This problem, called crew assignment problem (CAP), is of the NPHard class. So, it is usually divided into
J. Transp. Lit.. Publicado em: 2015-01
-
10. AN EXPERIMENTAL COMPARISON OF BIASED AND UNBIASED RANDOM-KEY GENETIC ALGORITHMS
Random key genetic algorithms are heuristic methods for solving combinatorial optimization problems. They represent solutions as vectors of randomly generated real numbers, the so-called random keys. A deterministic algorithm, called a decoder, takes as input a vector of random keys and associates with it a feasible solution of the combinatorial optimization
Pesqui. Oper.. Publicado em: 2014-08
-
11. Maximization of Fundamental Frequency of Laminated Composite Cylindrical Shells by Ant Colony Algorithm
ABSTRACT: The success in developing modern aerospace systems addresses competitive subjects as optimization, reduced costs, sustainability, environment, weight, and safety. There is an increased demand for lighter materials such as laminated composites. In order to match the demand of aeronautical companies, the shell structures are very important. The dynam
J. Aerosp. Technol. Manag.. Publicado em: 2013-03
-
12. Caminhos mínimos com recursos limitados / Resource constrained shortest path
O problema de caminhos mínimos (SP shortest path problem) é frequentemente colo- cado em prática em uma grande variedade de aplicações em diversas áreas. Nessas aplicações geralmente se deseja realizar algum tipo de deslocamento ou transporte entre dois ou mais pontos específicos em uma rede. Tal ação deve ser executada de forma ótima em relaçã
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 14/11/2012