Abstract
Sectorization is the division of a large area, territory or network into smaller parts considering one or more objectives. Dynamic sectorization deals with situations where it is convenient to discretize the time horizon in a certain number of periods. The decisions will not be isolated, and they will consider the past. The application areas are diverse and increasing due to uncertain times. This work proposes a conceptualization of dynamic sectorization and applies it to a distribution problem with variable demand. Furthermore, Genetic Algorithm is used to obtain solutions for the problem since it has several criteria; Analytical Hierarchy Process is used for the weighting procedure. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Abstract
Sectorization is concerned with dividing a large territory into smaller areas, also known as sectors. This process usually simplifies a complex problem, leading to easier solution approaches to solving the resulting subproblems. Sectors are built with several criteria in mind, such as equilibrium, compactness, contiguity, and desirability, which vary with the applications. Sectorization appears in different contexts: sales territory design, political districting, healthcare logistics, and vehicle routing problems (agrifood distribution, winter road maintenance, parcel delivery). Environmental problems can also be tackled with a sectorization approach; for example, in municipal waste collection, water distribution networks, and even in finding more sustainable transportation routes. This work focuses on sectorization concerning the location of the area's centers and allocating basic units to each sector. Integer programming models address the location-allocation problems, and various formulations implementing different criteria are compared. Methods to deal with multiobjective optimization problems, such as the e-constraint, the lexicographic, and the weighted sum methods, are applied and compared. Computational results obtained for a set of benchmarking instances of sectorization problems are also presented.

Abstract

Abstract
Sectorisation refers to dividing a whole into smaller parts, the sectors, to facilitate an activity or achieve some goals. The paper proposes a new matrix form genetic encoding system, called matrix form binary grouping (MFBG), specifically designed for sectorisation and related problems. In MFBG representation, the columns and rows represent sectors and nodes, respectively. As a solution procedure, we followed NSGA-II by contemplating adapted measures for three commonly used criteria (equilibrium, compactness, contiguity) for sectorisation problems. The performance of the MFBG within the NSGA-II is tested from two perspectives: 1) through several experiments on the set of instances; 2) by its comparison with the group-oriented genetic encoding system under the grouping GA. Results showed that the MFBG could find good quality solutions and outperforms the GGA. This confirms that the MFBG is an innovative procedure for dealing with sectorisation problems and an excellent contribution as an alternative encoding technique. © 2023 Inderscience Enterprises Ltd.

Abstract
Martial arts (MAs) are a global training system that goes far beyond physical preparation and self-defence. They have been known for a long time, and their wisdom and impact are impressive. The paper illustrates matters about MAs which are relevant to decision making (DM). The recognition of the limitations of the sole dependence on physical ability (hard approaches) is a breakthrough in MAs. The pillars of body and technique are not enough to reach a global vision and overcome severe problems. MAs are committed to mastering faculties linked to intuition, emotions, and thought-free operations, signifying the pillar mind. These revelations have insightful implications for DM and the promptness in approaching the growing complexity of decision problems. Special attention is devoted to the mind, representing a soft paradigm, emphasising the human dimension, integrating intuition and complying with ethics. Finally, the paper delineates a MAs way to improve DM as science and art. © 2023 Inderscience Enterprises Ltd.. All rights reserved.

Abstract
Sectorization problems, also known as districting or territory design, deal with grouping a set of previously defined basic units, such as points or small geographical areas, into a fixed number of sectors or responsibility areas. Usually, there are multiple criteria to be satisfied regarding the geographic characteristics of the territory or the planning purposes. This work addresses a case study of parcel delivery services in the region of Porto, Portugal. Using knowledge about the daily demand in each basic unit (7-digit postal code), the authors analysed data and used it to simulate dynamically new daily demands according to the relative frequency of service in each basic unit and the statistical distribution of the number of parcels to be delivered in each basic unit. The sectorization of the postal codes is solved independently considering two objectives (equilibrium and compactness) using Non-dominated Sorting Genetic Algorithm-II (NSGA-II) implemented in Python.