Recursos de colección

RiuNet. Repositorio institucional de la Universitat de Valencia (99.709 recursos)

RiuNet es el Repositorio Institucional de la Universitat Politècnica de València, gestionado por la Biblioteca, cuyo objetivo es ofrecer acceso en Internet a la producción científica, académica y corporativa de la comunidad universitaria con la finalidad de aumentar su visibilidad y hacerla accesible y preservable.

Mostrando recursos 1 - 3 de 3

  1. Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System

    Yousefikhoshbakht, Majid; Malekzadeh, Nasrin; Sedighpour, Mohammad
    [EN] The TSP is considered one of the most well-known combinatorial optimization tasks and researchers have paid so much attention to the TSP for many years. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The objective is to minimize the total distance traveled by the salesman.  Because this problem is a non-deterministic polynomial (NP-hard) problem in nature, a hybrid meta-heuristic algorithm called REACSGA is used for solving the TSP. In REACSGA, a reactive bone route algorithm that uses the ant colony...
    - 29-mar-2018

  2. Hybrid genetic algorithms: solutions in realistic dynamic and setup dependent job-shop scheduling problems

    Branco, Rogério M.; Coelho, Antônio S.; Mayerle, Sérgio F.
    [EN] This paper discusses the application of heuristic-based evolutionary technique in search for solutions concerning the dynamic job-shop scheduling problems with dependent setup times and alternate routes. With a combinatorial nature, these problems belong to an NP-hard class, with an aggravated condition when in realistic, dynamic and therefore, more complex cases than the traditional static ones. The proposed genetic algorithm executes two important functions: choose the routes using dispatching rules when forming each individual from a defined set of available machines and, also make the scheduling for each of these individuals created. The chromosome codifies a route, or the selected...
    - 29-mar-2018

  3. Flow shop scheduling decisions through Techniques for Order Preference by Similarity to an Ideal Solution (TOPSIS)

    Gupta, Arun; Kumar, Shailendra
    [EN] The flow-shop scheduling problem (FSP) has been widely studied in the literature and having a very active research area. Over the last few decades, a number of heuristic/meta-heuristic solution techniques have been developed. Some of these techniques offer excellent effectiveness and efficiency at the expense of substantial implementation efforts and being extremely complicated. This paper brings out the application of a Multi-Criteria Decision Making (MCDM) method known as techniques for order preference by similarity to an ideal solution (TOPSIS) using different weighting schemes in flow-shop environment. The objective function is identification of a job sequence which in turn would...
    - 29-mar-2018

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.