메뉴 건너뛰기




Volumn 39, Issue 9, 2012, Pages 2214-2222

A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem

Author keywords

Capacitated P median problem; Genetic algorithms; Grouping approaches; Harmony search; Hybrid algorithms

Indexed keywords

ALGORITHMIC APPROACH; CAPACITATED P-MEDIAN PROBLEMS; COMPARATIVE STUDIES; DIVERSE FIELDS; EVOLUTIONARY COMPUTATION TECHNIQUES; EVOLUTIONARY COMPUTATIONS; EVOLUTIONARY OPERATORS; EVOLUTIONARY TECHNIQUES; EXPERIMENTAL SECTION; GROUPING APPROACHES; GROUPING GENETIC ALGORITHMS; HARMONY SEARCH; HYBRID ALGORITHMS; LOCAL SEARCH; MAIN CHARACTERISTICS; META HEURISTIC ALGORITHM; NP COMPLETE PROBLEMS; WIDE SPECTRUM;

EID: 84855563443     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.11.004     Document Type: Article
Times cited : (32)

References (37)
  • 1
    • 43949150040 scopus 로고
    • Capacitated clustering problems by hybrid simulated annealing and tabu search
    • I. Osman, and N. Christofides Capacitated clustering problems by hybrid simulated annealing and tabu search International Transactions on Operational Research 1 3 1994 317 336
    • (1994) International Transactions on Operational Research , vol.1 , Issue.3 , pp. 317-336
    • Osman, I.1    Christofides, N.2
  • 2
    • 4043081276 scopus 로고    scopus 로고
    • A genetic algorithm for solving a capacitated p-median problem
    • E. Santos-Correa, M.T. Steiner, A.A. Freitas, and C. Carnieri A genetic algorithm for solving a capacitated P-median problem Numerical Algorithms 35 4 2004 373 388 (Pubitemid 39072765)
    • (2004) Numerical Algorithms , vol.35 , Issue.2-4 , pp. 373-388
    • Correa, E.S.1    Steiner, M.T.A.2    Freitas, A.A.3    Carnieri, C.4
  • 3
    • 1142268986 scopus 로고    scopus 로고
    • A column generation approach to capacitated p-median problems
    • DOI 10.1016/S0305-0548(03)00039-X
    • L.N. Lorena, and E. Senne A column generation approach to capacitated P-median problems Computers & Operations Research 31 6 2004 863 876 (Pubitemid 38204401)
    • (2004) Computers and Operations Research , vol.31 , Issue.6 , pp. 863-876
    • Lorena, L.A.N.1    Senne, E.L.F.2
  • 4
    • 79957954830 scopus 로고    scopus 로고
    • Guided construction search metaheuristics for the capacitated P-median problem with single source constraint
    • I. Osman, and S. Ahmadi Guided construction search metaheuristics for the capacitated P-median problem with single source constraint Journal of the Operational Research Society 18 2006 339 348
    • (2006) Journal of the Operational Research Society , vol.18 , pp. 339-348
    • Osman, I.1    Ahmadi, S.2
  • 5
    • 34250636714 scopus 로고    scopus 로고
    • Applications of genetic algorithms to optimal multilevel design of MPLS-based networks
    • E.S. El-Alfy Applications of genetic algorithms to optimal multilevel design of MPLS-based networks Computer Communications 30 2007 2010 2020
    • (2007) Computer Communications , vol.30 , pp. 2010-2020
    • El-Alfy, E.S.1
  • 6
    • 3543131854 scopus 로고    scopus 로고
    • Deployment of mobile switching centers in a telecommunications network: A stochastic programming approach
    • DOI 10.1023/B:TELS.0000029022.63021.09
    • M. Riis Deployment of mobile switching centers in a telecommunications network: a stochastic programming approach Telecommunication Systems 26 1 2004 93 109 (Pubitemid 39019029)
    • (2004) Telecommunication Systems , vol.26 , Issue.1 , pp. 93-109
    • Riis, M.1    Skriver, A.J.V.2    Lodahl, J.3
  • 10
    • 38249010413 scopus 로고
    • Clustering algorithms for consolidation of customer orders into vehicle shipments
    • Y. Koskosidis, and W.B. Powell Clustering algorithms for consolidation of customer orders into vehicle shipments Transportation Research B 26 1992 365 379
    • (1992) Transportation Research B , vol.26 , pp. 365-379
    • Koskosidis, Y.1    Powell, W.B.2
  • 11
    • 0037209524 scopus 로고    scopus 로고
    • A tabu search heuristic and adaptive memory procedure for political districting
    • B. Bozkaya, E. Erkut, and G. Laporte A tabu search heuristic and adaptive memory procedure for political districting European Journal of Operational Research 144 1 2003 12 26
    • (2003) European Journal of Operational Research , vol.144 , Issue.1 , pp. 12-26
    • Bozkaya, B.1    Erkut, E.2    Laporte, G.3
  • 13
    • 0032166751 scopus 로고    scopus 로고
    • A Bionomic Approach to the Capacitated p-Median Problem
    • V. Maniezzo, A. Mingozzi, and R. Baldacci A bionomic approach to the capacitated p-median problem Journal of Heuristics 4 1998 263 280 (Pubitemid 128513804)
    • (1998) Journal of Heuristics , vol.4 , Issue.3 , pp. 263-280
    • Maniezzo, V.1    Mingozzi, A.2    Baldacci, R.3
  • 14
    • 0036526018 scopus 로고    scopus 로고
    • A new method for solving capacitated location problems based on a set partitioning approach
    • DOI 10.1016/S0305-0548(00)00072-1, PII S0305054800000721
    • R. Baldacci, E. Hadjiconstantinou, V. Maniezzo, and A. Mingozzi A new method for solving capacitated location problems based on a set partitioning approach Computers & Operations Research 29 4 2002 365 386 (Pubitemid 33038412)
    • (2002) Computers and Operations Research , vol.29 , Issue.4 , pp. 365-386
    • Baldacci, R.1    Hadjiconstantinou, E.2    Maniezzo, V.3    Mingozzi, A.4
  • 15
    • 33845722645 scopus 로고    scopus 로고
    • Two exact algorithms for the capacitated p-median problem
    • A. Ceselli Two exact algorithms for the capacitated p-median problem 4OR: A Quarterly Journal of Operations Research 1 4 2003 319 340
    • (2003) 4OR: A Quarterly Journal of Operations Research , vol.1 , Issue.4 , pp. 319-340
    • Ceselli, A.1
  • 16
    • 25444446924 scopus 로고    scopus 로고
    • A scatter search heuristic for the capacitated clustering problem
    • DOI 10.1016/j.ejor.2004.08.014, PII S0377221704005533, Feature Cluster on Scatter Search Methods for Optimization
    • S. Scheuerer, and R. Wendolsky A scatter search heuristic for the capacitated clustering problem European Journal of Operational Research 169 2 2006 533 547 (Pubitemid 41375706)
    • (2006) European Journal of Operational Research , vol.169 , Issue.2 , pp. 533-547
    • Scheuerer, S.1    Wendolsky, R.2
  • 17
    • 25444497042 scopus 로고    scopus 로고
    • Hybrid scatter search and path relinking for the capacitated p-median problem
    • DOI 10.1016/j.ejor.2004.08.016, PII S0377221704005557, Feature Cluster on Scatter Search Methods for Optimization
    • J.A. Díaz, and E. Fernández Hybrid scatter search and path relinking for the capacitated p-median problem European Journal of Operational Research 169 2 2006 570 585 (Pubitemid 41375708)
    • (2006) European Journal of Operational Research , vol.169 , Issue.2 , pp. 570-585
    • Diaz, J.A.1    Fernandez, E.2
  • 18
    • 4444247308 scopus 로고    scopus 로고
    • Density based problem space search for the capacitated clustering p-median problem
    • DOI 10.1023/B:ANOR.0000039511.61195.21, Meta-Heuristics - Theory, Applications and Software
    • S. Ahmadi, and I. Osman Density based problem space search for the capacitated clustering p-median problem Annals of Operations Research 131 2004 21 43 (Pubitemid 39187373)
    • (2004) Annals of Operations Research , vol.131 , Issue.1-4 , pp. 21-43
    • Ahmadi, S.1    Osman, I.H.2
  • 19
    • 33748549934 scopus 로고    scopus 로고
    • Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
    • C. Prins, C. Prodhon, and R.W. Calvo Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking 4OR: A Quarterly Journal of Operations Research 4 3 2006 221 238
    • (2006) 4OR: A Quarterly Journal of Operations Research , vol.4 , Issue.3 , pp. 221-238
    • Prins, C.1    Prodhon, C.2    Calvo, R.W.3
  • 21
    • 0035458472 scopus 로고    scopus 로고
    • Constructive genetic algorithm for clustering problems
    • L.A. Lorena, and J.C. Furtado Constructive genetic algorithm for clustering problems Evolutionary Computation 9 3 2001 309 327
    • (2001) Evolutionary Computation , vol.9 , Issue.3 , pp. 309-327
    • Lorena, L.A.1    Furtado, J.C.2
  • 24
    • 0035841887 scopus 로고    scopus 로고
    • CF-GGA: A grouping genetic algorithm for the cell formation problem
    • DOI 10.1080/00207540110068781
    • E.C. Brown, and R. Sumichrast CF-GGA: a grouping genetic algorithm for the cell formation problem International Journal of Production Research 36 2001 3651 3669 (Pubitemid 35165506)
    • (2001) International Journal of Production Research , vol.39 , Issue.16 , pp. 3651-3669
    • Brown, E.C.1    Sumichrast, R.T.2
  • 25
    • 33845334819 scopus 로고    scopus 로고
    • A hybrid grouping genetic algorithm for the cell formation problem
    • DOI 10.1016/j.cor.2005.08.010, PII S0305054805002649
    • T.L. James, E.C. Brown, and K.B. Keeling A hybrid grouping genetic algorithm for the cell formation problem Computers & Operations Research 34 2007 2059 2079 (Pubitemid 44879773)
    • (2007) Computers and Operations Research , vol.34 , Issue.7 , pp. 2059-2079
    • James, T.L.1    Brown, E.C.2    Keeling, K.B.3
  • 26
    • 34447625892 scopus 로고    scopus 로고
    • A hybrid grouping genetic algorithm for the registration area planning problem
    • DOI 10.1016/j.comcom.2007.04.018, PII S0140366407001806
    • T. James, M. Vroblefski, and Q. Nottingham A hybrid grouping genetic algorithm for the registration area planning problem Computer Communications 30 10 2007 2180 2190 (Pubitemid 47094961)
    • (2007) Computer Communications , vol.30 , Issue.10 , pp. 2180-2190
    • James, T.1    Vroblefski, M.2    Nottingham, Q.3
  • 28
    • 0037381601 scopus 로고    scopus 로고
    • CPGEA: A grouping genetic algorithm for material cutting plan generation
    • C. Hung, R.T. Sumichrast, and E.C. Brown CPGEA: a grouping genetic algorithm for material cutting plan generation Computers & Industrial Engineering 44 4 2003 651 672
    • (2003) Computers & Industrial Engineering , vol.44 , Issue.4 , pp. 651-672
    • Hung, C.1    Sumichrast, R.T.2    Brown, E.C.3
  • 29
    • 0034974417 scopus 로고    scopus 로고
    • A new heuristic optimization algorithm: Harmony search
    • Z.W. Geem, J. Hoon Kim, and G.V. Loganathan A new heuristic optimization algorithm: harmony search Simulation 76 2 2001 60 68 (Pubitemid 32543074)
    • (2001) Simulation , vol.76 , Issue.2 , pp. 60-68
    • Geem, Z.W.1    Kim, J.H.2    Loganathan, G.V.3
  • 30
    • 33646268618 scopus 로고    scopus 로고
    • Optimal cost design of water distribution networks using harmony search
    • Z.W. Geem Optimal cost design of water distribution networks using harmony search Engineering Optimization 38 3 2006 259 277
    • (2006) Engineering Optimization , vol.38 , Issue.3 , pp. 259-277
    • Geem, Z.W.1
  • 31
    • 44549088410 scopus 로고    scopus 로고
    • Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing
    • R. Forsati, A.T. Haghighat, and M. Mahdavi Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing Computer Communications 31 10 2008 2505 2519
    • (2008) Computer Communications , vol.31 , Issue.10 , pp. 2505-2519
    • Forsati, R.1    Haghighat, A.T.2    Mahdavi, M.3
  • 33
    • 78650031509 scopus 로고    scopus 로고
    • Iterative multiuser detection and channel decoding for DS-CDMA using harmony search
    • R. Zhang, and L. Hanzo Iterative multiuser detection and channel decoding for DS-CDMA using harmony search IEEE Signal Processing Letters 16 10 2009 917 920
    • (2009) IEEE Signal Processing Letters , vol.16 , Issue.10 , pp. 917-920
    • Zhang, R.1    Hanzo, L.2
  • 36
    • 17644395624 scopus 로고    scopus 로고
    • A branch-and-price algorithm for the capacitated p-median problem
    • DOI 10.1002/net.20059
    • A. Ceselli, and G. Righini A branch-and-price algorithm for the capacitated p-median problem Networks 45 3 2005 125 142 (Pubitemid 40567238)
    • (2005) Networks , vol.45 , Issue.3 , pp. 125-142
    • Ceselli, A.1    Righini, G.2
  • 37
    • 67349125399 scopus 로고    scopus 로고
    • A computational evaluation of a general branch-and-price framework for capacitated network location problems
    • A. Ceselli, F. Liberatore, and G. Righini A computational evaluation of a general branch-and-price framework for capacitated network location problems Annals of Operations Research 167 2009 209 251
    • (2009) Annals of Operations Research , vol.167 , pp. 209-251
    • Ceselli, A.1    Liberatore, F.2    Righini, G.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.