RESUMO
In many countries, there is an energy pricing policy that varies according to the time-of-use. In this context, it is financially advantageous for the industries to plan their production considering this policy. This article introduces a new bi-objective unrelated parallel machine scheduling problem with sequence-dependent setup times, in which the objectives are to minimize the makespan and the total energy cost. We propose a mixed-integer linear programming formulation based on the weighted sum method to obtain the Pareto front. We also developed an NSGA-II method to address large instances of the problem since the formulation cannot solve it in an acceptable computational time for decision-making. The results showed that the proposed NSGA-II is able to find a good approximation for the Pareto front when compared with the weighted sum method in small instances. Besides, in large instances, NSGA-II outperforms, with 95% confidence level, the MOGA and NSGA-I multi-objective techniques concerning the hypervolume and hierarchical cluster counting metrics. Thus, the proposed algorithm finds non-dominated solutions with good convergence, diversity, uniformity, and amplitude.
RESUMO
Sizing and allocating health-care professionals are a critical problem in the management of emergency departments (EDs) managed by a public company in Rio de Janeiro (Brazil). An efficient ED configuration that is cost and time effective must be developed by this company for hospital managers. In this paper, the problem of health-care professional configurations in EDs is modelled to minimise the total labour cost while satisfying patient queues and waiting times as defined by the actual ED capacity and current clinical protocols. To solve this issue, mixed integer linear programming (MILP) that allocates health-care professionals and specifies the amount of professionals who must be hired is proposed. To consider the uncertainties in this environment and evaluate their impacts, a discrete-event simulation model is developed to reflect patient flow. An optimisation and simulation approach is used to search for efficiency leads for different ED configurations. These configurations change depending on the shift and the day of the week.
RESUMO
The mining industry is one of the world's massive scrap off-the-road (OTR) tire generators. Reverse logistics (RL) allows for a cost-effective treatment of residual items with environmentally friendly practices. This paper aims to design a RL network for large OTR tires discarded from scattered mining sites, which requires a substantial initial investment in tire downsizing equipment. Therefore, the on-site use of a single shared shredding resource set is proposed with a schedule of visits between mines. Our contribution is a mixed-integer linear programming model set to determine the OTR tires optimal network, including decisions regarding a tire-fuelled power plant location, tire shredding and transport amounts, and a shredding resource set schedule to maximize the profits of the RL network while considering whole waste tire stockpile limits per year. Results showed that the proposed RL network starting from mine shredding tires and supplying a power generation plant might be a profitable solution that could help mines to comply with the legal regulations and turn this waste into a positive economic value good. Environmental and social implications are the mitigation of scrap tires, an increased job demand triggered by power plants, and public health improvement in the vicinity of the mining sites.
Assuntos
Programação Linear , Custos e Análise de CustoRESUMO
In the fog computing paradigm, fog nodes are placed on the network edge to meet end-user demands with low latency, providing the possibility of new applications. Although the role of the cloud remains unchanged, a new network infrastructure for fog nodes must be created. The design of such an infrastructure must consider user mobility, which causes variations in workload demand over time in different regions. Properly deciding on the location of fog nodes is important to reduce the costs associated with their deployment and maintenance. To meet these demands, this paper discusses the problem of locating fog nodes and proposes a solution which considers time-varying demands, with two classes of workload in terms of latency. The solution was modeled as a mixed-integer linear programming formulation with multiple criteria. An evaluation with real data showed that an improvement in end-user service can be obtained in conjunction with the minimization of the costs by deploying fewer servers in the infrastructure. Furthermore, results show that costs can be further reduced if a limited blocking of requests is tolerated.
RESUMO
RESUMEN Se presenta un método para la solución del problema de ruteo de mensajeros en motocicleta con ventanas de tiempo. En este se identifican dos fases: en la primera, se conforman grupos de clientes, cada grupo es asignado a una ruta y cada ruta es atendida por un vehículo; en la segunda, por medio de un modelo de programación lineal entera mixta, se hace un ruteo para cada una de las agrupaciones respetando las ventanas de tiempo estrictas de algunos clientes. Para validar el método, se utilizó como caso de estudio el área de mensajería de un centro de servicios compartidos de Cali, Colombia. Los resultados muestran que, al probar diferentes métodos de agrupación (fase 1), no se influye de forma significativa en el tiempo total de permanencia del vehículo en la ruta; en cambio, una reagrupación de los clientes después del ruteo (fase 2), mejora considerablemente la duración total de la ruta, aunque en algunos casos, aumenta la distancia recorrida por el vehículo.
ABSTRACT In this work, a method to solve a motorcycle messenger routing problem with time windows is presented. This has two phases: in the first one, clusters of clients are formed, each group is assigned to a route and each route is served by a vehicle; in the second phase, through a mixed integer linear programming model the routing for each cluster is made while respecting hard time windows of some clients. To validate the method, the mail delivery section of a shared service center in Cali - Colombia is used as case study The results show that, when testing different clustering methods (phase l) these do not significantly influence the vehicle's duration on the road; On the other hand, regrouping the clients after routing (phase 2) can considerably improve the total duration of the route, although in some cases, increasing the distance traveled by the vehicle.
RESUMO Neste trabalho se apresenta um método para a solução do problema de roteiro de mensageiros de motocicleta com janelas de tempo. Nele identificam-se duas fases: na primeira, conformam-se grupos de clientes, cada grupo é atribuído a uma rota e cada uma delas é servida por um veículo; na segunda, por meio de um modelo de programação linear todo misto, faz-se um roteiro para cada uma das agrupações respeitando as janelas de tempo estritas de alguns clientes. Para validar o método, usou-se como caso de estudo a área de mensageria de um centro de serviços compartilhados na cidade de Cali, na Colômbia. Os resultados mostram que ao testar diferentes métodos de agrupamento (fase l), não influem de maneira significativa no tempo total de permanência do veículo na rota; por outro lado, um reagrupamento dos clientes após do roteiro (fase 2), melhora consideravelmente a duração total do percurso, porém em alguns casos, aumenta a distância percorrida pelo veículo.
RESUMO
Reduced-impact logging is a well known practice applied in most sustainable forest management plans in the Amazon. Nevertheless, there are still ways to improve the operational planning process. Therefore, the aim of this study was to create an integer linear programming (ILP) to fill in the knowledge gaps in the decision support system of reduced impact logging explorations. The minimization of harvest tree distance to wood log landing was assessed. Forest structure aspects, income and wood production were set in the model, as well as the adjacency constraints. Data are from a dense ombrophylous forest in the western Brazilian Amazon. We applied the phytosociological analysis and BDq method to define the selective logging criteria. Then, ILP models were formulated to allow the application of the constraints. Finally, 32 scenarios (unbalanced forest, UF, and balanced forest, BF) were generated and compared with real executed plans (RE). Robust results were achieved and the expected finding of each scenario was met. The feasibility to integrate ILP models in uneven-aged forest management projects was endorsed. Consequently, the UF and BF scenarios tested were efficient and concise, introducing new advances for forest management plans in the Amazon. The proposed models have a high potential to improve the selective logging activities in the Amazon forest.(AU)
A exploração de impacto reduzido é uma prática bem conhecida e aplicada na maioria dos planos de manejo florestal sustentável na Amazônia. Todavia, ainda há a possibilidade de melhoria do processo de planejamento da operação. Diante da falta de métodos auxiliares à tomada de decisão, o objetivo do trabalho foi desenvolver modelos de programação linear inteira (PLI) para suprir esta demanda. Considerou-se a minimização da distância entre as árvores exploradas e os pátios de estocagem de madeira. Aspectos estruturais, econômicos e produtivos foram incorporados ao modelo, bem como restrições de adjacência. Os dados derivam de uma floresta ombrófila densa na Amazônia Ocidental. Previamente, utilizou-se uma análise fitossociológica e o método BDq como critério de remoção. Posteriormente, modelos de PLI foram formulados para exemplificar as aplicações. Finalmente, 32 cenários (para floresta desbalaceada, UF, e floresta balanceada, BF) foram gerados e comparados com o plano executado no campo (RE). Resultados robustos foram obtidos e atenderam às expectativas de cada cenário. A viabilidade da integração dos modelos de PLI em projetos de manejo de florestas ineqüiâneas foi testado. Os cenários UF e BF testados foram eficientes e concisos, confirmando seu potencial para aumentar a eficiência de planos de exploração madeireira e manejo florestal na Amazônia.(AU)
Assuntos
Florestas , Madeira , Exploração de Recursos Naturais/métodos , Programação Linear , BrasilRESUMO
ABSTRACT Reduced-impact logging is a well known practice applied in most sustainable forest management plans in the Amazon. Nevertheless, there are still ways to improve the operational planning process. Therefore, the aim of this study was to create an integer linear programming (ILP) to fill in the knowledge gaps in the decision support system of reduced impact logging explorations. The minimization of harvest tree distance to wood log landing was assessed. Forest structure aspects, income and wood production were set in the model, as well as the adjacency constraints. Data are from a dense ombrophylous forest in the western Brazilian Amazon. We applied the phytosociological analysis and BDq method to define the selective logging criteria. Then, ILP models were formulated to allow the application of the constraints. Finally, 32 scenarios (unbalanced forest, UF, and balanced forest, BF) were generated and compared with real executed plans (RE). Robust results were achieved and the expected finding of each scenario was met. The feasibility to integrate ILP models in uneven-aged forest management projects was endorsed. Consequently, the UF and BF scenarios tested were efficient and concise, introducing new advances for forest management plans in the Amazon. The proposed models have a high potential to improve the selective logging activities in the Amazon forest.
RESUMO A exploração de impacto reduzido é uma prática bem conhecida e aplicada na maioria dos planos de manejo florestal sustentável na Amazônia. Todavia, ainda há a possibilidade de melhoria do processo de planejamento da operação. Diante da falta de métodos auxiliares à tomada de decisão, o objetivo do trabalho foi desenvolver modelos de programação linear inteira (PLI) para suprir esta demanda. Considerou-se a minimização da distância entre as árvores exploradas e os pátios de estocagem de madeira. Aspectos estruturais, econômicos e produtivos foram incorporados ao modelo, bem como restrições de adjacência. Os dados derivam de uma floresta ombrófila densa na Amazônia Ocidental. Previamente, utilizou-se uma análise fitossociológica e o método BDq como critério de remoção. Posteriormente, modelos de PLI foram formulados para exemplificar as aplicações. Finalmente, 32 cenários (para floresta desbalaceada, UF, e floresta balanceada, BF) foram gerados e comparados com o plano executado no campo (RE). Resultados robustos foram obtidos e atenderam às expectativas de cada cenário. A viabilidade da integração dos modelos de PLI em projetos de manejo de florestas ineqüiâneas foi testado. Os cenários UF e BF testados foram eficientes e concisos, confirmando seu potencial para aumentar a eficiência de planos de exploração madeireira e manejo florestal na Amazônia.