A Hybrid Algorithm for Hard Engerneering Satisfiability Problem

提出了一个求解难可满足性问题的简单混合算法 .拟人和禁忌表两个策略被给出 .数值实验表明 ,对于一类公认比较难的可满足性问题 ,该算法胜过目前据认为是最好方法之一的 NOVEL TY算法Ahybrid algorithm for solving the satisfiability problem is proposed. Personification strategy and tabu list strategy are presented. Computational experiments on a class of hard problem instances show that, our proposed algorithm yields better results than Novelty algorithm which is currently among the fastest known

3D DNA Self-Assembly Model for Graph Vertex Coloring

DNA self-assembly technology has brought novel inspirations to the development of DNA computing Diversified computational models based on DNA self-assembly have been used to solve various NP problems. In this paper, a 3D DNA self-assembly model is presented to solve the Graph Vertex Coloring problem. With the capacity of DNA molecules in massive parallel computation, the model can simulate a non-deterministic algorithm and solve the problem in linear time Theta(n) The number of distinct tiles used in the model is Theta(k(2)), where k is the size of the color set For the vertex 3-coloring problem, the model requires only 22 types of distinct tiles. Our work makes a significant attempt for exploring the computational power of 3D DNA self-assembl

基于遗传算法求解实际车辆调度问题

车辆路由问题有许多变种,传统的算法在某些特殊的问题上无法很好的表现。该文提出了一种新型的遗传算法求解思路,实验表明该方法对带时间窗口多路程的接送车辆路由问题有很好的适应性

A Bricklaying Heuristic Algorithm for the Orthogonal Rectangular

中文摘要：为求解正交矩形Packing 问题提出了一个新颖而有效的砌墙式启发式算法. 该算法主要基于砌墙式启发式策略,其思想主要来源于砖匠在砌墙过程中所积累的经验:基于基准砖的砌墙规则. 对国际上公认的大量的Bench-mark 问题例的计算结果表明,该算法的计算速度不仅比著名的现代启发式算法快,而且获得更优的高度.英文摘要：Abstract 　A novel and effective bricklaying heuristic algorit hm for two-dimensional rectangular Packing problem is presented. This algorit hm is mainly based on bricklaying heuristic st rategies inspired by a large number of experiences accumulated by bricklayers during t he process of building t he wall , especially , t he building wall st rategy based on t he reference brick is presented. The computational result s on large number of Benchmark p roblems have shown that this algorithm not only runs in shorter time t han known meta-heuristic but al so finds shorter height .国家自然科学基金(60773126) 、福建省自然科学基金(A0710023) 、厦门大学院士启动基金(X01109) 、厦门大学“九八五”信息科技基金(00002X07204) 资助

A Hybrid Simulated Annealing Algorithm for the Three-Dimensional Packing Problem

提出了一个高效求解三维装箱问题(THrEE dIMEnSIOnAl COnTAInEr lOAdIng PrOblEM 3d-ClP)的混合模拟退火算法.三维装箱问题要求装载给定箱子集合的一个子集到容器中,使得被装载的箱子总体积最大.文中介绍的混合模拟退火算法基于三个重要算法:(1)复合块生成算法,与传统算法不同的是文中提出的复合块不只包含单一种类的箱子,而是可以在一定的限制条件下包含任意种类的箱子.(2)基础启发式算法,该算法基于块装载,可以按照指定装载序列生成放置方案.(3)模拟退火算法,以复合块生成和基础启发式算法为基础,将装载序列作为可行放置方案的编码,在编码空间中采用模拟退火算法进行搜索以寻找问题的近似最优解.文中采用1500个弱异构和强异构的装箱问题数据对算法进行测试.实验结果表明,混合模拟退火算法的填充率超过了目前已知的优秀算法.This paper presents an efficient hybrid simulated annealing algorithm for three dimensional container loading problem (3D-CLP).The 3D-CLP is the problem of loading a subset of a given set of rectangular boxes into a rectangular container so that the stowed volume is maximized.The algorithm introduced in this paper is based on three important algorithms.First,complex block generating,complex block can contain any number boxes of different types,which differs from the traditional algorithm.Second,basic heuristic,which is a new construction heuristic algorithm used to generate a feasible packing solution from a packing sequence.Third,simulated annealing algorithm,based on the complex block and basic heuristic,it encodes a feasible packing solution as a packing sequence,and searches in the encoding space to find an approximated optimal solution.1500 benchmark instances with weakly and strongly heterogeneous boxes are considered in this paper.The computational results show that the volume utilization of hybrid algorithm outperforms current excellent algorithms for the considered problem

A comparison study of credit scoring models

In this paper we consider a credit scoring problem. We compare three powerful credit scoring models: genetic programming (GP), backpropagation neural networks (BP) and support vector machines (SVM) when applied to this problem, then we give a combined model. The results show that the combined model produces good classification results

A Hybrid Simulated Annealing Algorithm for Container Loading Problem

This paper presents a hybrid simulated annealing algorithm for container loading problem with boxes of different sizes and single container for loading. A basic heuristic algorithm is introduced to generate feasible solution from a special structure called packing sequence. The hybrid algorithm uses basic heuristic to encode feasible packing solution as packing sequence, and searches in the encoding space to find an approximated optimal solution. The computational experiments on 700 weakly heterogeneous benchmark show that our algorithm outperforms all previous methods in average

A Decision Tree Scoring Model Based on Genetic Algorithm and K-means Algorithm

Credit scoring has been regarded as a critical topic and studied extensively in the finance field. Many artificial intelligence techniques have been used to solve credit scoring. The paper is to build a classification model based on a decision tree by learning historical data. Clustering algorithm and genetic algorithm are combined to further improve the accuracy of this credit scoring model. The clustering algorithm aims at removing noise data, while the genetic algorithm is used to reduce the redundancy attribute of data. The computational results on the two real world benchmark data sets show that the presented hybrid model is efficient

Discrete No-Fit Polygon,A Simple Structure for the 2-D Irregular Packing Problem

提出了一个用于求解二维不规则排样问题的离散临界多边形模型.burkE等人的blf算法是求解排样问题的一种有效算法,但其算法对一些特殊实例会产生非法的解.为了解决这个问题,提出了一种基于离散临界多边形模型,并对其正确性作了严格证明.新模型是只含有点和区间的简单模型,在大大降低原问题几何复杂性的同时,也使许多启发式策略可以更容易地求解该问题.计算结果表明,基于离散临界多边型模型的排样算法是很有效的.This paper presents a model based on discrete no-fit polygon for the two-dimensional irregular packing problem.Burke et al.have presented an effective BLF algorithm to solve the irregular packing problem, however, their algorithm might generate invalid results for some special cases.To solve this problem, a model based on discrete no-fit polygon is proposed, and its correctness has been strictly proved.Only points and intervals are only considered by this model, which greatly decreases the geometry complexity of the original problem and makes the problem easily solved by many heuristic strategies.Computational results show that the algorithm based on discrete no-fit polygon model is very efficient.国家自然科学基金No.60773126;福建省自然科学基金No.A07100234;厦门大学985二期信息科技基金No.0000-X07204;厦门大学院士启动基金No.X01109---

嗜人类T淋巴细胞病毒Ⅰ型核心蛋白P24基因的克隆与表达

目的 从感染HTLV-1的中国患者外周血单核细胞（PBMCs）中扩增编码HTLV-1核心蛋白P24的cDNA,并在大肠杆菌中进行表达。方法 提取感染者PBMCs基因组DNA,应用巢式PCR方法扩增出HTLV-1核心蛋白P24的cDNA并测序,与pGEX-20T载体构建重组质粒,在大肠杆菌BL21中表达,采用ELISA和Westernblot分析重组蛋白活性。结果HTLV-1核心蛋白P24基因序列高度保守,构建重组载体后,在大肠杆菌中表达的重组蛋白,经检测具有较强的抗原活性。结论 成功地表达了HTLV-1型病毒的核心蛋白P24基因,为国产诊断试剂和疫苗的研发打下了基础