2019
DOI: 10.1007/978-3-030-31140-7_5
|View full text |Cite
|
Sign up to set email alerts
|

Math-Heuristic for a Territory Design Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…The second approach relies on heuristic algorithms. A number of extensive metaheuristics have been applied to the regional districting problem, namely, simulated annealing algorithms [6], search algorithms [29], genetic algorithms [30], etc. Camacho et al [31] developed a local search algorithm to solve the police districting problem, and the case study illustrates the advantages of this algorithm.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The second approach relies on heuristic algorithms. A number of extensive metaheuristics have been applied to the regional districting problem, namely, simulated annealing algorithms [6], search algorithms [29], genetic algorithms [30], etc. Camacho et al [31] developed a local search algorithm to solve the police districting problem, and the case study illustrates the advantages of this algorithm.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The resulting method allows significant savings when compared to the original solution used by the company. Solana et al [23] consider the same problem considered in Salazar-Aguilar et al [24], which requires the division of a geographical area into compact, contiguous and balanced territories, with respect to one or several measures of activity. They propose a matheuristic based on a Greedy Randomized Adaptive Search Procedure (GRASP).…”
Section: Related Workmentioning
confidence: 99%