启发式算法

在数学规划模型的基础上，提出了一种新的启发式算法，同时给出了和一般求解方法GA算法的数值比较结果，验证了该启发式算法的有效性。

A heuristic approach was then proposed to solve the corresponding mathematical programming , and some numerical example was adopted to illustrate the proposed approach .

根据现代制造企业对生产调度的要求，提出了一种启发式算法和遗传算法相结合的生产调度系统结构。

A framework for production scheduling that integrated heuristic approach with genetic algorithm was put forward according to the demands for production scheduling of modern manufactur - ing corporation .

求解置换FlowShop调度问题的一种启发式算法

A Heuristic Algorithm for Flow Shop Scheduling Problem

CNC机床中刀具交换问题的启发式算法

A Heuristic Algorithm for Tool Switching Problem on CNC Machine Tool

基于Progressive多序列比对方法的求解多序列比对的启发式算法

A heuristic algorithm for multiple sequence alignment base on progressive multiple alignment

使用着色Petri网实现调度仿真系统中的启发式算法

Heuristics Algorithm of Scheduling Simulation System Using Coloured Petri Nets

求解含非线性参数的QoS路由的启发式算法

Heuristic Algorithm for QoS Route with Nonlinear Parameters

一种新的基于Dijkstra算法的QoS组播树启发式算法

A new QoS multicast tree heuristic algorithm based on Dijkstra algorithm

ATM网络虚拟路由的启发式算法

Heuristic Algorithm of ATM Network Virtual Route

带权PLA折叠问题及其启发式算法

The weighted PLA folding problem and its heuristic algorithms

提出了带宽时延约束、代价最小的QoS多播路由模型，并提出了一种启发式算法求解该问题，分析了算法的复杂度。

We introduce the delay-bandwidth constrained least-cost multicast routing problem model , and propose a heuristic algorithm based Source-Routing strategy .

基于CPM的非流水作业排序启发式算法

Study on the Heuristic Algorithm of Unflowing Job Scheduling Based on CPM

本文提出一种求解QoS路由问题的新启发式算法，该算法求解基于带宽、时延、丢失率的多约束优化路问题，通过构造评价函数调用最短路算法迭代求解，具有较小的时间复杂度。

This paper presents a new heuristic algorithm to find an optimal solution based on considering bandwidth , delay and loss requirements .

具有优势机器的无空闲同顺序FlowShop排序问题（英文）Flowshop排序问题F2prmu∑ωjCj的一个启发式算法

No-idle Permutation Flow Shop Scheduling Problem with Dominant Machines A heuristic algorithm for F2 | prmu | ∑ω _jC_j

一种新的求解Job-shop调度问题的自适应神经网络和启发式算法混合方法

A New Adaptive Neural Network and Heuristics Hybrid Algorithm for Job-Shop Scheduling

客车调度问题（BSP）的数学模型及一种新的启发式算法

Mathematical Model for Bus Scheduling Problem And Its New Heuristic Algorithm

多约束条件下的QoS路由问题是一个NP-完全问题，一般采用启发式算法寻找其次优解。

Multiple constrained QoS routing problem is a NP-complete problem . Currently , we search hypo-excellent paths using heuristic algorithm to solve this problem .

提出了一种启发式算法来解决在无线局域网络中，考虑失效容忍和QoS约束的访问点放置问题。

Propose a heuristic method to tackle the issues of fault tolerance access point ( AP ) placement with QoS constraint in wireless local area networks .

分析和实验表明该方法较常用的启发式算法（heuristicalgorithm），它不仅约束条件少，有较令人满意的算法复杂度，而且最优效果好。

The results we analyzing and tested show that it is better than the heuristic algorithm common used , for less restriction terms , more satisfying algorithm complexity and better optimized results .

带有时间窗的车辆调度问题是比VRP复杂程度更高的NP难题，以往的学者多致力于启发式算法的研究。

The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VRP .

蚁群算法作为一类启发式算法，已经成功地应用于求解TSP问题。

Ant colony algorithm is a class of heuristic search algorithms that have been successfully applied to solving NP hard problems .

PDES信息管理的一种启发式算法

A Heuristic Algorithm for Message Management in PDES

CIMS中CLSP问题的新遗传启发式算法

New Genetic Heuristic Algorithms to Solve CLSP in CIMS

车辆路径问题（VRP）的一个启发式算法

A heuristic algorithm for vehicle routing

通过对遗传算法的研究，并模拟了生物个体的成长机制，本文提出了一种新的启发式算法&成长算法（Grown-UpAlgorithm，简称GUA）。

Based on studying of Genetic Algorithms and organism grown-up , this paper give a new heuristics , called Grown-Up Algorithm ( GUA ) .

在给出了此类问题的描述后，着重阐述了TS启发式算法的设计，编程实现此算法的要点。

After describing this kind of problem , the paper emphasized the design procedure of TS algorithm and the main points of programming .

研究表明，这两个最小覆盖问题都是NP-HARD问题，只能采用启发式算法求次优解。

The two minimum cover problem are NP-HARD all . So we can calculate the near-optimum solution with heuristic algorithm .

首先将负载均衡与WebQOS控制结合，在已有的启发式算法上进行改进和优化，提出了新的基于Qos控制的负载均衡启发式算法。

Load balancing and Web Qos control are combined at first . The existing heuristic algorithm are improved and optimized , and a new load balancing heuristic algorithm based on Web Qos control is presented .

资源平衡优化问题即资源有限项目调度问题，是一个NP难问题，现在商用项目管理软件系统中的资源平衡优化问题多采用基于优先规则的启发式算法。

The resource-constrained project scheduling problem ( RCPSP ) is NP problem , most of commercial project management software usually employ simple priority rules for solving the problem .

本文使用分组机器模型的方法证明：即使对于多机FlowShop加权完成时间调度问题，基于有效作业加权最短处理时间的启发式算法也是渐近最优的。

By grouping this machine setting , this paper proves that the heuristic based on weighted shortest processing time among the available jobs is also asymptotically optimal , even for the multi - processor flow shop weighted completion time scheduling problem .