Search

Copyright of Obras y Proyectos is the property of Universidad Catolica de la Santisima Concepcion and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Lámpsakos is the property of Fundacion Universitaria Luis Amigo, Facultad de Ingenierias and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this study we considered the optimization problem that integrates the logistics operations of location, routing and multiperiod inventory in a two echelon distribution network, named 2eLIRP. In this paper we propose a new hybrid metaheuristic based on Tabu search, genetic algorithms and the nearest neighbor heuristic. The performances of our technique was compared with classics metaheuristics and the results of the experiments carried out in 96.67% were better. [ABSTRACT FROM AUTHOR]

Copyright of Nova Scientia is the property of Nova Scientia and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Revista Facultad de Ingeniería - UPTC is the property of Universidad Pedagogica y Tecnologica de Colombia, Facultad de Ingenieria and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The present paper discusses the fleet distribution side of the Ship Routing and Scheduling problem combining factors of tactical and operative levels for an industrial service of maritime transportation of cargoes. A mathematical model based on the Generalized Bin Packing Problem wasused, which issupportedin the Local Search algorithm with first ascent and restart, to guarantee the solution of big instances that make computationally untreatable the problem. Through experimentation, it was determined that the best results were obtained by modifying 3 bits in the allocation matrix of ships by transport directions. In addition,a restart parameter was set based in the iterations quantity, so it remarkable improves de exploration process of the algorithm. The variation of the algorithm proposed, allows to obtain acce [ABSTRACT FROM AUTHOR]

In this paper is analyzed and modeled the problem of discovery process models, in order to apply metaheuristic algorithms based on a point and populations. There are two main reasons for the growing interest to improving the efficiency of the discovery algorithms in process mining. First or all, the information systems, that support business processes in organizations, record the details of the executions. These contain a potential knowledge for decision making. In addition to the growing need to support business processes in competitive and rapidly changing environments. In order to meet the objective of this work that is selected best suited metaheuristics algorithms to the problem: The Hill Climbing and Evolutionary Strategy. The main contribution consists in modeling a first approach to the problem of finding models using metaheuristic strategies. [ABSTRACT FROM AUTHOR]