The convex hull of two core capacitated network design problems

The network loading problem (NLP) is a specialized capacitated network design problem in which prescribed point-to-point demand between various pairs of nodes of a network must be met by installing (loading) a capacitated facility. We can load any number of units of the facility on each of the arcs at a specified arc dependent cost. The problem is to determine the number of facilities to be loaded on the arcs that will satisfy the given demand at minimum cost.This paper studies two core subproblems of the NLP. The first problem, motivated by a Lagrangian relaxation approach for solving the problem, considers a multiple commodity, single arc capacitated network design problem. The second problem is a three node network; this specialized network arises in larger networks if we aggregate nodes. In both cases, we develop families of facets and completely characterize the convex hull of feasible solutions to the integer programming formulation of the problems. These results in turn strengthen the formulation of the NLP.Research of this author was supported in part by a Faculty Grant from the Katz Graduate School of Business, University of Pittsburgh.     

An ant colony algorithm for the pos/neg weighted p-median problem

Let a graph G = (V, E) with vertex set V and edge set E be given. The classical graph version of the p-median problem asks for a subset of cardinality p, so that the (weighted) sum of the minimum distances from X to all other vertices in V is minimized. We consider the semi-obnoxious case, where every vertex has either a positive or a negative weight. This gives rise to two different objective functions, namely the weighted sum of the minimum distances from X to the vertices in V\X and, differently, the sum over the minimum weighted distances from X to V\X. In this paper an Ant Colony algorithm with a tabu restriction is designed for both problems. Computational results show its superiority with respect to a previously investigated variable neighborhood search and a tabu search heuristic.This research has partially been supported by the Spezialforschungsbereich F 003 “Optimierung und Kontrolle”, Projektbereich Diskrete Optimierung.     

Surface integral analogy approaches for predicting noise from 3D high-lift low-noise wings

Three surface integral approaches of the acoustic analogies are studied to predict the noise from three concep- tual configurations of three-dimensional high-lift low-noise wings. The approaches refer to the Kirchhoff method, the Ffowcs Williams and Hawkings （FW-H） method of the permeable integral surface and the Curle method that is known as a special case of the FW-H method. The first two approaches are used to compute the noise generated by the core flow region where the energetic structures exist. The last approach is adopted to predict the noise specially from the pressure perturbation on the wall. A new way to con- struct the integral surface that encloses the core region is proposed for the first two methods. Considering the local properties of the flow around the complex object-the actual wing with high-lift devices-the integral surface based on the vorticity is constructed to follow the flow structures. The surface location is discussed for the Kirchhoff method and the FW-H method because a common surface is used for them. The noise from the core flow region is studied on the basis of the dependent integral quantities, which are indicated by the Kirchhoff formulation and by the FW-H formulation. The role of each wall component on noise contribution is analyzed using the Curle formulation. Effects of the volume integral terms of Lighthill＇s stress tensors on the noise pre-diction are then evaluated by comparing the results of the Curle method with the other two methods.     

自然灾害情境下的终端供电设施应急抢修决策规划

自然灾害情境造成部分决策信息模糊和应急决策者的消极情绪。考虑消极情绪在自然灾害应急决策的影响,构建了考虑情绪下的前景理论的价值函数。运用反函数原理,根据应急决策者对模糊信息的心理感知价值,构建了其实际值的估计函数,用于解决决策信息模糊下的终端供电设施应急抢修决策规划问题,提出了相应的决策模型和求解算法。采用自主开发的在线实验系统,完成了信息模糊下的电网应急抢修决策实验,验证了决策模型和消极情绪下基于决策者心理感知对模糊信息估值方法的有效性。     

Pedestrian choice behavior analysis and simulation of vertical walking facilities in transfer station

Considering the interlayer height, luggage, the difference between queuing pedestrians, and walking speed, the pedestrian choice model of vertical walking facilities is established based on a support vector machine. This model is verified with the pedestrian flow data of Changchun light-rail transfer station and Beijing Xizhimen transfer station. Adding the pedestrian choice model of vertical walking facilities into the pedestrian simulation model which is based on cellular automata, the pedestrian choice behavior is simulated. In the simulation, the effects of the dynamic influence factors are analyzed. To reduce the conflicts between pedestrians in opposite directions, the layout of vertical walking facilities is improved. The simulations indicate that the improved layout of vertical walking facilities can improve the efficiency of pedestrians passing.     

基于现役装置的冲击点火可行性概念研究

以冲击点火物理特性的研究为基础, 分析冲击点火对高功率激光驱动器的物理需求, 然后从总体层面概括给出基于现役装置(神光III等间接驱动中心点火高功率激光装置) 研究冲击点火面临的关键技术问题. 研究表明, 基于现役装置的冲击点火主要面临两个层面的问题, 首先是非均匀光路排布下实现均匀辐照的工程层面问题, 其次是在现役装置上高效实现冲击点火激光脉冲的激光技术层面问题. 通过研究 分别对两个层面的问题提出相应的解决思路, 为后续研究奠定基础.     

Analysis of heuristics for finding a maximum weight planar subgraph

The problem of identifying a planar subgraph of maximum total weight in an edge-weighted graph has application to the layout of facilities in a production system and elsewhere in industrial engineering.This problem is NP-hard, and so we confine our attention to polynomial-time heuristics. In this paper we analyse the performance of some heuristics for this problem.     

Locating two obnoxious facilities using the weighted maximin criterion

Given are a finite set of points P and a compact polygonal set S in R². The problem is to locate two new facilities in S, maximizing the minimum of all weighted distances between the points in P and the two new facilities, and the distance between the pair of new facilities. We present subquadratic algorithms.     

On solving the discrete location problems when the facilities are prone to failure

The classical discrete location problem is extended here, where the candidate facilities are subject to failure. The unreliable location problem is defined by introducing the probability that a facility may become inactive. The formulation and the solution procedure have been motivated by an application to model and solve a large size problem for locating base stations in a cellular communication network. We formulate the unreliable discrete location problems as 0–1 integer programming models, and implement an enhanced dual-based solution method to determine locations of these facilities to minimize the sum of fixed cost and expected operating (transportation) cost. Computational tests of some well-known problems have shown that the heuristic is efficient and effective for solving these unreliable location problems.