ORCID Profile
0000-0001-9678-023X
Current Organisation
university of kurdistan
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Springer Science and Business Media LLC
Date: 18-10-2014
Publisher: Springer Science and Business Media LLC
Date: 29-06-2020
Publisher: Springer Science and Business Media LLC
Date: 03-08-2022
Publisher: Elsevier BV
Date: 05-2013
Publisher: Inderscience Publishers
Date: 2013
Publisher: Elsevier BV
Date: 07-2019
Publisher: Springer Science and Business Media LLC
Date: 21-07-2022
Publisher: Elsevier BV
Date: 02-2013
Publisher: IGI Global
Date: 2013
DOI: 10.4018/978-1-4666-2086-5.CH006
Abstract: The location–allocation problems are a class of complicated optimization problems that requires finding sites for m facilities and to simultaneously allocate n customers to those facilities to minimize the total transportation costs. Indeed, these problems, belonging to the class NP-hard, have a lot of local optima solutions. In this chapter, three hybrid meta-heuristics: genetic algorithm, variable neighborhood search and particle swarm optimization, and a hybrid local search approach. These are investigated to solve the uncapacitated continuous location-allocation problem (multi-source Weber problem). In this regard, alternate location allocation and exchange heuristics are used to find the local optima of the problem within the framework of hybrid algorithms. In addition, some large-scale problems are employed to measure the effectiveness and efficiency of hybrid algorithms. Obtained results from these heuristics are compared with local search methods and with each other. The experimental results show that the hybrid meta-heuristics produce much better solutions to solve large-scale problems. Moreover, the results of two non-parametric statistical tests detected a significant difference in hybrid algorithms such that the hybrid variable neighborhood search and particle swarm optimization algorithm outperform the others.
Publisher: Elsevier BV
Date: 05-2015
Publisher: Elsevier BV
Date: 04-2023
Publisher: Springer Science and Business Media LLC
Date: 05-07-2011
Publisher: Elsevier BV
Date: 10-2023
Publisher: Springer Science and Business Media LLC
Date: 09-07-2015
Publisher: Springer Science and Business Media LLC
Date: 16-02-2007
Publisher: Elsevier BV
Date: 10-2019
Location: Iran (Islamic Republic of)
No related grants have been discovered for Abdolsalam Ghaderi.