Non-linear integer programming by Darwin and Boltzmann mixed strategy

Non-linear integer programming is an NP-complete problem with extensive theoretical and practical backgrounds. Based on the proposed Darwin and Boltzmann mixed strategy, a general stochastic iterative algorithm for the NIP problems is presented. The algorithm synthesizes the advantages of the Darwin...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 105; číslo 1; s. 224 - 235
Hlavní autoři: Tian, Peng, Ma, Jian, Zhang, Dong-Mo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier 16.02.1998
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Algorithms
Applied sciences
Exact sciences and technology
Integer programming
Mathematical programming
Nonlinear programming
Operational research and scientific management
Operational research. Management science
Operations research
Studies
Integer programming
Mixed strategy
Non linear programming
Experimental study
Algorithm
Optimization
Convergence
Polynomial time
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Non-linear integer programming is an NP-complete problem with extensive theoretical and practical backgrounds. Based on the proposed Darwin and Boltzmann mixed strategy, a general stochastic iterative algorithm for the NIP problems is presented. The algorithm synthesizes the advantages of the Darwin strategy and the Boltzmann annealing strategy. It converges asymptotically to the global optimums and has shown to be polynomial in complexity. The experimental evaluations also show that the proposed algorithm is more efficient than the simulated annealing algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(97)00024-6