2018
DOI: 10.4018/ijamc.2018040101
|View full text |Cite
|
Sign up to set email alerts
|

Parallel Scatter Search Approach for the MinMax Regret Location Problem

Abstract: Inthispaperweproposeanefficientsolvingmethodbasedonaparallelscattersearchalgorithm thatacceleratesthesearchtimetosolvetheminmaxregretlocationproblem.Thealgorithmwas appliedinthecontextofemergencymanagementtolocateemergencyvehiclesstations.Adiscrete eventsimulatorwasusedtotestthequalityoftheobtainedsolutionsontheoperationallevel.We comparedtheperformanceofthealgorithmtoanexistingtwostagesmethod,andexperimentsshow theefficiencyoftheproposedmethodintermsofqualityofsolutionaswellasthegainincomputation timethatcoul… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 28 publications
0
1
0
Order By: Relevance
“…is approach was compared with two commercial software and attained the optimal solution for permutation problems. Ibri et al [155] proposed a parallel SS to solve the regret location problem. Results proved that the parallel SS performed better results than the exiting algorithms in terms of computational time and solution quality.…”
Section: Image Processingmentioning
confidence: 99%
“…is approach was compared with two commercial software and attained the optimal solution for permutation problems. Ibri et al [155] proposed a parallel SS to solve the regret location problem. Results proved that the parallel SS performed better results than the exiting algorithms in terms of computational time and solution quality.…”
Section: Image Processingmentioning
confidence: 99%