ABS
发表于 2025-3-21 16:34:55
书目名称Hybrid Metaheuristics影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0430131<br><br> <br><br>书目名称Hybrid Metaheuristics影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0430131<br><br> <br><br>书目名称Hybrid Metaheuristics网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0430131<br><br> <br><br>书目名称Hybrid Metaheuristics网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0430131<br><br> <br><br>书目名称Hybrid Metaheuristics被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0430131<br><br> <br><br>书目名称Hybrid Metaheuristics被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0430131<br><br> <br><br>书目名称Hybrid Metaheuristics年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0430131<br><br> <br><br>书目名称Hybrid Metaheuristics年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0430131<br><br> <br><br>书目名称Hybrid Metaheuristics读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0430131<br><br> <br><br>书目名称Hybrid Metaheuristics读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0430131<br><br> <br><br>
NICE
发表于 2025-3-21 21:56:14
Hybrid Metaheuristics for Multi-objective Combinatorial Optimization,act and heuristic approaches. In this chapter we give an overview over approximation methods in multi-objective combinatorial optimization. We briefly summarize “classical” metaheuristics and focus on recent approaches, where metaheuristics are hybridized and/or combined with exact methods.
衍生
发表于 2025-3-22 03:29:31
http://reply.papertrans.cn/44/4302/430131/430131_3.png
富饶
发表于 2025-3-22 08:01:16
http://reply.papertrans.cn/44/4302/430131/430131_4.png
Forage饲料
发表于 2025-3-22 09:15:23
Hybridizations of Metaheuristics With Branch & Bound Derivates, branch & bound, respectively branch & bound derivatives such as beam search. The quality of the resulting hybrid techniques is demonstrated by means of the application to classical string problems: the longest common subsequence problem and the shortest common supersequence problem.
Watemelon
发表于 2025-3-22 16:41:27
Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO, for each type. The central distinction is between tight coupling in which both components collaborate in an interleaved fashion and loose coupling where both components run in parallel, exchanging only (partial) solutions and bounds.
ULCER
发表于 2025-3-22 18:35:30
http://reply.papertrans.cn/44/4302/430131/430131_7.png
大吃大喝
发表于 2025-3-22 22:19:39
Hybrid Metaheuristics for Packing Problems,and mathematical programming techniques of linear, nonlinear and/or dynamic programming. Basic ideas of these algorithms are explained on a unified basis, together with some computational results. It appears to indicate that mathematical programming is a vital tool for enhancing metaheuristic algorithms.
Inferior
发表于 2025-3-23 03:33:34
http://reply.papertrans.cn/44/4302/430131/430131_9.png
wall-stress
发表于 2025-3-23 08:40:13
http://reply.papertrans.cn/44/4302/430131/430131_10.png