A modified firefly algorithm for general inverse p-median location problems under different distance norms
This paper concerns a general inverse p -median location problem on the k -dimensional real space where the aim is to change (increase or reduce) the weights and coordinates of the existing customer points at the minimum total cost subject to given modification bounds so that a set of p predetermine...
Saved in:
| Published in | Opsearch Vol. 54; no. 3; pp. 618 - 636 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New Delhi
Springer India
01.09.2017
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | This paper concerns a general inverse
p
-median location problem on the
k
-dimensional real space where the aim is to change (increase or reduce) the weights and coordinates of the existing customer points at the minimum total cost subject to given modification bounds so that a set of
p
predetermined facility points becomes an optimal
p
-median location under the new weights and coordinates. A modified firefly algorithm is proposed to solve the problem under the rectilinear, Chebyshev and Euclidean distance norms. By computational experiments, the high efficiency of the algorithm is illustrated. |
|---|---|
| AbstractList | This paper concerns a general inverse
p
-median location problem on the
k
-dimensional real space where the aim is to change (increase or reduce) the weights and coordinates of the existing customer points at the minimum total cost subject to given modification bounds so that a set of
p
predetermined facility points becomes an optimal
p
-median location under the new weights and coordinates. A modified firefly algorithm is proposed to solve the problem under the rectilinear, Chebyshev and Euclidean distance norms. By computational experiments, the high efficiency of the algorithm is illustrated. This paper concerns a general inverse p-median location problem on the k-dimensional real space where the aim is to change (increase or reduce) the weights and coordinates of the existing customer points at the minimum total cost subject to given modification bounds so that a set of p predetermined facility points becomes an optimal p-median location under the new weights and coordinates. A modified firefly algorithm is proposed to solve the problem under the rectilinear, Chebyshev and Euclidean distance norms. By computational experiments, the high efficiency of the algorithm is illustrated. |
| Author | Bakhteh, Somayeh Alizadeh, Behrooz |
| Author_xml | – sequence: 1 givenname: Behrooz surname: Alizadeh fullname: Alizadeh, Behrooz email: alizadeh@sut.ac.ir, brz_alizadeh@yahoo.com organization: Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology – sequence: 2 givenname: Somayeh surname: Bakhteh fullname: Bakhteh, Somayeh organization: Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology |
| BookMark | eNp9kE1LAzEQhoMoWD9-gLeA5-gkmzbZYyl-QcGLnkN2d1JTdpOabAX99abWgwgKAzOH95l55z0hhyEGJOSCwxUHUNeZi2mtGPAZA1HP2McBmUCtpgwqAYdlhgpYpbU6Jic5rwFmErSckPWcDrHzzmNHnU_o-ndq-1VMfnwZqIuJrjBgsj314Q1TRrphA3beBtrH1o4-BrpJselxyHQbOky0bHOYMIxlyqMNLdIQ05DPyJGzfcbz735Knm9vnhb3bPl497CYL1lbST0yrapZg0JI6bDrSindukqDFtq22EoU006p2klecRSybgR3HGpeC9l03IrqlFzu9xZfr1vMo1nHbQrlpNmJNMBU1UWl9qo2xZzL46b149c_Y7K-NxzMLlizD9aUYM0uWPNRSP6L3CQ_2PT-LyP2TC7asML0w9Of0CfG0I86 |
| CitedBy_id | crossref_primary_10_1007_s12597_024_00815_8 crossref_primary_10_1007_s00500_021_06463_0 crossref_primary_10_1142_S0217595918500306 crossref_primary_10_1016_j_amc_2020_125078 crossref_primary_10_1007_s12597_023_00706_4 crossref_primary_10_1016_j_eswa_2022_117246 crossref_primary_10_1007_s10100_017_0509_4 crossref_primary_10_1007_s12155_021_10278_0 crossref_primary_10_1016_j_tcs_2024_114574 crossref_primary_10_1016_j_apenergy_2019_01_216 crossref_primary_10_1080_02331934_2019_1571056 crossref_primary_10_1007_s40314_023_02451_2 crossref_primary_10_1080_10556788_2018_1482296 crossref_primary_10_1080_10556788_2021_1880578 crossref_primary_10_1016_j_tcs_2018_11_020 crossref_primary_10_1007_s00186_018_0632_6 crossref_primary_10_1007_s10957_018_1334_1 crossref_primary_10_1016_j_cie_2022_108482 |
| Cites_doi | 10.1007/s10100-012-0248-5 10.1016/j.ejor.2006.09.069 10.1007/978-3-642-04441-0_8 10.1016/j.disopt.2006.11.008 10.1007/978-3-319-02141-6_15 10.1016/j.ejor.2013.09.029 10.1007/s10100-009-0114-2 10.1016/j.cor.2014.05.010 10.1007/s11424-008-9142-6 10.1016/j.ejor.2012.04.016 10.1016/j.cor.2011.11.004 10.1007/s00607-009-0070-7 10.1007/s10878-015-9907-5 10.1016/j.ejor.2004.05.027 10.7763/IJMLC.2011.V1.67 10.1016/j.disopt.2012.05.001 10.1016/j.dam.2011.01.009 10.1007/s10957-015-0829-2 10.1023/A:1008360312607 10.1007/s10878-007-9098-9 10.1016/j.ejor.2010.01.046 10.1007/978-3-7908-2151-2 10.1007/s00170-015-7420-8 10.1016/j.ejor.2015.06.064 10.1007/978-3-642-04944-6_14 10.1002/9780470640425 10.1007/978-1-84882-983-1_15 10.1016/j.ejor.2006.06.056 10.1016/j.endm.2010.05.157 10.1016/j.disopt.2004.03.003 10.1016/j.ejor.2005.05.034 10.1007/s00186-011-0346-5 10.1002/net.20427 10.1016/j.amc.2006.05.143 10.1155/2013/313868 10.1016/j.jksues.2012.09.002 10.11650/tjm.xx.20xx.6296 |
| ContentType | Journal Article |
| Copyright | Operational Research Society of India 2017 OPSEARCH is a copyright of Springer, 2017. |
| Copyright_xml | – notice: Operational Research Society of India 2017 – notice: OPSEARCH is a copyright of Springer, 2017. |
| DBID | AAYXX CITATION 3V. 7TB 7WY 7WZ 7XB 87Z 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG F~G HCIFZ K60 K6~ K8~ L.- L6V M0C M7S PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PTHSS Q9U |
| DOI | 10.1007/s12597-016-0296-z |
| DatabaseName | CrossRef ProQuest Central (Corporate) Mechanical & Transportation Engineering Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Business Premium Collection Technology Collection ProQuest One ProQuest Central Engineering Research Database Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) SciTech Premium Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection DELNET Management Collection ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Global Engineering Database ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) ABI/INFORM Complete (Alumni Edition) Engineering Collection Business Premium Collection ABI/INFORM Global Engineering Database ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest DELNET Management Collection Materials Science & Engineering Collection ProQuest One Business (Alumni) Engineering Research Database ProQuest One Academic ProQuest Central (Alumni) Business Premium Collection (Alumni) ProQuest One Academic (New) |
| DatabaseTitleList | ABI/INFORM Global (Corporate) |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics Business |
| EISSN | 0975-0320 |
| EndPage | 636 |
| ExternalDocumentID | 10_1007_s12597_016_0296_z |
| GroupedDBID | -57 -5G -BR -EM -~C -~X 06D 0R~ 0VY 1N0 203 29N 2JN 2KG 2LR 2VQ 30V 3V. 4.4 406 408 40D 40E 5VS 67Z 7WY 8FE 8FG 8FL 8TC 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH AAZMS ABAKF ABDZT ABECU ABFTV ABJCF ABJNI ABJOX ABKCH ABMQK ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABXPI ACAOD ACBXY ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACPIV ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGNC AEJHL AEJRE AEMSY AEOHA AEPYU AESKC AETCA AEVLU AEXYK AFBBN AFFNX AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS AMKLP AMXSW AMYLF AMYQR ANMIH AOCGG AXYYD AYQZM BA0 BAPOH BENPR BEZIV BGLVJ BGNMA BPHCQ CAG CCPQU COF CSCUP DDRTE DNIVK DPUIP DU5 DWQXO EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GROUPED_ABI_INFORM_COMPLETE H13 HCIFZ HF~ HG6 HLICF HMJXF HRMNR HZ~ IKXTQ ITM IWAJR IXC I~X J-C J0Z JBSCW JZLTJ K60 K6~ K8~ KOV L6V LLZTM M0C M4Y M7S MA- NPVJJ NQJWS NU0 O9- O93 O9G O9J P9M PQBIZ PQBZA PQQKQ PROAC PT4 PTHSS Q2X R9I ROL RSV S1Z S27 S3B SBE SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE T13 TSG U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W48 WK8 Z45 Z7Z ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ACSTC ADXHL AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT 7TB 7XB 8FD 8FK ABRTQ FR3 L.- PKEHL PQEST PQGLB PQUKI Q9U |
| ID | FETCH-LOGICAL-c348t-8736be2244feddedd78cf380828acec4e25d779f4131e249b21f1091924bd1a23 |
| IEDL.DBID | U2A |
| ISSN | 0030-3887 |
| IngestDate | Fri Jul 25 18:53:34 EDT 2025 Thu Apr 24 22:56:26 EDT 2025 Thu Jul 03 08:12:16 EDT 2025 Fri Feb 21 02:30:10 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Facility location median problem Inverse optimization Firefly algorithm |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c348t-8736be2244feddedd78cf380828acec4e25d779f4131e249b21f1091924bd1a23 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 1924800579 |
| PQPubID | 326266 |
| PageCount | 19 |
| ParticipantIDs | proquest_journals_1924800579 crossref_citationtrail_10_1007_s12597_016_0296_z crossref_primary_10_1007_s12597_016_0296_z springer_journals_10_1007_s12597_016_0296_z |
| PublicationCentury | 2000 |
| PublicationDate | 2017-09-01 |
| PublicationDateYYYYMMDD | 2017-09-01 |
| PublicationDate_xml | – month: 09 year: 2017 text: 2017-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New Delhi |
| PublicationPlace_xml | – name: New Delhi |
| PublicationTitle | Opsearch |
| PublicationTitleAbbrev | OPSEARCH |
| PublicationYear | 2017 |
| Publisher | Springer India Springer Nature B.V |
| Publisher_xml | – name: Springer India – name: Springer Nature B.V |
| References | Landa-Torres (CR25) 2012; 39 Mirchandani, Francis (CR28) 1990 Yang, Press (CR41) 2010 Bashiri, Bakhtiarifar (CR8) 2013; 20 Galavi (CR20) 2010; 36 Farahani, Hekmatfar (CR15) 2009 Puerto, Pérez-Brito, García-González (CR35) 2014; 234 CR39 Kratica, Stanimirović, Tošić, Filipović (CR24) 2007; 182 Burkard, Pleschiutschnig, Zhang (CR9) 2004; 1 Yang, Watanabe, Zeugmann (CR45) 2009 Alizadeh, Burkard (CR4) 2013; 21 Cai, Yang, Zhang (CR12) 1999; 15 Yang, Zhang (CR43) 2008; 21 Nguyen, Chassein (CR31) 2015; 247 Alcaraz, Mercedes, Juan (CR1) 2012; 222 Alizadeh, Burkard (CR2) 2011; 58 Francis, McGinnis, White (CR19) 1992 Yang, Bramer, Ellis, Petridi (CR42) 2010 Hatzl (CR23) 2012; 9 Fateen, Bonilla-Petriciolet, Yang (CR16) 2014 Sevkli, Mamedsaidov, Camci (CR37) 2014; 26 Łukasik, Żak, Nguyen (CR27) 2009 Alizadeh, Burkard (CR3) 2011; 159 Nguyen, Vui (CR34) 2016 Sepasian, Rahbarnia (CR36) 2015; 64 Baroughi Bonab, Burkard, Gassner (CR6) 2011; 73 Baroughi Bonab, Burkard, Alizadeh (CR7) 2010; 18 Yang (CR40) 2010 Ghaderi, Rahmaniani (CR22) 2016; 82 Yang, Zhang (CR44) 2008 Alizadeh, Burkard, Pferschy (CR5) 2009; 86 Nguyen (CR33) 2016; 168 CR29 Nguyen, Sepasian (CR32) 2016; 32 Burkard, Galavii, Gassner (CR11) 2010; 206 CR26 Drezner, Brimberg, Mladenović, Salhi (CR13) 2015; 62 Gassner (CR21) 2008; 16 Fathali (CR18) 2006; 183 Mladenović, Brimberg, Hansen, Moreno-Pérez (CR30) 2007; 179 Fathali, Taghizadeh (CR17) 2006; 170 Farahani, Abshouri, Nasiri, Meybodi (CR14) 2011; 1 Stanimirović, Kratica, Dugošija (CR38) 2007; 182 Burkard, Pleschiutschnig, Zhang (CR10) 2008; 5 X-S Yang (296_CR44) 2008 SM Farahani (296_CR14) 2011; 1 N Mladenović (296_CR30) 2007; 179 B Alizadeh (296_CR5) 2009; 86 I Landa-Torres (296_CR25) 2012; 39 X-S Yang (296_CR41) 2010 J Hatzl (296_CR23) 2012; 9 J Fathali (296_CR18) 2006; 183 RE Burkard (296_CR9) 2004; 1 J Fathali (296_CR17) 2006; 170 Z Drezner (296_CR13) 2015; 62 296_CR29 J Alcaraz (296_CR1) 2012; 222 X Yang (296_CR43) 2008; 21 J Puerto (296_CR35) 2014; 234 296_CR26 A Ghaderi (296_CR22) 2016; 82 BP Mirchandani (296_CR28) 1990 KT Nguyen (296_CR32) 2016; 32 KT Nguyen (296_CR34) 2016 M Bashiri (296_CR8) 2013; 20 RZ Farahani (296_CR15) 2009 RL Francis (296_CR19) 1992 MC Cai (296_CR12) 1999; 15 S Łukasik (296_CR27) 2009 X-S Yang (296_CR45) 2009 X-S Yang (296_CR42) 2010 M Galavi (296_CR20) 2010; 36 KT Nguyen (296_CR31) 2015; 247 B Alizadeh (296_CR2) 2011; 58 F Baroughi Bonab (296_CR6) 2011; 73 E Gassner (296_CR21) 2008; 16 F Baroughi Bonab (296_CR7) 2010; 18 B Alizadeh (296_CR4) 2013; 21 AR Sepasian (296_CR36) 2015; 64 Z Stanimirović (296_CR38) 2007; 182 M Sevkli (296_CR37) 2014; 26 RE Burkard (296_CR10) 2008; 5 X-S Yang (296_CR40) 2010 S-EK Fateen (296_CR16) 2014 KT Nguyen (296_CR33) 2016; 168 296_CR39 RE Burkard (296_CR11) 2010; 206 B Alizadeh (296_CR3) 2011; 159 J Kratica (296_CR24) 2007; 182 |
| References_xml | – volume: 21 start-page: 585 year: 2013 end-page: 594 ident: CR4 article-title: A linear time algorithm for inverse obnoxious center location problems on networks publication-title: Cent. Eur. J. Oper. Res. doi: 10.1007/s10100-012-0248-5 – volume: 64 start-page: 595 year: 2015 end-page: 602 ident: CR36 article-title: An algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions publication-title: Optimization – volume: 182 start-page: 983 year: 2007 end-page: 1001 ident: CR38 article-title: Genetic algorithms for solving the discrete ordered median problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.09.069 – start-page: 97 year: 2009 end-page: 106 ident: CR27 article-title: Firefly algorithm for continuous constrained optimization tasks publication-title: Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems doi: 10.1007/978-3-642-04441-0_8 – volume: 5 start-page: 242 year: 2008 end-page: 253 ident: CR10 article-title: The inverse 1-median problem on a cycle publication-title: Discrete Optim. doi: 10.1016/j.disopt.2006.11.008 – start-page: 315 year: 2014 end-page: 330 ident: CR16 article-title: Intelligent firefly algorithm for global optimization publication-title: Cuckoo Search and Firefly Algorithm doi: 10.1007/978-3-319-02141-6_15 – volume: 183 start-page: 1071 year: 2006 end-page: 1083 ident: CR18 article-title: A genetic algorithm for the p-median problem with pos/neg weights publication-title: Appl. Math. Comput. – volume: 234 start-page: 61 year: 2014 end-page: 76 ident: CR35 article-title: A modified variable neighborhood search for the discrete ordered median problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.09.029 – year: 1992 ident: CR19 publication-title: Facility Layout and Location: An Analytical Approach – ident: CR39 – volume: 18 start-page: 365 year: 2010 end-page: 381 ident: CR7 article-title: Inverse median location problems with variable coordinates publication-title: Cent. Eur. J. Oper. Res. doi: 10.1007/s10100-009-0114-2 – volume: 62 start-page: 296 year: 2015 end-page: 304 ident: CR13 article-title: New heuristic algorithms for solving the planar p-median problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.05.010 – volume: 20 start-page: 793 year: 2013 end-page: 800 ident: CR8 article-title: Finding the optimum location in a one-median network problem with correlated demands using simulated annealing publication-title: Sci. Iran. – volume: 21 start-page: 651 year: 2008 end-page: 664 ident: CR43 article-title: Inverse center location problem on a tree publication-title: J. Syst. Sci. Complex. doi: 10.1007/s11424-008-9142-6 – volume: 222 start-page: 54 year: 2012 end-page: 64 ident: CR1 article-title: Design and analysis of hybrid metaheuristics for the reliability p-median problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.04.016 – volume: 26 start-page: 11 year: 2014 end-page: 19 ident: CR37 article-title: A novel discrete particle swarm optimization for p-median problem publication-title: J. King Saud Univ. Eng. Sci. – volume: 39 start-page: 2214 year: 2012 end-page: 2222 ident: CR25 article-title: A comparative study of two hybrid grouping evolutionary techniques for the capacitated p-median problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.11.004 – ident: CR29 – year: 2010 ident: CR41 publication-title: Nature-Inspired Metaheuristic Algorithms – volume: 86 start-page: 331 year: 2009 end-page: 343 ident: CR5 article-title: Inverse 1-center location problems with edge length augmentation on trees publication-title: Computing doi: 10.1007/s00607-009-0070-7 – volume: 32 start-page: 872 year: 2016 end-page: 884 ident: CR32 article-title: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance publication-title: J. Comb. Optim. doi: 10.1007/s10878-015-9907-5 – volume: 170 start-page: 440 year: 2006 end-page: 462 ident: CR17 article-title: Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2004.05.027 – volume: 1 start-page: 448 year: 2011 end-page: 453 ident: CR14 article-title: A Gaussian firefly algorithm publication-title: Int. J. Mach. Learn. Comput. doi: 10.7763/IJMLC.2011.V1.67 – volume: 9 start-page: 137 year: 2012 end-page: 148 ident: CR23 article-title: 2-Balanced flows and the inverse 1-median problem in the Chebyshev space publication-title: Discrete Optim. doi: 10.1016/j.disopt.2012.05.001 – volume: 159 start-page: 706 year: 2011 end-page: 716 ident: CR3 article-title: Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2011.01.009 – volume: 168 start-page: 944 year: 2016 end-page: 957 ident: CR33 article-title: Inverse 1-median problem on block graphs with variable vertex weights publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-015-0829-2 – volume: 15 start-page: 213 year: 1999 end-page: 218 ident: CR12 article-title: The complexity analysis of the inverse center location problem publication-title: J. Glob. Optim. doi: 10.1023/A:1008360312607 – year: 2016 ident: CR34 article-title: The invere p-maxian problem on trees with variable edge lengths publication-title: Taiwan. J. Math. – volume: 16 start-page: 50 year: 2008 end-page: 67 ident: CR21 article-title: The inverse 1-maxian problem with edge length modification publication-title: J. Comb. Optim. doi: 10.1007/s10878-007-9098-9 – volume: 206 start-page: 11 year: 2010 end-page: 17 ident: CR11 article-title: The inverse Fermat–Weber problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2010.01.046 – year: 2008 ident: CR44 publication-title: Nature-Inspired Metaheuristic Algorithms – year: 1990 ident: CR28 publication-title: Discrete Location Theory – year: 2009 ident: CR15 publication-title: Facility Location: Concepts, Models, Algorithms and Case Studies doi: 10.1007/978-3-7908-2151-2 – volume: 82 start-page: 1627 year: 2016 end-page: 1647 ident: CR22 article-title: Meta-heuristic solution approaches for robust single allocation p-hub median problem with stochastic demands and travel times publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-015-7420-8 – volume: 247 start-page: 774 year: 2015 end-page: 781 ident: CR31 article-title: The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2015.06.064 – start-page: 169 year: 2009 end-page: 178 ident: CR45 article-title: Firefly algorithms for multimodal optimisation publication-title: Stochastic Algorithms: Foundations and Applications doi: 10.1007/978-3-642-04944-6_14 – year: 2010 ident: CR40 publication-title: Engineering Optimization: An Introduction with Metaheuristic Applications doi: 10.1002/9780470640425 – start-page: 209 year: 2010 end-page: 218 ident: CR42 article-title: Firefly algorithm, Lévy flights and global optimization publication-title: Research and Development in Intelligent Systems XXVI doi: 10.1007/978-1-84882-983-1_15 – volume: 182 start-page: 15 year: 2007 end-page: 28 ident: CR24 article-title: Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.06.056 – volume: 36 start-page: 1241 year: 2010 end-page: 1248 ident: CR20 article-title: The inverse 1-median problem on a tree and on a path publication-title: Electron. Notes Discrete Math. doi: 10.1016/j.endm.2010.05.157 – volume: 1 start-page: 23 year: 2004 end-page: 39 ident: CR9 article-title: Inverse median problems publication-title: Discrete Optim. doi: 10.1016/j.disopt.2004.03.003 – ident: CR26 – volume: 179 start-page: 927 year: 2007 end-page: 939 ident: CR30 article-title: The p-median problem: a survey of metaheuristic approaches publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.05.034 – volume: 73 start-page: 263 year: 2011 end-page: 280 ident: CR6 article-title: Inverse p-median problems with variable edge lengths publication-title: Math. Methods Oper. Res. doi: 10.1007/s00186-011-0346-5 – volume: 58 start-page: 190 year: 2011 end-page: 200 ident: CR2 article-title: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees publication-title: Networks doi: 10.1002/net.20427 – volume: 1 start-page: 23 year: 2004 ident: 296_CR9 publication-title: Discrete Optim. doi: 10.1016/j.disopt.2004.03.003 – volume: 247 start-page: 774 year: 2015 ident: 296_CR31 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2015.06.064 – volume: 32 start-page: 872 year: 2016 ident: 296_CR32 publication-title: J. Comb. Optim. doi: 10.1007/s10878-015-9907-5 – volume: 222 start-page: 54 year: 2012 ident: 296_CR1 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.04.016 – volume: 86 start-page: 331 year: 2009 ident: 296_CR5 publication-title: Computing doi: 10.1007/s00607-009-0070-7 – volume: 20 start-page: 793 year: 2013 ident: 296_CR8 publication-title: Sci. Iran. – volume-title: Engineering Optimization: An Introduction with Metaheuristic Applications year: 2010 ident: 296_CR40 doi: 10.1002/9780470640425 – volume: 182 start-page: 983 year: 2007 ident: 296_CR38 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.09.069 – start-page: 209 volume-title: Research and Development in Intelligent Systems XXVI year: 2010 ident: 296_CR42 doi: 10.1007/978-1-84882-983-1_15 – volume: 73 start-page: 263 year: 2011 ident: 296_CR6 publication-title: Math. Methods Oper. Res. doi: 10.1007/s00186-011-0346-5 – volume: 183 start-page: 1071 year: 2006 ident: 296_CR18 publication-title: Appl. Math. Comput. doi: 10.1016/j.amc.2006.05.143 – volume: 15 start-page: 213 year: 1999 ident: 296_CR12 publication-title: J. Glob. Optim. doi: 10.1023/A:1008360312607 – volume: 62 start-page: 296 year: 2015 ident: 296_CR13 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.05.010 – volume: 159 start-page: 706 year: 2011 ident: 296_CR3 publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2011.01.009 – volume: 39 start-page: 2214 year: 2012 ident: 296_CR25 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.11.004 – volume: 1 start-page: 448 year: 2011 ident: 296_CR14 publication-title: Int. J. Mach. Learn. Comput. doi: 10.7763/IJMLC.2011.V1.67 – volume: 64 start-page: 595 year: 2015 ident: 296_CR36 publication-title: Optimization – volume: 182 start-page: 15 year: 2007 ident: 296_CR24 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.06.056 – volume-title: Discrete Location Theory year: 1990 ident: 296_CR28 – volume: 36 start-page: 1241 year: 2010 ident: 296_CR20 publication-title: Electron. Notes Discrete Math. doi: 10.1016/j.endm.2010.05.157 – volume: 16 start-page: 50 year: 2008 ident: 296_CR21 publication-title: J. Comb. Optim. doi: 10.1007/s10878-007-9098-9 – volume: 170 start-page: 440 year: 2006 ident: 296_CR17 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2004.05.027 – volume-title: Facility Layout and Location: An Analytical Approach year: 1992 ident: 296_CR19 – start-page: 315 volume-title: Cuckoo Search and Firefly Algorithm year: 2014 ident: 296_CR16 doi: 10.1007/978-3-319-02141-6_15 – volume: 9 start-page: 137 year: 2012 ident: 296_CR23 publication-title: Discrete Optim. doi: 10.1016/j.disopt.2012.05.001 – start-page: 97 volume-title: Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems year: 2009 ident: 296_CR27 doi: 10.1007/978-3-642-04441-0_8 – ident: 296_CR39 doi: 10.1155/2013/313868 – volume: 206 start-page: 11 year: 2010 ident: 296_CR11 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2010.01.046 – ident: 296_CR29 – volume-title: Nature-Inspired Metaheuristic Algorithms year: 2008 ident: 296_CR44 – volume: 26 start-page: 11 year: 2014 ident: 296_CR37 publication-title: J. King Saud Univ. Eng. Sci. doi: 10.1016/j.jksues.2012.09.002 – volume: 234 start-page: 61 year: 2014 ident: 296_CR35 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.09.029 – volume: 5 start-page: 242 year: 2008 ident: 296_CR10 publication-title: Discrete Optim. doi: 10.1016/j.disopt.2006.11.008 – volume: 179 start-page: 927 year: 2007 ident: 296_CR30 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.05.034 – volume: 21 start-page: 651 year: 2008 ident: 296_CR43 publication-title: J. Syst. Sci. Complex. doi: 10.1007/s11424-008-9142-6 – volume-title: Nature-Inspired Metaheuristic Algorithms year: 2010 ident: 296_CR41 – year: 2016 ident: 296_CR34 publication-title: Taiwan. J. Math. doi: 10.11650/tjm.xx.20xx.6296 – volume: 58 start-page: 190 year: 2011 ident: 296_CR2 publication-title: Networks doi: 10.1002/net.20427 – volume-title: Facility Location: Concepts, Models, Algorithms and Case Studies year: 2009 ident: 296_CR15 doi: 10.1007/978-3-7908-2151-2 – volume: 82 start-page: 1627 year: 2016 ident: 296_CR22 publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-015-7420-8 – start-page: 169 volume-title: Stochastic Algorithms: Foundations and Applications year: 2009 ident: 296_CR45 doi: 10.1007/978-3-642-04944-6_14 – ident: 296_CR26 – volume: 168 start-page: 944 year: 2016 ident: 296_CR33 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-015-0829-2 – volume: 21 start-page: 585 year: 2013 ident: 296_CR4 publication-title: Cent. Eur. J. Oper. Res. doi: 10.1007/s10100-012-0248-5 – volume: 18 start-page: 365 year: 2010 ident: 296_CR7 publication-title: Cent. Eur. J. Oper. Res. doi: 10.1007/s10100-009-0114-2 |
| SSID | ssj0064084 |
| Score | 2.1589255 |
| Snippet | This paper concerns a general inverse
p
-median location problem on the
k
-dimensional real space where the aim is to change (increase or reduce) the weights... This paper concerns a general inverse p-median location problem on the k-dimensional real space where the aim is to change (increase or reduce) the weights and... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 618 |
| SubjectTerms | Algorithms Business and Management Chebyshev approximation Computational efficiency Computing time Cost engineering Management Mathematics Norms Operations research Operations Research/Decision Theory Site selection Theoretical Article |
| SummonAdditionalLinks | – databaseName: ProQuest Central dbid: BENPR link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LS8NAEB60guhBfGK1yh48KcG8mmxOUsUigiJiwVtINrO10qbVxIP-emfSja2CvQWSXcjM7sy3OzPfAJy4ttKR7WurHXKYMUsSS2pEy5U2JlqpdoJcnHx3H9z0_Nvn9rO5cCtMWmVtEytDnY0V35Gf80FBVqWTF5M3i7tGcXTVtNBYhhUywVI2YOXy-v7hsbbFgW_LKQ-zxyyyMqzjmlXxHCF_TrvkJNwosL5-e6YZ3PwTIa0cT3cTNgxiFJ2pirdgCfNtWK0T1rdhfY5ScAdeO2I0zgaakKXQZM708FMkwz79SfkyEoRQRX9KNC0GOWdkoJhYVfVILtitsZqEaTJTCC4wexd1D5WSnhhLKhQ5Id1iF3rd66erG8v0U7CU58uSDJ8XpEg-29dIVi3LQqm0J5nELlGofHTbWRhGmvyag3QsS11HM28oST7NnMT19qCRj3PcB4GKFKEDDx2-N4rClAahzhwV0Wlba6cJdi3LWBmyce55MYxnNMks_pgTzFj88VcTTn-GTKZMG4s-btUKis2mK-LZEmnCWa20udf_TXaweLJDWHPZl1eJZS1olO8feERIpEyPzXL7Bsmp3MI priority: 102 providerName: ProQuest |
| Title | A modified firefly algorithm for general inverse p-median location problems under different distance norms |
| URI | https://link.springer.com/article/10.1007/s12597-016-0296-z https://www.proquest.com/docview/1924800579 |
| Volume | 54 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB58gOhBfGJ9lD14UgJ5Z3Os0iqKImJBTyHZzGqlptLEg_56Z9KsVVHBUxKyG0Immfkm8823APuurXRs-9oKIi4z5mlqSY1oudLGVCsVpMjNyReX4WnfP7sNbps-7tKw3U1JsvbU02Y3QupMk2TSbBxab7MwH1Dqzjyuvtsx7jf0bTmRXvZYOFZGppT50yW-BqMpwvxWFK1jTW8FlhuQKDoTq67CDBZrsGA46muw9ElFkI4uPqRXy3V47IinUT7QBC2FJn-mh68iHd6PxoPq4UkQRBX3E6VpMSiYkoHi2arbRwrBcY3tJJpVZkrBHWZjYRZRqWiPwaRCURDULTeg3-veHJ9azYIKlvJ8WZHn88IMKWj7Gsmt5XkklfYkq9ilCpWPbpBHUawpsDlIeVnmOpqFQylHy3Indb1NmCtGBW6BQBXQwNBDh38cxVFGk1Dnjoop3dbaaYFtnmyiGrVxXvRimEx1ktkYCTPM2BjJWwsOPqY8T6Q2_hq8a8yVNF9dmfCNyrq9tgWHxoSfTv92se1_jd6BRZdje00024W5avyCe4RMqqwNs7J30ob5zsndeZe2R93Lq-t2_X6-AwW_4Rs |
| linkProvider | Springer Nature |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3JTsNADLUQSCwHxCrKOge4gCKyNcsBIQSUsp5A4haSiaeA2rS0QQg-im_ETjIUkODGLVIyE8n2eBnbzwCbtilVaLrKqPucZkzj2AgUomEHJsZKynqM3Jx8eeU1b9yz2_rtCLzrXhguq9Q6sVDUaVfyHfkuBwpB0Tq533syeGoUZ1f1CI1SLM7x9YVCtsHe6RHxd8u2G8fXh02jmipgSMcNcjr-jpcgWS5XIZ3tNPUDqZyAodxiidJFu576fqhIu1tIwUliW4rRM-n_SWrFDHRAKn_MdciSc2d640Rrfs81gxL12WHM2sDXWdSiVY_iDC7y5JLf0DPevtvBoXP7Ix9bmLnGDExX_qk4KAVqFkYwm4NxXR4_B1NfAAzn4fFAdLrpgyI_VihSnqr9KuJ2i-iW33cE-cOiVcJai4eM6z9Q9IyiVyUTbERZKEQ10mYguJ2tL_TElpye2HOVKDLyqwcLcPMvdF6E0ayb4RIIlMR25Tlo8S1V6Ce0CFVqyZBie6WsGpialpGsoM15wkY7GoIyM_kjLmdj8kdvNdj-XNIrcT3--nhVMyiqjvggGgpkDXY00768_m2z5b8324CJ5vXlRXRxenW-ApM2exFFSdsqjOb9Z1wjHyhP1gvBE3D335L-AQ4RGCU |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB58gOhBfGJ97sGTEsz7cSxq8VXxYMFbSDazWqlpaeJBf70zSbZVUcFbQmaXsLOZ-TYz8w3AoW1KFZmuMryAw4xZkhihQjTs0MRESeklyMXJ3Vv_oudePXgPTZ_TQme765BkXdPALE15eTLK1Mm08I1QO6dMcgJt5BvvszDvcjEwbeie3dam2HfNsKZhdphENgx0WPOnKb46pina_BYgrfxOZwWWG8Ao2rWGV2EG8zVY0Pnqa7D0iVGQ7roTGtZiHZ7b4mWY9RXBTKHItqnBm0gGj8Nxv3x6EQRXxWPNOi36OadnoBgZVSlJLtjHsc5E03GmEFxtNha6oUpJVwwsJYqcYG-xAb3O-f3phdE0VzCk44YlWUHHT5EcuKuQTFyWBaFUTsiMdolE6aLtZUEQKVpWC-mMltqWYhJROq-lmZXYzibM5cMct0Cg9EjQd9Din0hRkNIgVJklIzp6K2W1wNQrG8uGeZwbYAziKWcyKyPmbDNWRvzegqPJkFFNu_GX8K5WV9x8gUXMLxpWpbYtONYq_PT4t8m2_yV9AAt3Z5345vL2egcWbXb5Vf7ZLsyV41fcI8BSpvvVpvwAPL3kLQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+modified+firefly+algorithm+for+general+inverse+p-median+location+problems+under+different+distance+norms&rft.jtitle=Opsearch&rft.au=Alizadeh%2C+Behrooz&rft.au=Bakhteh%2C+Somayeh&rft.date=2017-09-01&rft.pub=Springer+India&rft.issn=0030-3887&rft.eissn=0975-0320&rft.volume=54&rft.issue=3&rft.spage=618&rft.epage=636&rft_id=info:doi/10.1007%2Fs12597-016-0296-z&rft.externalDocID=10_1007_s12597_016_0296_z |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0030-3887&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0030-3887&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0030-3887&client=summon |