布局问题

布局问题属于高复杂度的典型NP难度问题，对机械、船舶和汽车等制造行业有重要意义。

The packing problem belongs to a typical high complexity NP problem . Packing problem has a significant influence on the industries such as manufacturing , ship-building , automobile industry .

基于空间分解的二维布局问题的启发式算法

A heuristic method for two-dimensional packing problem based on space decomposition

布局问题属于NP完全问题。

Packing problems are categorized as NP - complete .

求解VLSI布局问题的启发式算法

A Heuristic Algorithm for Solving VLSI Block Placement Problem

VLSI布局问题的神经网络优化设计方法

Optimization Design for VLSI Layout with Neural Networks

布局问题是NP-hard问题。

Packing problems are categorized as NP - hard problems .

文章以热可靠性分析为基础，对PCB板元器件布局问题进行优化研究。

The aim of this thesis is the place optimization of the PCB , based on the thermal fail-safe analysis .

目前针对TOD布局问题的研究还不充分。

At present , the research is not sufficient for the TOD layout problem .

卫星舱布局问题为带性能约束的布局优化问题，是航天设计中亟待解决的问题，属拓扑优化范畴，为NP困难的。

The layout of the satellite module is the layout optimization with performance constraints . It is a topological optimization , and NP-hard .

集成电路布局问题是一个非常复杂的组合优化问题，已被证明是NP-Hard问题。

VLSI placement is a quite complicated combination optimization problem , which is proved to be a NP-Hard problem .

PDF文件中的所有格式和布局问题都是由Toot-O-Matic处理的。

All of the formatting and layout issues in the PDF files are handled by the Toot-O-Matic .

本文以GIS为辅助工具，以地理学和区域经济学有关理论为指导，对大连庄河市海洋产业空间布局问题进行探讨。

This article take GIS as the auxiliary means , and take the geography and the regional economics related theory as the instruction , and carry on the discussion to the Zhuanghe sea industry space layout question .

基于AutoCAD平台开发了一个用于矩形正交布局问题的布局模装系统，可实现交互布局和自动布局。

On the basis of AutoCAD , a packing simulation system is developed , which can be applied for rectangle orthogonal packing problem . It realized interactive packing and automatic packing .

随着超大规模集成电路（VLSI）复杂度的急剧增加，人们对其中的模块布局问题提出了更高的要求。

With the dramatic increase in the complexity of very large scale integrated circuits ( VLSI ), people have proposed higher standards for the modules ' placement problem .

由于该布局问题属于NP-完全问题，构造一个带局部搜索的多目标遗传算法求解该问题的Pareto非劣解集。

Since this problem is NP-hard , we develop a new multi-objective genetic algorithm approach hybridized with local search to obtain the set of its Pareto solutions .

进而，针对诸如航天器的复杂工程布局问题的特点，基于协同演化方法和GDE算法，给出了协同混合遗传差异演化方法。

According to the characteristics of layout problems ; based on GDE and cooperative co-evolutionary algorithms ; a cooperative GDE is also presented .

家族保护遗传算法（KPGA）解决设备布局问题的研究

Use of Kindred-protected Genetic Algorithm ( KPGA ) in Solving Facility Layout Problem

由于设备布局问题是NP完全问题，它在有限合理的时间内难以求得最优解，因此问题的求解只能依赖于各种启发式方法。

The machine layout problem is an NP-complete problem , it is very difficult , even impossible to find the optimum solution in a reasonable amount of time , so it can only be solved by use of the heuristic algorithms .

并通过解决一个实际布局问题，阐述了CSLP的具体应用方法及其对减少工作地干扰的作用。

And by addressing a practical layout , we described CSLP and its specific application methods to reduce workplace distraction .

针对多电源组芯片的高密度引脚布局问题，提出一种瞬态仿真方法，可优化的电源引脚放置方案，达到ESD性能与引脚数量之间的折中。

For high pin count , multi-power domain SOC , this dissertation presented a new transient simulation methodology . This methodology can optimize the power pin placement plan in order to archive the best combination between ESD performance and the numbers of pin .

RMS的快速可重构性意味着其设备布局问题不同于传统的布局问题，如何在较短时间内制定合理的布局重构方案并将之快速实现是RMS设备布局问题研究的重点。

The rapid reconfigurability of RMS means its facilities layout problem is different from traditional layout problem . The key point to research facilities layout problem of RMS is how to formulate the reasonable layout reconfiguring scheme and realize it rapidly in the shorter time .

利用同余方程解决k-aryn-cube网络上距离为t的完美资源布局问题，它比通常利用错误效正码简单得多，而且容易实现。

The Congruence equation is used to solve perfect distance-t resource placement in a k-ary n-cube . This approach is more simple than using error-correcting coding and easy to be implemented .

抽象物体的2~n-叉树表示及其在高维布局问题中的应用

2 ~ n-Tree Representation and Its Application in High-Dimensional Layout Problem

用神经网络求解时间驱动的宏单元布局问题

A neural network approach for the timing driven macro cell placement

具有性能约束布局问题的优化算法及收敛性

Algorithm of layout optimization problem with performance constraints and its convergence

供应链中分销中心布局问题的区间规划模型及解法

An Interval Programming Model and Algorithm for Distribution Centers Layout Problems

面向布局问题求解的混合全局优化算法研究

A mixed global optimization algorithm ( MGOA ) for packing problems

带性能约束布局问题的不干涉遗传算法

Non overlapped genetic algorithm for layout problem with behavioral constraints

北欧文明的展示黔北山区城镇合理布局问题

On distribution of cities and towns in mountain area Northern Guizhou Province

这是一种复杂的带性能约束的立体空间布局问题，在数学上可以归结为组合最优化。

It can be boiled down to combinatorial optimization problem in mathematics .