Loading...
2 results
Search Results
Now showing 1 - 2 of 2
- An Application of Preference-Inspired Co-Evolutionary Algorithm to SectorizationPublication . Ozturk, E. Goksu; Rocha, Pedro; Sousa, Filipe; Lima, Maria Margarida; Rodrigues, Ana Maria; Soeiro Ferreira, José; Catarina Nunes, Ana; Lopes, Isabel Cristina; Oliveira, CristinaSectorization problems have significant challenges arising from the many objectives that must be optimised simultaneously. Several methods exist to deal with these many-objective optimisation problems, but each has its limitations. This paper analyses an application of Preference Inspired Co-Evolutionary Algorithms, with goal vectors (PICEA-g) to sectorization problems. The method is tested on instances of different size difficulty levels and various configurations for mutation rate and population number. The main purpose is to find the best configuration for PICEA-g to solve sectorization problems. Performancemetrics are used to evaluate these configurations regarding the solutions’ spread, convergence, and diversity in the solution space. Several test trials showed that big and medium-sized instances perform better with low mutation rates and large population sizes. The opposite is valid for the small size instances.
- Creating homogeneous sectors: criteria and applications of sectorizationPublication . Lopes, Isabel Cristina; Lima, Maria Margarida; Ozturk, E. Goksu; Rodrigues, Ana Maria; Nunes, Ana Catarina; Oliveira, Cristina; Soeiro Ferreira, José; Rocha, PedroSectorization is the process of grouping a set of previously defined basic units (points or small areas) into a fixed number of sectors. Sectorization is also known in the literature as districting or territory design, and is usually performed to optimize one or more criteria regarding the geographic characteristics of the territory and the planning purposes of sectors. The most common criteria are equilibrium, compactness and contiguity, which can be measured in many ways. Sectorization is similar to clustering but with a different motivation. Both aggregate smaller units into groups. But, while clustering strives for inner similarity of data, sectorization aims at outer homogeneity [1]. In clustering, groups should be very different from each other, and similar points are classified in the same cluster. In sectorization, groups should be very similar to each other, and therefore very different points can be grouped in the same sector. We classify sectorization problems into four types: basic sectorization, sectorization with service centers, resectorization, and dynamic sectorization. A Decision Support System for Sectorization, D3S, is being developed to deal with these four types of problems. Multi-objective genetic algorithms were implemented in D3S using Python, and a user-friendly web interface was developed using Django. Several applications can be solved with D3S, such as political districting, sales territory design, delivery service zones, and assignment of fire stations and health services to the population.