Genetic algorithm for obstacle location-allocation problems with customer priorities

DOI10.3934/jimo.2020044zbMath1476.90069OpenAlexW3009805308MaRDI QIDQ1983729

Ashkan Ayough, Farbod Farhadi, Mostafa Zandieh, Parisa Rastkhadiv

Publication date: 10 September 2021

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2020044

zbMATH Keywords

facility location genetic algorithm visibility graph emergency management disease outbreak capacitated obstacle location-allocation customer priority

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (1)

Optimizing synchronized truck-drone delivery with priority in disaster relief

Cites Work

Efficient solution of a class of location-allocation problems with stochastic demand and congestion
Pre-positioning disaster response facilities at safe locations: an evaluation of deterministic and stochastic modeling approaches
Models for hospital location and capacity allocation for an area prone to natural disasters
Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
Facility location and supply chain management. A review
Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
An efficient algorithm for facility location in the presence of forbidden regions
A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
A survey of healthcare facility location
Location analysis: a synthesis and survey
The simple plant location problem: Survey and synthesis
Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
The multicriteria \(p\)-facility median location problem on networks
A bibliography for some fundamental problem categories in discrete location science
A stochastic programming approach for supply chain network design under uncertainty
Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
Visibility graphs and obstacle-avoiding shortest paths
Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
Exact Solution to a Location Problem with Stochastic Demands
The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
Location Science
Exact and approximate solutions to the multisource weber problem
A reduction result for location problems with polyhedral barriers
On the use of genetic algorithms to solve location problems

This page was built for publication: Genetic algorithm for obstacle location-allocation problems with customer priorities