p-Median and p-dispersion problems: A bi-criteria analysis

Given a collection of n locations and a symmetric measure of distance (difference) between each pair of locations, we seek to identify (select) a subset of p locations so as to achieve two distinct objectives. The first objective is to use the selected locations as centers (medians) of p groups that would partition the entire collection and minimize the total distance between the locations and their respective group medians. The second objective is to maximize the minimum distance (diversity) among the selected locations themselves. We study this problem as a multi-objective optimization problem and propose an iterative algorithm to obtain its non-dominated frontier. At each iteration we construct and solve a 0–1 integer programming problem. Through a computational experiment we show that this algorithm is computationally effective for small to medium size instances of the problem. We also propose a Lagrangian heuristic algorithm for solving larger instances of this problem.     

挤扩支盘桩在湿陷性黄土地基中的应用

湿陷性黄土具有遇水发生湿陷、承载力大幅度降低的性质,这种性质直接影响到基础的承载力。为了研究支盘桩在湿陷性黄土地基中的承载性状,对湿陷性黄土中的3根支盘桩进行预浸水静载荷试验,结果表明,支盘桩荷载—沉降曲线为缓变型,具有较好的承载性能,荷载传递规律与在非湿陷性黄土地基中具有相似的性质,桩身各段承载力的发挥具有明显的顺序性,其结果为挤扩支盘桩在湿陷性黄土地基中的应用提供了依据。     

支流影响下的水库水温预测模型

采用宽度平均的立面二维水温模型,通过分析支流和主库之间的相互影响,提出了支流与主库耦合的简化方法,建立了考虑支流影响的水库水温模型。在考虑有无支流影响的条件下,对水库水温分布、水库下泄水温和坝前垂向水温分布均作了比较,结果表明支流对水库水温分布有一定的影响,所建立支流与主库耦合的立面二维水温模型能够较好地反映存在支流影响的水库水温分布,预测水库水温分布比较合理。     

基于可寻址分支分配器的CATV收费系统

给出了一种基于可寻址分支分配器的ＣＡＴＶ收费管理系统设计方案，并着重介绍了系统的工作原理及可寻址分支分配器的设计。     

给水铜管分水布置的支管缩径可行性分析

住宅给水铜管分水布置是一种技术可行、经济合理的管道布置方式。在确定了管道的设计要求后,分析了分水缩径后的流速情况,明确了分水布置方式中支管缩径的技术状况。分析表明,支管缩径是可行的。     

Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search

The capacitated clustering problem (CCP) is the problem in which a given set of weighted objects is to be partitioned into clusters so that the total weight of objects in each cluster is less than a given value (cluster ‘capacity’). The objective is to minimize the total scatter of objects from the ‘centre’ of the cluster to which they have been allocated. A simple constructive heuristic, a R-interchange generation mechanism, a hybrid simulated annealing (SA) and tabu search (TS) algorithm which has computationally desirable features using a new non-monotonic cooling schedule, are developed. A classification of the existing SA cooling schedules is presented. The effects on the final solution quality of the initial solutions, the cooling schedule parameters and the neighbourhood search strategies are investigated. Computational results on randomly generated problems with size ranging from 50 to 100 customers indicate that the hybrid SA/TS algorithm out-performs previous simulated annealing algorithms, a simple tabu search and local descent algorithms.     

岳城水库供水工程贴边岔管设计

岳城水库供水工程， 邯郸、安阳两城市引水岔管均采用内、外贴边补强板型式对取水口进行局部加强。此补强方法对水流流态干扰较少， 水头损失小。设置这样的岔管对原电站压力钢管结构改动较小， 构造相对简单， 制作与安装方便， 对岳城水库供水这样的改建工程较为适用。     

长江口北支水道水沙特性分析

从实测资料出发,结合水流数值计算成果,对长江口北支水道的水流、泥沙和含盐度等资料进行分析,得出了北支水道的水沙特性,并分析了水沙变化与河床变化的相互关系.北支水道在1958年南通河段河势控制后,径流分流比逐年下降,并渐趋稳定于3%左右.北支水道受径流影响越来越小,主要受潮流作用.随着水沙特性的逐年变化,北支水道0 m以下槽蓄容量逐年减小,并渐趋稳定,北支上段为逐年淤积最快的区域.由此反过来影响了水沙条件的进一步变化,使北支上段平均潮差增加,北支的会潮点由崇头附近下移至青龙港附近.     

广义AND／OR图的自底向上的启发式搜索算法BHAO

本文首先根据三角模概念，定义了一类新的更具普遍意义的广义ＡＮＤ／ＯＲ图．根据新定义的启发式函数ｈ（ｎ，ｘ）以及广义ＡＮＤ／ＯＲ图的最佳解树之所有子树亦是最佳子解树的原理，提出了广义ＡＮＤ／ＯＲ图的自底向上的启发式搜索算法ＢＨＡＯ．文中证明了算法ＢＨＡＯ的可采纳性．本文还提出了两类新的启发式函数的单调限制概念，并据此研究了算法ＢＨＡＯ的单调限制性质，研究了两个ＢＨＡＯ算法间的比较性质．     

An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks

Formulating the minimum concave cost capacitated network flow problem as an integer concave minimization problem, we establish finite branch and bound algorithms, in which the branching operation is the so–called integral rectangular partition and the bounding procedure is performed by the classical minimum linear cost flow problem on subnetworks. For the special case that the flow cost function is concave on a fixed number of arcs and linear on the others, an upper bound of the running time is given. Received: 19 July 1996 / Accepted: 8 July 1997