메뉴 건너뛰기




Volumn 62, Issue 11, 2011, Pages 2034-2046

Scatter tabu search for multiobjective clustering problems

Author keywords

combinatorial data analysis; multiobjective optimization; partitioning; scatter and tabu search; SSPMO

Indexed keywords

COMBINATORIAL OPTIMIZATION; DATA HANDLING; DECISION MAKING; HEURISTIC METHODS; INFORMATION ANALYSIS; TABU SEARCH;

EID: 80053502576     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2010.180     Document Type: Article
Times cited : (18)

References (23)
  • 1
    • 72449191364 scopus 로고    scopus 로고
    • Implementation of scatter search for multiobjetive optimization: A comparative study
    • Banos R, Gil C, Reca J and Martinez J (2009). Implementation of scatter search for multiobjetive optimization: A comparative study. Comput Optim Appl 42: 421-441.
    • (2009) Comput Optim Appl , vol.42 , pp. 421-441
    • Banos, R.1    Gil, C.2    Reca, J.3    Martinez, J.4
  • 4
    • 67849104698 scopus 로고    scopus 로고
    • Cross validation issues in multiobjective clustering
    • Brusco MJ and Steinley D (2009). Cross validation issues in multiobjective clustering. Brit J Math Stat Psy 62: 349-368.
    • (2009) Brit J Math Stat Psy , vol.62 , pp. 349-368
    • Brusco, M.J.1    Steinley, D.2
  • 5
    • 0036479162 scopus 로고    scopus 로고
    • A simulated annealing heuristic for a bicriterion partitioning problem in market segmentation
    • Brusco MJ, Cradit JD and Stahl S (2002). A simulated annealing heuristic for a bicriterion partitioning problem in market segmentation. J Marketing Res XXXIX: 99-109.
    • (2002) J Marketing Res , vol.39 , pp. 99-109
    • Brusco, M.J.1    Cradit, J.D.2    Stahl, S.3
  • 6
    • 0038729375 scopus 로고    scopus 로고
    • Multicriterion clusterwise regression for joint segmentation settings: An application to customer value
    • DOI 10.1509/jmkr.40.2.225.19227
    • Brusco MJ, Cradit JD and Tashchian A (2003). Multicriterion custerwise regression for join segmentation settings: An application to customer value. J Marketing Res XL: 225-234. (Pubitemid 36650020)
    • (2003) Journal of Marketing Research , vol.40 , Issue.2 , pp. 225-234
    • Brusco, M.J.1    Cradit, J.D.2    Tashchian, A.3
  • 9
    • 0001322778 scopus 로고    scopus 로고
    • A survey and annotated bibliography on multiobjective combinatorial optimization
    • Ehrgott M and Gandibleux X (2000). A survey and annotated bibliography on multiobjective combinatorial optimization. OR Spektrum 22: 425-460.
    • (2000) OR Spektrum , vol.22 , pp. 425-460
    • Ehrgott, M.1    Gandibleux, X.2
  • 10
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publishers: Boston, MA
    • Glover F and Laguna M (1997). Tabu Search. Kluwer Academic Publishers: Boston, MA.
    • (1997) Tabu Search
    • Glover, F.1    Laguna, M.2
  • 11
    • 33947227459 scopus 로고    scopus 로고
    • An evolutionary approach to multiobjective clustering
    • DOI 10.1109/TEVC.2006.877146
    • Handl J and Knowles J (2007). An evolutionary approach to multiobjective clustering. IEEE T Evolut Comput 11: 56-76. (Pubitemid 46421668)
    • (2007) IEEE Transactions on Evolutionary Computation , vol.11 , Issue.1 , pp. 56-76
    • Handl, J.1    Knowles, J.2
  • 12
    • 84871508443 scopus 로고
    • Complete-link cluster analysis by graph coloring
    • Hansen P and Delattre M (1978). Complete-link cluster analysis by graph coloring. J Am Stat Assoc 73: 397-403.
    • (1978) J Am Stat Assoc , vol.73 , pp. 397-403
    • Hansen, P.1    Delattre, M.2
  • 13
    • 0002184794 scopus 로고
    • Maximum sum-of-splits clustering
    • Hansen P, Jaumard B and Frank O (1989). Maximum sum-of-splits clustering. J Classif 6: 177-193.
    • (1989) J Classif , vol.6 , pp. 177-193
    • Hansen, P.1    Jaumard, B.2    Frank, O.3
  • 14
    • 0030520525 scopus 로고    scopus 로고
    • Modifying cluster-based segments to enhance agreement with an exogenous response variable
    • Krieger AM and Green PE (1996). Modifying cluster-based segments to enhance agreement with an exogenous response variable. J Marketing Res 33: 351-363.
    • (1996) J Marketing Res , vol.33 , pp. 351-363
    • Krieger, A.M.1    Green, P.E.2
  • 16
    • 0031160925 scopus 로고    scopus 로고
    • An examination of deal proneness across sales promotion types: A consumer segmentation perspective
    • PII S0022435997900075
    • Lichtenstein DR, Burton S and Netemeyer RG (1997). An examination of deal proneness across sales promotion types: A consumer segmentation perspective. J Retailing 73: 283-297. (Pubitemid 127337982)
    • (1997) Journal of Retailing , vol.73 , Issue.2 , pp. 283-297
    • Lichtenstein, D.R.1    Burton, S.2    Netemeyer, R.G.3
  • 17
    • 43649104172 scopus 로고    scopus 로고
    • SSPMO: A scatter tabu search procedure for non-linear multiobjective optimization
    • Molina J, Laguna M, Marti R and Caballero R (2007). SSPMO: A scatter tabu search procedure for non-linear multiobjective optimization. INFORMS J Comput 19: 91-100.
    • (2007) INFORMS J Comput , vol.19 , pp. 91-100
    • Molina, J.1    Laguna, M.2    Marti, R.3    Caballero, R.4
  • 19
    • 70349286817 scopus 로고    scopus 로고
    • GRASP and path relinking for the max-min diversity problem
    • Resende MGC, Marti R, Gallego M and Duarte A (2009). GRASP and path relinking for the max-min diversity problem. Comput Opns Res 37: 498-508.
    • (2009) Comput Opns Res , vol.37 , pp. 498-508
    • Mgc, R.1    Marti, R.2    Gallego, M.3    Duarte, A.4
  • 20
    • 0013458646 scopus 로고
    • The two-phase method: An efficient procedure to solve bi-objective combinatorial optimization problems
    • Ulungu E and Teghem J (1994). The two-phase method: An efficient procedure to solve bi-objective combinatorial optimization problems. Found Comput Decis Sci 20: 149-165.
    • (1994) Found Comput Decis Sci , vol.20 , pp. 149-165
    • Ulungu, E.1    Teghem, J.2
  • 21
    • 0000934663 scopus 로고    scopus 로고
    • Two-phases method and branch and bound procedures to solve the Bi-objective knapsack problem
    • Visee M, Teghem J, Pirlot M and Ulungu E (1998). Two-phase method and branch and bound procedures to solve the bi-objective knapsack problem. J Global Optim 12: 139-155. (Pubitemid 128507670)
    • (1998) Journal of Global Optimization , vol.12 , Issue.2 , pp. 139-155
    • Visee, M.1    Teghem, J.2    Pirlot, M.3    Ulungu, E.L.4
  • 23
    • 0033318858 scopus 로고    scopus 로고
    • Multiobjective evolutionary algorithms a comparative case study and the strength pareto approach
    • DOI 10.1109/4235.797969
    • Zitzler E and Thiele L (1999). Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE T Evolut Comput 3: 257-271. (Pubitemid 30544879)
    • (1999) IEEE Transactions on Evolutionary Computation , vol.3 , Issue.4 , pp. 257-271
    • Zitzler Eckart1    Thiele Lothar2


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