• Home
  • Search
  • An Algorithm Framework for Facility Service Districting Problem
  • Cite Icon1
  • https://doi.org/10.13203/j.whugis20200393Copy DOI Icon

An Algorithm Framework for Facility Service Districting Problem

Show More
  • Abstract
  • Literature Map
  • Citations
  • Similar Papers
Abstract

Objectives Facility service districting problem(FSDP) refers to the design of facility service areas according to the facility locations and service capacities in a geographical region. The design criteria for service areas include the balance of service demand and supply, the highest service accessibility, and the spatial contiguity. The spatial contiguity is a necessity for satisfying some policies on public services, such as school districting and medical districting. However, solving the FSDP with contiguity constraints is challenging. We present a hybrid algorithm framework for solving the FSDP. Methods The algorithm is proposed based on the general local search algorithm and furtherly enhanced by multi-start, ruin-recreate, set-partitioning and other optimization strategies. The basic modules such as initial solution generation method, local search operators, solution perturbation, model building and solving, and search strategies, are provided in the framework. Using these building blocks, some exact, metaheuristic and hybrid algorithms could be implemented effectively. Five algorithms are implemented for the FSDP: Exact method by solving a mixed integer linear programming model, simulated annealing (SA) algorithm, iterative local search (ILS) algorithm, SA with set-partitioning, and ILS with set-partitioning. In addition, four instances are designed to test the algorithms. The instance size, supply-demand ratio, and geographic environment are considered in the instance design. Results There are several findings from computing experimentation: Optimal or near-optimal solutions of the instances could be obtained by CPLEX optimizer; high-quality solutions could be found by SA and ILS algorithms much more efficiently; the set-partitioning procedure is capable of improving the solution quality. Conclusions Based on the proposed algorithm framework, it is easy and flexible to design local-search based matheuristics and hybrid algorithms for the FSDP. High quality solutions could be obtained by coupling the local search with ruin-recreate perturbation and set-partitioning.

Similar Papers
  • Conference Article
  • Citations2

Iterated Local Search for Steelmaking-refining-Continuous Casting Scheduling Problem

  • Aug 01, 2019
  • Kunkun Peng +5
  • Research Article
  • Citations86

An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem

  • Mar 28, 2015
  • Omega
  • Nasser R Sabar +1
  • Book Chapter
  • Citations4

Simulated Annealing and Iterated Local Search Approaches to the Aircraft Refueling Problem

  • Jan 01, 2021
  • Karyne Alves Zampirolli +1
  • Research Article
  • Citations1

Auction- and negotiation-based approach with local search for cellular manufacturing systems under traffic jam constraints in magnetic production enterprises

  • Sep 22, 2023
  • Kybernetes
  • Chengkuan Zeng +2
  • Research Article
  • Citations52

A Travelling Salesman Problem With Carbon Emission Reduction in the Last Mile Delivery

  • Jan 01, 2019
  • IEEE Access
  • Li Jiang +4
  • Research Article
  • Citations14

A Variable Iterated Local Search Algorithm for Energy-Efficient No-idle Flowshop Scheduling Problem

  • Jan 01, 2019
  • Procedia Manufacturing
  • M.Fatih Tasgetiren +4
  • Research Article
  • Citations26

An enhanced estimation of distribution algorithm with problem-specific knowledge for distributed no-wait flowshop group scheduling problems

  • Apr 05, 2024
  • Swarm and Evolutionary Computation
  • Zi-Qi Zhang +5
  • Research Article
  • Citations38

A comparison of local search algorithms with population-based algorithms in hybrid flow shop scheduling problems with realistic characteristics

  • Aug 07, 2015
  • The International Journal of Advanced Manufacturing Technology
  • Mir Abbas Bozorgirad +1
  • Research Article
  • Citations21

An evolutionary programming algorithm for continuous global optimization

  • Jan 01, 2006
  • European Journal of Operational Research
  • Yao Wen Yang +2
  • Research Article
  • Citations6

Iterated local search with Trellis-neighborhood for the partial Latin square extension problem

  • Sep 23, 2016
  • Journal of Heuristics
  • Kazuya Haraguchi
  • PDF
  • Research Article
  • Citations7

A New Iterated Local Search Algorithm for Solving Broadcast Scheduling Problems in Packet Radio Networks

  • May 30, 2010
  • EURASIP Journal on Wireless Communications and Networking
  • Chih-Chiang Lin +1
  • Research Article
  • Citations6

Improvement on the computational efficiency of inverse queueing network analysis

  • Sep 01, 1994
  • Computers & Industrial Engineering
  • Mitsuru Kuroda +1
  • Research Article
  • Citations105

Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

  • Oct 01, 2001
  • European Journal of Operational Research
  • Kengo Katayama +1
  • Research Article
  • Citations3

Automatic summarization of narrative video

  • Nov 18, 2015
  • Data Archiving and Networked Services (DANS)
  • M Barbieri
  • Research Article
  • Citations16

Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective

  • Jan 01, 2022
  • Computers & Operations Research
  • Andreia F Silva +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.