2012
Authors
Fidalgo, JN; Fontes, DBMM;
Publication
ELECTRIC POWER SYSTEMS RESEARCH
Abstract
The large-scale integration of microgeneration (MG) can bring several technical benefits, such as: improving the voltage profile, reducing power losses and allowing for network capacity investment deferral. Furthermore, it is now widely accepted that introducing new renewable MG, such as wind turbines, photovoltaic panels or biomass can help control carbon emissions, reduce our dependence on oil and contribute to a sustainable energy growth. This paper presents an empirical analysis of the benefits of MG on avoided losses, voltage profiles and branch congestion. The main goal is to clarify whether the current regulatory framework allows for obtaining all the MG potential gains. The main conclusion is that some legal constraints should be removed, or at least relaxed, in order to promote the growth of distributed power generation, particularly, for domestic MG.
2024
Authors
Fontes, DBMM; Homayouni, SM; Fernandes, JC;
Publication
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Abstract
This work extends the energy-efficient job shop scheduling problem with transport resources by considering speed adjustable resources of two types, namely: the machines where the jobs are processed on and the vehicles that transport the jobs around the shop-floor. Therefore, the problem being considered involves determining, simultaneously, the processing speed of each production operation, the sequence of the production operations for each machine, the allocation of the transport tasks to vehicles, the travelling speed of each task for the empty and for the loaded legs, and the sequence of the transport tasks for each vehicle. Among the possible solutions, we are interested in those providing trade-offs between makespan and total energy consumption (Pareto solutions). To that end, we develop and solve a bi-objective mixed-integer linear programming model. In addition, due to problem complexity we also propose a multi-objective biased random key genetic algorithm that simultaneously evolves several populations. The computational experiments performed have show it to be effective and efficient, even in the presence of larger problem instances. Finally, we provide extensive time and energy trade-off analysis (Pareto front) to infer the advantages of considering speed adjustable machines and speed adjustable vehicles and provide general insights for the managers dealing with such a complex problem.
2023
Authors
Fontes, DBMM; Homayouni, SM;
Publication
FLEXIBLE SERVICES AND MANUFACTURING JOURNAL
Abstract
This work formulates a mixed-integer linear programming (MILP) model and proposes a bi-objective multi-population biased random key genetic algorithm (mp-BRKGA) for the joint scheduling of quay cranes and speed adjustable vehicles in container terminals considering the dual-cycling strategy. Under such a strategy, a combination of loading and unloading containers are handled by a set of cranes (moved between ships and vehicles) and transported by a set of vehicles (transported between the quayside and the storage area). The problem consists of four components: crane scheduling, vehicle assignment, vehicle scheduling, and speed assignment both for empty and loaded journey legs. The results show that an approximated true Pareto front can be found by solving the proposed MILP model and that the mp-BRKGA finds uniformly distributed Pareto fronts, close to the true ones. Additionally, the results clearly demonstrate the advantages of considering speed adjustable vehicles since both the makespan and the energy consumption can be considerably reduced.
2023
Authors
Homayouni, SM; Fontes, DBMM; Fontes, FACC;
Publication
PROCEEDINGS OF THE 2023 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION, GECCO 2023 COMPANION
Abstract
This paper addresses the joint scheduling of production operations, transport tasks, and storage/retrieval activities in flexible job shop systems where the production operations and transport tasks can be done by one of the several resources available. Jobs need to be retrieved from storage and delivered to a load/unload area, from there, they are transported to and between the machines where their operations are processed on. Once all operations of a job are processed, the job is taken back to the load/unload area and then returned to the storage cell. Therefore, the problem under study requires, concurrently, solving job routing, machine scheduling, transport allocation, vehicle scheduling, and shuttle schedule. To this end, we propose a hybrid biased random-key genetic algorithm (BRKGA) in which the mutation operator resorts to six local search heuristics. The computational experiments conducted on a set of benchmark instances show the effectiveness of the proposed mutation operator.
2023
Authors
Homayuni, SM; Fontes, DBMM; Fontes, FACC;
Publication
Proceedings of the Companion Conference on Genetic and Evolutionary Computation
Abstract
2023
Authors
Homayouni, SM; Fontes, DBMM;
Publication
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Abstract
This paper addresses a job shop scheduling problem with peak power constraints, in which jobs can be processed once or multiple times on either all or a subset of the machines. The latter characteristic provides additional flexibility, nowadays present in many manufacturing systems. The problem is complicated by the need to determine both the operation sequence and starting time as well as the speed at which machines process each operation. Due to the adherence to renewable energy production and its intermittent nature, manufacturing companies need to adopt power-flexible production schedules. The proposed power control strategies, that is, adjusting processing speed and timing to reduce peak power requirements may impact production time (makespan) and energy consumption. Therefore, we propose a bi-objective approach that minimizes both objectives. A linear programming model is developed to provide a formal statement of the problem, which is solved to optimality for small-sized instances. We also proposed a multi-objective biased random key genetic algorithm framework that evolves several populations in parallel. Computational experiments provide decision and policymakers with insights into the implications of imposing or negotiating power consumption limits. Finally, the several trade-off solutions obtained show that as the power limit is lowered, the makespan increases at an increasing rate and a similar trend is observed in energy consumption but only for very small makespan values. Furthermore, peak power demand reductions of about 25% have a limited impact on the minimum makespan value (4-6% increase), while at the same time allowing for a small reduction in energy consumption.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.