메뉴 건너뛰기




Volumn 8, Issue 2, 2011, Pages 412-419

An enhanced nested partitions algorithm using solution value prediction

Author keywords

Lower bound; metaheuristic algorithms; nested partitions; solution value prediction

Indexed keywords

COMPUTATIONAL RESOURCES; COMPUTATIONAL TESTS; FUTURE PERFORMANCE; LARGE-SCALE OPTIMIZATION; LARGE-SCALE PROBLEM; LOWER BOUNDS; META HEURISTIC ALGORITHM; META HEURISTICS; NESTED PARTITIONS; OPTIMIZATION ALGORITHMS; RESEARCH AND APPLICATION; VALUE PREDICTION;

EID: 79953779815     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2010.2090655     Document Type: Article
Times cited : (4)

References (23)
  • 1
    • 0016927818 scopus 로고
    • A survey of the state of the art in dynamic programming
    • M. E. Thomas, "A survey of the state of the art in dynamic programming," AIIE Transactions, vol. 8, no. 1, pp. 59-69, 1976.
    • (1976) AIIE Transactions , vol.8 , Issue.1 , pp. 59-69
    • Thomas, M.E.1
  • 3
    • 5444270064 scopus 로고    scopus 로고
    • An exact algorithm for the multiple vehicle pickup and delivery problem
    • Q. Lu and M. Dessouky, "An exact algorithm for the multiple vehicle pickup and delivery problem," Transportation Sci., vol. 38, no. 4, pp. 503-514, 2004.
    • (2004) Transportation Sci. , vol.38 , Issue.4 , pp. 503-514
    • Lu, Q.1    Dessouky, M.2
  • 4
    • 0033102180 scopus 로고    scopus 로고
    • Exact algorithm for the capacitated facility location problems with single sourcing
    • K. Holmberg, M. Ronnqvist, and D. Yuan, "Exact algorithm for the capacitated facility location problems with single sourcing," Eur. J. Oper. Res., vol. 113, no. 3, pp. 544-559, 1999.
    • (1999) Eur. J. Oper. Res. , vol.113 , Issue.3 , pp. 544-559
    • Holmberg, K.1    Ronnqvist, M.2    Yuan, D.3
  • 5
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, no. 4598, pp. 671-680, 1983.
    • (1983) Science , vol.220 , Issue.4598 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 7
    • 0000390120 scopus 로고
    • Taboo search: An approach to the multiple minima problem
    • D. Cvijović and J. Klinowski, "Taboo search: An approach to the multiple minima problem," Science, vol. 267, no. 5198, pp. 664-666, 1995.
    • (1995) Science , vol.267 , Issue.5198 , pp. 664-666
    • Cvijović, D.1    Klinowski, J.2
  • 8
    • 0034179713 scopus 로고    scopus 로고
    • Nested partitions method for global optimization
    • L. Shi and S. Ólafsson, "Nested partitions method for global optimization," Oper. Res., vol. 48, no. 3, pp. 390-407, 2000. (Pubitemid 32415966)
    • (2000) Operations Research , vol.48 , Issue.3 , pp. 390-407
    • Shi, L.1    Olafsson, S.2
  • 9
    • 84966254647 scopus 로고
    • Estimating the efficiency of backtrack programs
    • D. E. Knuth, "Estimating the efficiency of backtrack programs," Math. Comput., vol. 29, no. 129, pp. 121-136, 1975.
    • (1975) Math. Comput. , vol.29 , Issue.129 , pp. 121-136
    • Knuth, D.E.1
  • 10
    • 38549095275 scopus 로고    scopus 로고
    • Performance prediction and preselection for optimization and heuristic solution procedures
    • DOI 10.1287/opre.1070.0398
    • N. G. Hall and M. E. Posner, "Performance prediction and preselection for optimization and heuristic solution procedures," Oper. Res., vol. 55, no. 4, pp. 703-716, 2007. (Pubitemid 351159551)
    • (2007) Operations Research , vol.55 , Issue.4 , pp. 703-716
    • Hall, N.G.1    Posner, M.E.2
  • 11
    • 33645574693 scopus 로고    scopus 로고
    • Early estimates of the size of branch-and-bound trees
    • DOI 10.1287/ijoc.1040.0107
    • G. Cornuejols, M. Karamanov, and Y. Li, "Early estimates of the size of branch-and-bound trees," INFORMS J. Computing, vol. 18, pp. 86-96, 2006. (Pubitemid 43515948)
    • (2006) INFORMS Journal on Computing , vol.18 , Issue.1 , pp. 86-96
    • Cornuejols, G.1    Karamanov, M.2    Li, Y.3
  • 12
    • 77649318858 scopus 로고    scopus 로고
    • Optimal budget allocation for discrete-event simulation experiments
    • C.-H. Chen, E. Yücesan, L. Dai, and H.-C. Chen, "Optimal budget allocation for discrete-event simulation experiments," IIE Transactions, vol. 42, no. 1, pp. 60-70, 2010.
    • (2010) IIE Transactions , vol.42 , Issue.1 , pp. 60-70
    • Chen, C.-H.1    Yücesan, E.2    Dai, L.3    Chen, H.-C.4
  • 13
    • 0034135525 scopus 로고    scopus 로고
    • A method for scheduling in parallel manufacturing systems with flexible resources
    • S. Ólafsson and L. Shi, "A method for scheduling in parallel manufacturing systems with flexible resources," IIE Transactions, vol. 32, pp. 135-146, 2000.
    • (2000) IIE Transactions , vol.32 , pp. 135-146
    • Ólafsson, S.1    Shi, L.2
  • 14
    • 0035707473 scopus 로고    scopus 로고
    • An optimization framework for product design
    • L. Shi, S. Ólafsson, and Q. Chen, "An optimization framework for product design," Manage. Sci., vol. 47, no. 12, pp. 1681-1692, 2001. (Pubitemid 34126295)
    • (2001) Management Science , vol.47 , Issue.12 , pp. 1681-1692
    • Shi, L.1    Olafsson, S.2    Chen, Q.3
  • 15
    • 0037233381 scopus 로고    scopus 로고
    • Optimal buffer allocation in production lines
    • L. Shi and S. Men, "Optimal buffer allocation in production lines," IIE Transactions, vol. 35, pp. 1-10, 2003.
    • (2003) IIE Transactions , vol.35 , pp. 1-10
    • Shi, L.1    Men, S.2
  • 16
    • 54849158500 scopus 로고    scopus 로고
    • Hybrid nested partitions and mathematical programming approach and its applications
    • Oct.
    • L. Pi, Y. Pan, and L. Shi, "Hybrid nested partitions and mathematical programming approach and its applications," IEEE Trans. Autom. Sci. Eng., vol. 5, no. 4, pp. 573-586, Oct. 2008.
    • (2008) IEEE Trans. Autom. Sci. Eng. , vol.5 , Issue.4 , pp. 573-586
    • Pi, L.1    Pan, Y.2    Shi, L.3
  • 17
    • 42949178687 scopus 로고    scopus 로고
    • A nested partitions framework for solving large-scale multicommodity facility location problems
    • L. Shi, R. R. Meyer, M. Bozbay, and A. J. Miller, "A nested partitions framework for solving large-scale multicommodity facility location problems," J. Syst. Sci. Syst. Eng., vol. 13, no. 2, pp. 158-179, 2004. (Pubitemid 39064477)
    • (2004) J. Syst. Sci. Syst. Eng. , vol.13 , Issue.2 , pp. 158-179
    • Shi, L.1    Meyer, R.R.2    Bozbay, M.3    Miller, A.J.4
  • 18
    • 0032782385 scopus 로고    scopus 로고
    • New parallel randomized algorithms for the traveling salesman problem
    • L. Shi, S. Ólafsson, and N. Sun, "New parallel randomized algorithms for the traveling salesman problem," Comput. Oper. Res., vol. 26, pp. 374-391, 1999.
    • (1999) Comput. Oper. Res. , vol.26 , pp. 374-391
    • Shi, L.1    Ólafsson, S.2    Sun, N.3
  • 19
    • 34249857453 scopus 로고    scopus 로고
    • On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
    • DOI 10.1007/s10107-006-0013-4
    • Y. Pan and L. Shi, "On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems," Math. Program., Series A, vol. 110, no. 3, pp. 543-559, 2006. (Pubitemid 46862320)
    • (2007) Mathematical Programming , vol.110 , Issue.3 , pp. 543-559
    • Pan, Y.1    Shi, L.2
  • 20
    • 0022129621 scopus 로고
    • Using confidence limits for the global optimum in combinatorial optimization
    • U. Derigs, "Using confidence limits for the global optimum in combinatorial optimization," Oper. Res., vol. 33, no. 5, pp. 1024-1049, 1985. (Pubitemid 15589838)
    • (1985) Operations Research , vol.33 , Issue.5 , pp. 1024-1049
    • Derigs, U.1
  • 23
    • 0026225350 scopus 로고
    • TSPLIB - A traveling salesman problem library
    • G. Reinelt, "TSPLIB - A traveling salesman problem library," ORSA J. Computing, vol. 3, pp. 376-384, 1991.
    • (1991) ORSA J. Computing , vol.3 , pp. 376-384
    • Reinelt, G.1


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