94 research outputs found
Multiobjective electric vehicle charging station locations in a city scale area: Malaga study case.
This article presents a multiobjective variation of the problem of locating electric vehicle charging stations (EVCS) in a city known as the Multiobjective Electric Vehicle Charging Stations Locations (MO-EVCS-L) problem. MO-EVCS-L considers two conflicting objectives: maximizing the quality of service of the charging station network and minimizing the deployment cost when installing different types of charging stations. Two multiobjective metaheuristics are proposed to address MO-EVCS-L: the Non-dominated Sorting Genetic Algorithm, version II (NSGA-II) and the Strength Pareto Evolutionary Algorithm, version 2 (SPEA2). The experimental analysis is performed on a real-world case study defined in Malaga, Spain, and it compares the proposed approaches with a baseline algorithm. Results show that the SPEA2 computes the most competitive solutions, even though both metaheuristics found an accurate set of solutions that provide different trade-offs between the quality of service and the installation costs.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech
An Allocation-Routing Optimization Model for Integrated Solid Waste Management
Integrated smart waste management (ISWM) is an innovative and technologically advanced approach to managing and collecting waste. It is based on the Internet of Things (IoT) technology, a network of interconnected devices that communicate and exchange data. The data collected from IoT devices helps municipalities to optimize their waste management operations. They can use the information to schedule waste collections more efficiently and plan their routes accordingly. In this study, we consider an ISWM framework for the collection, recycling, and recovery steps to improve the performance of the waste system. Since ISWM typically involves the collaboration of various stakeholders and is affected by different sources of uncertainty, a novel multi-objective model is proposed to maximize the probabilistic profit of the network while minimizing the total travel time and transportation costs. In the proposed model, the chance-constrained programming approach is applied to deal with the profit uncertainty gained from waste recycling and recovery activities. Furthermore, some of the most proficient multi-objective meta-heuristic algorithms are applied to address the complexity of the problem. For optimal adjustment of parameter values, the Taguchi parameter design method is utilized to improve the performance of the proposed optimization algorithm. Finally, the most reliable algorithm is determined based on the Best Worst Method (BWM)
Solving the Integrated Bin Allocation and Collection Routing Problem for Municipal Solid Waste: a Benders Decomposition Approach
The municipal solid waste system is a complex reverse logistic chain which
comprises several optimisation problems. Although these problems are
interdependent, i.e., the solution to one of the problems restricts the
solution to the other, they are usually solved sequentially in the related
literature because each is usually a computationally complex problem. We
address two of the tactical planning problems in this chain by means of a
Benders decomposition approach: determining the location and/or capacity of
garbage accumulation points, and the design and schedule of collection routes
for vehicles. Our approach manages to solve medium-sized real-world instances
in the city of Bah\'{i}a Blanca, Argentina, showing smaller computing times
than solving a full MIP model.Comment: 29 pages, 6 figure
A Multi Objective Evolutionary Algorithm based on Decomposition for a Flow Shop Scheduling Problem in the Context of Industry 4.0
Under the novel paradigm of Industry 4.0, missing operations have arisen as a result of the increasingly customization of the industrial products in which customers have an extended control over the characteristics of the final products. As a result, this has completely modified the scheduling and planning management of jobs in modern factories. As a contribution in this area, this article presents a multi objective evolutionary approach based on decomposition for efficiently addressing the multi objective flow shop problem with missing operations, a relevant problem in modern industry. Tests performed over a representative set of instances show the competitiveness of the proposed approach when compared with other baseline metaheuristics.Fil: Rossit, Diego Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería; ArgentinaFil: Nesmachnow, Sergio. Universidad de la República; UruguayFil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería; Argentin
Routing in waste collection: a simulated annealing algorithm for an Argentinean case study
The management of the collection of Municipal Solid Waste is a complex task for local governments since it consumes a large portion of their budgets. Thus, the use of computer-aided tools to support decision-making can contribute to improve the efficiency of the system and reduce the associated costs, especially in developing countries, which usually suffer from a shortage of resources. In the present work, a simulated annealing algorithm is proposed to address the problem of designing the routes of waste collection vehicles. The proposed algorithm is compared to a commercial solver based on a mixed-integer programming formulation and two other metaheuristic algorithms, i.e., a state-of-the-art large neighborhood search and a genetic algorithm. The evaluation is carried out on both a well-known benchmark from the literature and real instances of the Argentinean city of Bahía Blanca. The proposed algorithm was able to solve all the instances, having a performance similar to the large neighborhood procedure, while the genetic algorithm showed the worst results. The simulated annealing algorithm was also able to improve the solutions of the solver in many instances of the real dataset.Fil: Rossit, Diego Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería; ArgentinaFil: Toncovich, Adrián Andrés. Universidad Nacional del Sur. Departamento de Ingeniería; ArgentinaFil: Fermani, Matías. Universidad Nacional del Sur. Departamento de Ingeniería; Argentin
Facility Location Problems: Models, Techniques, and Applications in Waste Management
This paper presents a brief description of some existing models of facility location problems
(FLPs) in solid waste management. The study provides salient information on commonly used
distance functions in location models along with their corresponding mathematical formulation. Some
of the optimization techniques that have been applied to location problems are also presented along
with an appropriate pseudocode algorithm for their implementation. Concerning the models and
solution techniques, the survey concludes by summarizing some recent studies on the applications
of FLPs to waste collection and disposal. It is expected that this paper will contribute in no small
measure to an integrated solid waste management system with specific emphasis on issues associated
with waste collection, thereby boosting the drive for e�ective and e�cient waste collection systems.
The content will also provide early career researchers with some necessary starting information
required to formulate and solve problems relating to FLP
Advances on Smart Cities and Smart Buildings
Modern cities are facing the challenge of combining competitiveness at the global city scale and sustainable urban development to become smart cities. A smart city is a high-tech, intensive and advanced city that connects people, information, and city elements using new technologies in order to create a sustainable, greener city; competitive and innovative commerce; and an increased quality of life. This Special Issue collects the recent advancements in smart cities and covers different topics and aspects
Optimizing Integrated Municipal Solid Waste Management System under Multiple Uncertainties
To define a holistic and systematic approach to municipal waste management, an integrated municipal solid waste management (IMSWM) system is proposed. This system includes functional elements of waste generation, source handling, and processing, waste collection, waste processing at facilities, transfer, and disposal. Multi-objective optimization algorithms are used to develop an optimum IMSWM that can satisfy all main pillars of sustainable development, aiming to minimize the total cost of the system (economic), and minimize the total greenhouse gas emissions (environmental), while maximizing the total social suitability of the system (social). For the social objective, the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) method is used to identify the main parameters that affect the social suitability of the system.
This research focuses on developing an optimized holistic model that considers all four main components of a modern IMSWM namely transfer, recycling, treatment, and disposal.
The model is formulated as a mixed-integer linear programming (MILP) problem and solved using the epsilon constraint handling method. A metaheuristic method is developed using non dominated sorting genetic algorithm (NSGA) to deal with larger problems. A solution repair function is developed to handle several equality constraints included in the proposed IMSWM model. Sensitivity analyses are conducted to identify the effect of changes in parameters on the objective functions. Based on the results, the proposed metaheuristic algorithm based on NSGA-II performed better than other algorithms. The interval-parameter programming (IPP) methods are used to consider various uncertainties that exist in the system.
The model is applied to the case study of the Australian capital territory (ACT). The data is gathered from several resources including Australian national waste reports, and ACT government transport Canberra and city services (TCCS). Based on the waste characteristic and city map several feasible scenarios are recommended.
Several non-dominated solutions are identified for the model that the decision-maker can choose the most desirable solution based on the preferences. Based on the importance of any objective function at any time the decision-maker can choose a solution to suit the needs
From metaheuristics to learnheuristics: Applications to logistics, finance, and computing
Un gran nombre de processos de presa de decisions en sectors estratègics com el transport i la producció representen problemes NP-difícils. Sovint, aquests processos es caracteritzen per alts nivells d'incertesa i dinamisme. Les metaheurístiques són mètodes populars per a resoldre problemes d'optimització difícils en temps de càlcul raonables. No obstant això, sovint assumeixen que els inputs, les funcions objectiu, i les restriccions són deterministes i conegudes. Aquests constitueixen supòsits forts que obliguen a treballar amb problemes simplificats. Com a conseqüència, les solucions poden conduir a resultats pobres. Les simheurístiques integren la simulació a les metaheurístiques per resoldre problemes estocàstics d'una manera natural. Anàlogament, les learnheurístiques combinen l'estadística amb les metaheurístiques per fer front a problemes en entorns dinàmics, en què els inputs poden dependre de l'estructura de la solució. En aquest context, les principals contribucions d'aquesta tesi són: el disseny de les learnheurístiques, una classificació dels treballs que combinen l'estadística / l'aprenentatge automàtic i les metaheurístiques, i diverses aplicacions en transport, producció, finances i computació.Un gran número de procesos de toma de decisiones en sectores estratégicos como el transporte y la producción representan problemas NP-difíciles. Frecuentemente, estos problemas se caracterizan por altos niveles de incertidumbre y dinamismo. Las metaheurísticas son métodos populares para resolver problemas difíciles de optimización de manera rápida. Sin embargo, suelen asumir que los inputs, las funciones objetivo y las restricciones son deterministas y se conocen de antemano. Estas fuertes suposiciones conducen a trabajar con problemas simplificados. Como consecuencia, las soluciones obtenidas pueden tener un pobre rendimiento. Las simheurísticas integran simulación en metaheurísticas para resolver problemas estocásticos de una manera natural. De manera similar, las learnheurísticas combinan aprendizaje estadístico y metaheurísticas para abordar problemas en entornos dinámicos, donde los inputs pueden depender de la estructura de la solución. En este contexto, las principales aportaciones de esta tesis son: el diseño de las learnheurísticas, una clasificación de trabajos que combinan estadística / aprendizaje automático y metaheurísticas, y varias aplicaciones en transporte, producción, finanzas y computación.A large number of decision-making processes in strategic sectors such as transport and production involve NP-hard problems, which are frequently characterized by high levels of uncertainty and dynamism. Metaheuristics have become the predominant method for solving challenging optimization problems in reasonable computing times. However, they frequently assume that inputs, objective functions and constraints are deterministic and known in advance. These strong assumptions lead to work on oversimplified problems, and the solutions may demonstrate poor performance when implemented. Simheuristics, in turn, integrate simulation into metaheuristics as a way to naturally solve stochastic problems, and, in a similar fashion, learnheuristics combine statistical learning and metaheuristics to tackle problems in dynamic environments, where inputs may depend on the structure of the solution. The main contributions of this thesis include (i) a design for learnheuristics; (ii) a classification of works that hybridize statistical and machine learning and metaheuristics; and (iii) several applications for the fields of transport, production, finance and computing
- …