Memetic algorithms for Spatial Partitioning problems

  title={Memetic algorithms for Spatial Partitioning problems},
  author={Subhodip Biswas and Fanglan Chen and Zhiqian Chen and Chang-Tien Lu and Naren Ramakrishnan},
  journal={ACM Transactions on Spatial Systems and Algorithms},
Spatial optimization problems (SOPs) are characterized by spatial relationships governing the decision variables, objectives, and/or constraint functions. In this article, we focus on a specific type of SOP called spatial partitioning, which is a combinatorial problem due to the presence of discrete spatial units. Exact optimization methods do not scale with the size of the problem, especially within practicable time limits. This motivated us to develop population-based metaheuristics for… 



Incorporating domain knowledge into Memetic Algorithms for solving Spatial Optimization problems

This work explores the use of population-based metaheuristics for solving SOPs and designs spatially-aware search operators that can efficiently search for an optimal solution in discrete search space while respecting the spatial constraints, resulting in a simple yet highly effective spatial hybrid metaheuristic called SPATIAL.

A Unified Conceptual Framework for Geographical Optimization Using Evolutionary Algorithms

A formal, conceptual framework is developed to unify the design and implementation of EAs for many geographical optimization problems by developing a graph representation that defines the spatial structure of a broad range of geographical problems.

Multilevel Refinement for Combinatorial Optimisation: Boosting Metaheuristic Performance

  • C. Walshaw
  • Computer Science
    Hybrid Metaheuristics
  • 2008
This chapter surveys the use of multilevel combinatorial techniques and considers their ability to boost the performance of (meta)heuristic optimisation algorithms.

Multilevel Refinement for Combinatorial Optimisation Problems

The issue of multilevel refinement for combinatorial optimisation problems is addressed and a case is made for its use as a metaheuristic, with the aid of examples and results in graph partitioning, graph colouring and the travelling salesman problem.

Variable neighborhood search

Hybrid metaheuristics in combinatorial optimization: A survey

Scatter Search and Path Relinking: Advances and Applications

The features of SS and PR that set them apart from other evolutionary approaches are described, and that offer opportunities for creating increasingly more versatile and effective methods in the future.

New Models for Commercial Territory Design

In this work, a series of novel formulations for a commercial territory design problem motivated by a real-world case are proposed. The problem consists on determining a partition of a set of units

The case for strategic oscillation

It is observed that a strategic oscillation approach for transitioning between feasible and infeasible space overcomes these difficulties, reinforcing recent published observations about the utility of solution trajectories that alternate between feasibility andinfeasibility.

Stochastic Hillclimbing as a Baseline Mathod for Evaluating Genetic Algorithms

It is demonstrated that simple stochastic hillclimbing methods are able to achieve results comparable or superior to those obtained by the GAs designed to address these two problems: Koza's 11-multiplexer problem and the jobshop problem.