Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm

  • Perea Rojas Marcos, Federico
  • Menezes, Mozart B. C.
  • Mesa, Juan A.
  • Rubio-Del-Rey, Fernando
[EN] In this paper we analyze the computational complexity of transportation infrastructure network design problems, in the presence of a competing transportation mode. Some of these problems have previously been introduced in the literature. All problems studied have a common objective: the maximization of the number of travelers using the new network to be built. The differences between them are due to two factors. The first one is the constraints that the new network should satisfy: (1) budget constraint, (2) no-cycle constraint, (3) both constraints. The second factor is the topology of the network formed by the feasible links and stations: (1) a general network, (2) a forest. By combining these two factors, in total we analyze six problems, five of them are shown to be NP-hard, the sixth being trivial. Due to the NP-hardness of these problems, a genetic algorithm is proposed. Computational experiments show the applicability of this algorithm., Mozart Menezes and Juan A. Mesa were partially supported by project MTM2015- 67706-P (MINECO/FEDER,UE). Federico Perea was partially supported by the Spanish Ministry of Science, Innovation, and Universities, under projects "OPTEP-Port Terminal Operations Optimization" (No. RTI2018-094940-B-I00) and MTM2016-74983, fnanced with FEDER funds, and by the Universitat Politècnica de València under grant SP20180164 of the program Primeros Proyectos de Investigaciòn (PAID-06-18), Vicerrectorado de Investigaciòn, Innovaciòn y Transferencia. All this support is gratefully acknowledged.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

GRASP algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources

  • Yepes-Borrero, Juan C.
  • Perea Rojas Marcos, Federico
  • Caballero-Villalobos, Juan Pablo
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
[EN] This paper provides practitioners with new approaches for solving realistic scheduling problems that consider additional resources, which can be implemented on expert and intelligent systems and help decision making in realistic settings. More specifically, we study the unrelated parallel machine scheduling problem with setup times and additional limited resources in the setups (UPMSR-S), with makespan minimization criterion. This is a more realistic extension of the traditional problem, in which the setups are assumed to be done without using additional resources (e.g. workers). We propose three metaheuristics following two approaches: a first approach that ignores the information about additional resources in the constructive phase, and a second approach that takes into account this information about the resources. Computational experiments are carried out over a benchmark of small and large instances. After the computational analysis we conclude that the second approach shows an excellent performance, overcoming the first approach., The first three authors would like to acknowledge the support from Spanish "Ministerio de Economia y competitividad" throughout grant number MTM2016-74983 and grant "SCHEYARD - Optimization of Scheduling Problems in Container Yards" (No. DPI2015-65895-R), financed by FEDER funds, the support from "Ministerio de Ciencia, Innovacion y Universidades" under grant "Optimizacion de Operaciones en Terminales Portuarias (OPTEP)" (No.RTI2018-094940-B-100). Thanks are also due to the Universitat Politecnica de Valencia under grant SP20180164 of the program Primeros Proyectos de Investigacion (PAID-06-18), Vicerrectorado de Investigacion, Innovacion y Transferencia. Juan C. Yepes-Borrero acknowledges financial support by the El Instituto Colombiano de Credit Educativo y Estudios Tecnicos en el Exterior - ICETEX under program Pasaporte a la ciencia - Doctorado. Special thanks are due to two anonymous referees for their valuable comments.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Bi-objective parallel machine scheduling with additional resources during setups

  • Yepes-Borrero, Juan C.
  • Perea, Federico
  • Ruiz García, Rubén
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
[EN] We present a bi-objective parallel machine scheduling problem with machine and job sequence dependent setup times, with the additional consideration of resources needed during setups. The availability of such resources is limited. This models many practical situations where setup times imply, for example, cleaning and/or the reconfiguration of productive equipment. These setups are performed by personnel, who are of course limited in number. The objectives considered are the minimization of the makespan and the minimization of the number of resources. Fewer available resources reduce production costs but inevitably increase the makespan. On the contrary, a greater number of resources increase costs but allow for more setups to be done in parallel and a reduced makespan. An algorithm based on iterated greedy approaches is proposed to search for the Pareto front of the problem. This algorithm is compared with state-of-the art methods adapted to the problem. Computational experiments, supported by statistical analyses, indicate that the proposed approach outperforms all other tested procedures., The authors would like to acknowledge the support from "Ministerio de Ciencia, Innovacion y Universidades" under grant "Optimizacion de Operaciones en Terminales Portuarias (OPTEP)" (No. RTI2018-094940-B-100) and grant MTM2016-74983, from the "Universitat Politecnica de Valencia" under grant SP20180164 of the program "Primeros Proyectos de Investigacion (PAID-06-18), Vicerrectorado de Investigacion, Innovacion y Transferencia", and from the "Generalitat Valenciana" under grant "NUevos REtos en SEcuenciacion"(No. AICO/2020/049). Juan C. Yepes-Borrero acknowledges financial support by "El Instituto Colombiano de Credito Educativo y Estudios Tecnicos en el Exterior - ICETEX" under program "Pasaporte a la ciencia - Doctorado", grant number 3568118.