[PDF] Top 20 Levantamiento Por El Método de Diagonales

... the Next Release Problem (NRP), proposing a model where each user has an importance value to the organization and requests the implementation of a set of requirements in the software ...by ... See full document

... the problem of establishing the network of emergency service ...basic problem proposed in the literature is to locate certain number of units at given discrete points of the region and to allocate cities to ... See full document

... the next-generation web-based travel information systems that require results in milliseconds or ...this problem to establish time-dependent travel times in the TDVRPTW, shortest paths might be determined ... See full document

... Abstract: Next Release Problem (NRP) is a challenge in software engineering to define which set of requirements are to be developed in the next release of a software product taking in ... See full document

... new hybrid metaheuristic for the ...this hybrid metaheuristic has been carried out with the benchmark instances in the QAPLIB, a well-known library of QAP instance ... See full document

... inspired metaheuristic algorithms are characterized by algorithmic operators mimicking computationally useful aspects of various natural ...define problem-specific heuristics. Some of the most successful ... See full document

... for hybrid flowshop production ...for hybrid flow shop scheduling with controllable processing times and assignable due ...algorithms using job insertion techniques and iterative algorithms based on ... See full document

... The simulated annealing method [31] is one of the oldest algorithms; it is an iterative metaheuristic very used to solve combinatorial optimization problems in the continuous and discrete case. The strong point of ... See full document

... Finally, the best cluster from each site (the highest fitness) is chosen to form the next bee population. The remaining bees for initialing new population will be assigned randomly around the search space. This ... See full document

... greater problem for the selection of move acceptance methods as a single high-level strategy must perform well across a diverse set of ...for solving those new or unknown ...by using a subset of ... See full document

... PSO algorithm is a population-based search algorithm based on the simulation of the social behavior of birds within a flock [AG12]. It optimizes a problem by taking a population of candidate solutions. It moves ... See full document

... The paper is organized as follows. In Section , we recall some preliminaries. In Sec- tion , we propose a hybrid CQ projection algorithm for the split feasibility problem and show its convergence. In ... See full document

... salesman problem (TSP) is well known non- deterministic polynomial-time (NP-Hard) problem in combinatorial optimization which requires the shortest path through a tour through n cities, passing each once ... See full document

... Number Problem and generalize the Boneh-Venkatesan method [BV96, Shp05] for solving it in polynomial ...time using the LLL lattice basis reduction algorithm [LLL82] and Babai’s nearest planes method ... See full document

... transportation problem is one of the earliest applications of linear programming ...for solving transportation problems in fuzzy environment but in all the proposed methods, the parameters are normal fuzzy ... See full document

... the problem of achieving minimal stopping at the continuous caster can be considered as a distributed and coordinated scheduling ...a hybrid flow shop scheduling with serial batching at the last stage, the ... See full document

... Taking this into account, it is logical to argue that each vehicle must leave the central depot loaded in such a way that its COG would not vary greatly after each stop. This means that each block would have to be loaded ... See full document

... in solving TSP, such as Genetic Algorithm (GA) [2] [3], Simulated Annealing (SA) [4], Ant Colony Optimization (ACO) [5], Particle Swarm Optimization (PSO) [6], Tabu Search (TS) [7], Neural Net- work (NN) [8], and ... See full document

... evaluated using fuzzy logic and compared with the four well known handover algorithms using optimized handover parameters under three different speeds (10, 60, 120 km/hr) ... See full document

... in solving constrained and unconstrained problem? The field of the response methodology consist of the experimental strategy for exploring the space of the process or independent variables ,empirical ... See full document