In recent years, there have been many studies in which tailored heuristics and meta-heuristics have been applied to specic optimisation problems. These codes can be extremely ecient, but may also lack generality. In contrast, this research focuses on build
ÒÖÐÅØ¹ÀÙÖר ÓÑÒØÓÖ
×
ËÓÐÚÖÓÖ
ÐÇÔØÑרÓÒÈÖÓÐÑ× ÅÖ Ù×ÊÒÐÐ
£
Ë ÓÓÐÓÓÒ
ÁÒÓÖÑØÓÒÌ ÒÓÐÓݾ¸ÙרÖÐ
ÍÒÚÖ×ØÝ¸ÉÄÚ
ÖÑ×ÓÒÒ ÒËÓØÛÖ¿½¸ÒÒÖÒ
Ë ÓÓÐÓ
ÓÑÔÙØÖË
ÅÓÒ×
ÍÒÚÖ×ØÝ¸ÎÁ
ÙרÖÐ
ÅÖ
¾¿¸¾¼¼¼
×ØÖ Ø
ÁÒÖ ÒØÝÖ׸ØÖÚÒÑÒÝרÙ×ÒÛ ØÐÓÖÙÖר ×ÒÑØ¹ÙÖר ×ÚÒÔÔÐØÓ×Ô ¬ ÓÔØÑ¹×ØÓÒÔÖÓÐÑ׺Ì× Ó× ÒÜØÖÑÐÝÆ ÒØ¸ÙØÑÝÐ×ÓÐ ÒÖÐØÝºÁÒ ÓÒØÖר¸Ø×Ö×Ö Ó Ù××ÓÒÙÐÒÒÖйÔÙÖÔÓ× ÓÑÒØÓÖÐÓÔØÑרÓÒÔÖÓÐÑ×ÓÐÚÖÙ×ÒÚÖØÝÓÑØ¹ÙÖר ÐÓÖØÑ×Ò ÐÙÒËÑÙÐØÒÒÐÒÒÌÙËÖ ºÌ×ÝרÑ×ÒÓÚÐ ÙרÙ××ÑÓÐÐÒÒÚÖÓÒÑÒØÒÛ Ø×ÓÐÙØÓÒ×רÓÖÒÒ×ÝÒÑ ÐררÖÙ ØÙÖ׸ÙÒÐÑÓÖ ÓÒÚÒØÓÒÐ×ÔÖ×Ú ØÓÖÒÓØØÓÒº Ù×Ө׏ØÒ ÓÖÔÓÖØ×ÒÙÑÖÓÒÓÙÖÓÓ×Ö ÓÔÖØÓÖרØÖÒÓÖÑÐÐÝÓÒÐÝÓÙÒÒØÐÓÖ Ó×ÒØÔÖÓÖÑ×ÛÐÐÓÒÖÒÓÔÖÓÐÑ׺ÌÒÖÐÒØÙÖÓØ×ÝרÑÐÐÓÛ×ÑÓÐÚÐÓÔÖØÓÖÔÐÝÔÖÓØÓØÝÔ«ÖÒØÔÖÓÐÑ×ºÌ ÛÓÙÐÐØÓØÒØÉÙÙ×ÓØÁÅËȾ ÓÑÔÙØÖºÌ×ÓÙÒ ÐÄÖÖÒØºÌÒ×ÓØÓÒÚÖÓÒÑÒØÐÒÔÔÐË Ò ÓÖ×ÓÐÚÖº £Ï
Ò×ÐÒÈÖÐÐÐËÙÔÖ ÓÑÔÙØÒ ÐØÝÓÖØÛÓÖÛ××ÙÔÔÓÖØÝÒÙרÖÐÒÊ×Ö ÖÐÝÏÐÖÓÑÖÆØÍÒÚÖרÝË ÓÓÐÓ××××ØÒ ÛØØ×ØØ×Ø ÐÚÐÙØÓÒÓØ
½
A General Meta-Heuristic... 暂无评价 36页 免费...Multilevel Refinement for Combinatorial Optimisation Problems...hierarchy of approximations to the original prob...
a hard dynamic combinatorial optimisation problem tackled...compared with other (meta) heuristic-based methods...as well as developing a general and reusable f...
PROCEDURES AND COMBINATORIAL OPTIMISATION PROBLEMS_...problem, with a construction heuristic that uses ...A General Meta-Heurist... 暂无评价 36页 免费 ...
Duality in Linear Programming General LP: f (x) = c1x1 + c2x2 + … ...a combinatorial optimisation problem Q (minimisation) inst(Q) … the set ...
combinatorial particle swarm optimisation for solving...owtime is a common scheduling problem, which is ...Furthermore, we incorporate in this heuristic an ...
A General Meta-Heuristic... 暂无评价 36页 免费...managing combinatorial optimisation sub-problems in ...the hard parts of a problem instance eectively. ...
A General Meta-Heuristic... 暂无评价 36页 免费...managing combinatorial optimisation sub-problems in ...the hard parts of a problem instance eectively. ...
The Bin Packing Problem and the Cutting Stock Problem are two related classes...ACO is a new meta-heuristic for combinatorial optimisation and other problems...
problem using a hyper-heuristic approach can be ...(1986) to solve combinatorial optimisation problems...The general framework for our hyper-heuristic ...
ed. The travelling tournament problem is a complex combinatorial problem, for...heuristic inspired by ant colony optimisation In a second heuristic for the ...
热门文档