Public deliberations are often a staple ingredient in community decision-making. However, traditional, time-constrained, in-person debates can become highly polarized, eroding trust in authorities, and leaving the community divided. This is the case in redistricting deliberations for public school zoning. Seeking alternative ways of support, we evaluated the potential introduction of an online platform that combines multiple streams of data, visualizes school attendance boundaries, and enables the manipulation of representations of land parcels. To capture multiple stakeholders' values about the potential to enhance public engagement in school rezoning decision-making through an online platform, we conducted interviews with 12 participants with previous experiences in traditional, in-person deliberations. Insights from the interviews highlight the several roles an online platform could take, especially as it provides alternative means of participation (online, synchronous, and asynchronous). Additionally, we discuss the potential for technology to increase the visibility and participation of multiple community actors in public deliberations and present implications for the design of future tools to support public decision-making.

The US public school system is administered by local school districts. Each district comprises a set of schools mapped to attendance zones which are annually assessed to meet enrollment objectives. To support school officials in redrawing attendance boundaries, existing approaches have proven promising but still suffer from several challenges, including: 1) inability to scale to large school districts, 2) high computational cost of obtaining compact school attendance zones, and 3) lack of discussion on quantifying ethical considerations underlying the redrawing of school boundaries. Motivated by these challenges, this paper approaches the school redistricting problem from both computational and ethical standpoints. First, we introduce a practical framework based on sampling methods to solve school redistricting as a graph partitioning problem. Next, the advantages of adopting a modified objective function for optimizing discrete geometry to obtain compact boundaries are examined. Lastly, alternative metrics to address ethical considerations in real-world scenarios are formally defined and thoroughly discussed. Our findings highlight the inclusiveness and efficiency advantages of the designed framework and depict how tradeoffs need to be made to obtain qualitatively different school redistricting plans.

Influence blocking maximization (IBM) is crucial in many critical real-world problems such as rumors prevention and epidemic containment. The existing work suffers from: (1) concentrating on uniform costs at the individual level, (2) mostly utilizing greedy approaches to approximate optimization, (3) lacking a proper graph representation for influence estimates. To address these issues, this research introduces a neural network model dubbed Neural Influence Blocking (\algo) for improved approximation and enhanced influence blocking effectiveness. The code is available at https://github.com/oates9895/NIB.

Modeling the spatiotemporal nature of the spread of infectious diseases can provide useful intuition in understanding the time-varying aspect of the disease spread and the underlying complex spatial dependency observed in people's mobility patterns. Besides, the county level multiple related time series information can be leveraged to make a forecast on an individual time series. Adding to this challenge is the fact that real-time data often deviates from the unimodal Gaussian distribution assumption and may show some complex mixed patterns. Motivated by this, we develop a deep learning-based time-series model for probabilistic forecasting called Auto-regressive Mixed Density Dynamic Diffusion Network (ARM3Dnet), which considers both people's mobility and disease spread as a diffusion process on a dynamic directed graph. The Gaussian Mixture Model layer is implemented to consider the multimodal nature of the realtime data while learning from multiple related time series. We show that our model, when trained with the best combination of dynamic covariate features and mixture components, can outperform both traditional statistical and deep learning models in forecasting the number of Covid-19 deaths and cases at the county level in the United States.

We propose a novel Evolutionary Algorithm (EA) based on the Differential Evolution algorithm for solving global numerical optimization problem in real-valued continuous parameter space. The proposed MadDE algorithm leverages the power of the multiple adaptation strategy with respect to the control parameters and search mechanisms, and is tested on the benchmark functions taken from the CEC 2021 special session & competition on single-objective bound-constrained optimization. Experimental results indicate that MadDE is able to achieve superior performance on global numerical optimization problems when compared against state-of-the-art real-parameter optimizers. We also provide a hyperparameter optimization algorithm SUBHO for improving the search performance of any EA by finding an optimal set of control parameters, and demonstrate its efficacy in enhancing MadDE's performance on the same benchmark. The source code of our implementation is publicly available at https://github.com/subhodipbiswas/MadDE.

Public school boundaries are redrawn from time to time to ensure effective functioning of school systems. This process, also called school redistricting, is non-trivial due to (1) the presence of multiple design criteria such as capacity utilization, proximity and travel time which are hard for planners to consider simultaneously, (2) the fixed locations of schools with widely differing capacities that need to be balanced, (3) the spatial nature of the data and the need to preserve contiguity in school zones, and (4) the difficulty in quantifying local factors that may arise. Motivated by these challenges and the intricacy of the process, we propose a geospatial clustering algorithm called GeoKmeans for assisting planners in designing school boundaries such that students are assigned to proximal schools while ensuring effective utilization of school capacities. The algorithm operates on polygonal geometries and connects them into geographically contiguous school boundaries while balancing problem-specific constraints. We evaluate our approach on real-world data of two rapidly growing school districts in the US. Results indicate the efficacy of our approach in designing boundaries. Additionally, a case study is included to demonstrate the potential of GeoKmeans to assist planners in drawing boundaries.

Spatial optimization problems (SOPs) are characterized by spatial relationships governing the decision variables, objectives and/or constraint functions. These are mostly combinatorial problems (NP-hard) due to the presence of discrete spatial units. Hence, exact optimization methods cannot solve them optimally under practical time constraints, especially for large-sized instances. Motivated by this challenge, we explore the use of population-based metaheuristics for solving SOPs. To this end, we observe that the search moves employed by these methods are suited to real-parameter continuous search space rather. To adapt them to the SOPs, we explore the role of domain knowledge in designing spatially-aware search operators that can efficiently search for an optimal solution in discrete search space while respecting the spatial constraints. These modifications result in a simple yet highly effective spatial hybrid metaheuristic called SPATIAL, which is applied to the problem of school boundary formation (also called school redistricting). Experimental findings on real-world datasets reveal the efficacy of our algorithm in obtaining superior quality solutions in comparison to traditional baseline methods. Additionally, we perform an in-depth study of the individual components of our framework and highlight the flexibility of our method in assimilating other search operators as well as in adapting it to related SOPs.

Traffic prediction is a challenging task due to the time-varying nature of traffic patterns and the complex spatial dependency of road networks. Adding to the challenge, there are a number of errors introduced in traffic sensor reporting, including bias and noise. However, most of the previous works treat the sensor observations as exact measures ignoring the effect of unknown noise. To model the spatial and temporal dependencies, existing studies combine graph neural networks (GNNs) with other deep learning techniques but their equal weighting of different dependencies limits the models' ability to capture the real dynamics in the traffic network. To deal with the above issues, we propose a novel deep learning framework called Deep Kalman Filtering Network (DKFN) to forecast the network-wide traffic state by modeling the self and neighbor dependencies as two streams, and their predictions are fused under the statistical theory and optimized through the Kalman filtering network. First, the reliability of each stream is evaluated using variances. Then, the Kalman filter is leveraged to properly fuse noisy observations in terms of their reliability. Experimental results reflect the superiority of the proposed method over baseline models on two real-world traffic datasets in the speed prediction task.

Due to constant shifts in population and changing demographics, school boundary processes take place to make adjustments to school attendance zones. This spatial problem has multiple criteria like locations of schools, their capacity utilization, proximity, presence of geographical/ man-made barriers, etc. In this paper, we formulate the problem of designing school boundaries as a spatially-constrained clustering/ regionalization problem and propose an automated approach called REGAL for solving it. REGAL is two-stage framework that starts by creating a candidate solution with regard to domain constraints such as school locations and spatial contiguity. Then a local search method improves the quality of the candidate solution by optimizing population balance and compactness of school zones while satisfying problem constraints. Experimentally, we demonstrate the efficacy of the REGAL framework on actual datasets from two school districts in the US.

In practical situations, it is very often desirable to detect multiple optimally sustainable solutions of an optimization problem. The population-based evolutionary multimodal optimization algorithms can be very helpful in such cases. They detect and maintain multiple optimal solutions during the run by incorporating specialized niching operations to aid the parallel localized convergence of population members around different basins of attraction. This paper presents an improved information-sharing mechanism among the individuals of an evolutionary algorithm for inducing efficient niching behavior. The mechanism can be integrated with stochastic real-parameter optimizers relying on differential perturbation of the individuals (candidate solutions) based on the population distribution. Various real-coded genetic algorithms (GAs), particle swarm optimization (PSO), and differential evolution (DE) fit the example of such algorithms. The main problem arising from differential perturbation is the unequal attraction toward the different basins of attraction that is detrimental to the objective of parallel convergence to multiple basins of attraction. We present our study through DE algorithm owing to its highly random nature of mutation and show how population diversity is preserved by modifying the basic perturbation (mutation) scheme through the use of random individuals selected probabilistically. By integrating the proposed technique with DE framework, we present three improved versions of well-known DE-based niching methods. Through an extensive experimental analysis, a statistically significant improvement in the overall performance has been observed upon integrating of our technique with the DE-based niching methods.

Time varying nature of the constraints, objectives and parameters that characterize several practical optimization problems have led to the field of dynamic optimization with Evolutionary Algorithms. In recent past, very few researchers have concentrated their efforts on the study of Dynamic multi-objective Optimization Problems (DMOPs) where the dynam-icity is attributed to multiple objectives of conflicting nature. Considering the lack of a somewhat diverse and challenging set of benchmark functions, in this article, we discuss some ways of designing DMOPs and propose some general techniques for introducing dynamicity in the Pareto Set and in the Pareto Front through shifting, shape variation, slope variation, phase variation, and several other types. We introduce 9 benchmark functions derived from the benchmark suite used for the 2009 IEEE Congress on Evolutionary Computation competition on bound-constrained and static MO optimization algorithms. Additionally a variant of multiobjective EA based on decomposition (MOEA/D) have been put forward and tested along with peer algorithms to evaluate the newly proposed benchmarks.

Group Counseling Optimizer (GCO) is a recently proposed population-based metaheuristics that simulates the ability of human beings to solve problems through counseling within a group. It is motivated by the fact that the human thinking ability is often predicted to be the most rational. This research article examines the performance of GCO on the benchmark test suite designed for the CEC 2014 Competition for Computational Expensive Optimization. Experimental results on 24 black-box optimization problems (8 test problems with 10, 20 and 30 dimensions) have been tabulated along with the algorithm complexity metrics. Additionally we investigate the parametric behavior of GCO based on these test instances.

In real life, we often need to find multiple optimally sustainable solutions of an optimization problem. Evolutionary multimodal optimization algorithms can be very helpful in such cases. They detect and maintain multiple optimal solutions during the run by incorporating specialized niching operations in their actual framework. Differential evolution (DE) is a powerful evolutionary algorithm (EA) well-known for its ability and efficiency as a single peak global optimizer for continuous spaces. This article suggests a niching scheme integrated with DE for achieving a stable and efficient niching behavior by combining the newly proposed parent-centric mutation operator with synchronous crowding replacement rule. The proposed approach is designed by considering the difficulties associated with the problem dependent niching parameters (like niche radius) and does not make use of such control parameter. The mutation operator helps to maintain the population diversity at an optimum level by using well-defined local neighborhoods. Based on a comparative study involving 13 well-known state-of-the-art niching EAs tested on an extensive collection of benchmarks, we observe a consistent statistical superiority enjoyed by our proposed niching algorithm.

This paper presents a novel search metaheuristic inspired from the physical interpretation of the optic flow of information in honeybees about the spatial surroundings that help them orient themselves and navigate through search space while foraging. The interpreted behavior combined with the minimal foraging is simulated by the artificial bee colony algorithm to develop a robust search technique that exhibits elevated performance in multidimensional objective space. Through detailed experimental study and rigorous analysis, we highlight the statistical superiority enjoyed by our algorithm over a wide variety of functions as compared to some highly competitive state-of-the-art methods.

Differential Evolution (DE), a rather new members of the evolutionary computing paradigm, has rose to widespread popularity in a short time interval owing to its simple design and robust performance in a wide variety of problems. Inspired from the effect of the teacher on the knowledge gained by the learners in a class, we propose a teaching and learning based self-adaptive DE (TLBSaDE) for solving real parameter optimization problems. A benchmark suite consisting of 28 test problems, proposed for the CEC 2013 Special Session and Competition on Real Parameter Optimization, is used. The results are obtained on 10, 30 and 50 dimensional problems.

Estimation of Distribution algorithms (EDAs) are probabilistic-model based optimization techniques that exploit promising solution candidates by developing particles around them in accordance to a pre-specified distribution. This paper attempts to approach constrained optimization problems by an interdependent parallel functioning of a modified Gaussian distribution based EDA with differential mutation on the lines of rand/1 perturbation scheme. A modified penalty function free from scaling parameters has been proposed to deal with the constraints associated. The results have been collected from functional landscapes defined by the CEC 2010 benchmark and have been compared with existing state-of-the-art methods for constrained optimization.

In the real world, many problems are multimodal as well as dynamic. Such problems require optimizers which not only locate multiple optima in a single run but also track the changing optima positions in the dynamic environments. In this paper a niching parameter free algorithm is designed which can locate multiple optima in changing environments. The proposed algorithm integrates the crowding concept with a competent Evolutionary Algorithm (EA) called Differential Evolution (DE) for maintaining the multiple peaks in a single run. To avoid the use of niching parameter that requires prior knowledge about the fitness landscape, the authors have used local mutation for searching the solution space. A speciation-based memory archive is integrated for regeneration of population after an environmental change is detected. Experimental analysis is conducted on the Moving Peaks Benchmark problem and the performance of the proposed algorithm is compared with other peer algorithms to highlight the overall effectiveness of our work.

Swarm Intelligent algorithms focus on imbibing the collective intelligence of a group of simple agents that can work together as a unit. This research article focus on a recently proposed swarm-based metaheuristic called the Artificial Bee Colony (ABC) algorithm and suggests modifications to the algorithmic framework in order to enhance its performance. The proposed ABC variant shall be referred to as MsABC_Fm (Multi swarm Artificial Bee Colony with Forager migration). MsABC_Fm maintains multiple swarm populations that apply different perturbation strategies and gradually migration of the population from worse performing strategy to the better mode of perturbation is promoted. To evaluate the performance of the algorithm, we conduct comparative study involving 8 algorithms and test the problems on 25 benchmark problems proposed in the Special Session on IEEE Congress on Evolutionary Competition 2005. The superiority of the MsABC_Fm approach is also highlighted statistically.