Variable neighborhood search for minimum cost berth allocation

The berth allocation problem is to allocate space along the quayside to incoming ships at a container terminal in order to minimize some objective function. We consider minimization of total costs for waiting and handling as well as earliness or tardiness of completion, for all ships. We assume ships can arrive at any given time, i.e., before or after the berths become available. The resulting problem, which subsumes several previous ones, is expressed as a linear mixed 0–1 program. As it turns out to be too time-consuming for exact solution of instances of realistic size, a Variable Neighborhood Search (VNS) heuristic is proposed, and compared with Multi-Start (MS), a Genetic Search algorithm (GA) and a Memetic Search algorithm (MA). VNS provides optimal solutions for all instances solved to optimality in a previous paper of the first two authors and outperforms MS, MA and GA on large instances.     

Power Control for Link Quality Protection in Cellular DS-CDMA Networks with Integrated (Packet and Circuit) Services

The problem of admission control in a DS-CDMA network carrying a heterogeneous mix of traffic is addressed. In an interference limited system such as DS-CDMA, admission of a new user impacts the performance of all other users, as well as the system capacity. The admission process is concerned with two factors: (1) maintaining the QoS of active users, (2) allocating bandwidth to new users. We propose a simple power control algorithm and prove that it is optimal in the sense of maintaining active link quality while maximizing free capacity for new admissions. The algorithm scales the powers of active links appropriately to achieve link protection and improved tolerance of the link to new interference from bursty sources. This algorithm can be used to overlay bursty packet data services without compromising QoS of active circuits.     

Required Work in the M/M/1 Queue,with Application in IP Packet Processing

We consider the ordinary M/M/1 queue with the FIFO queueing discipline. It seems that the sum of service times of the customers in the system (or the required work, as we call it briefly) is a random variable that is not considered before. In this paper we derive the equilibrium distribution of this variable. The task is not quite trivial because of the dependencies between the elapsed service time and the number of customers in the system. Our motivation for this problem comes from the performance analysis of a dynamic memory allocation scheme of a packet buffer.     

A Resource Allocation Approach for the Generation of Service-Dependent Demand Matrices for Communications Networks

Estimating point-to-point demands from partially available information, such as total demand volumes originating and terminating at nodes and traffic volumes routed on links, has significant applications in various areas, such as communications network planning and transportation planning. Existing methods include matrix and link scaling methods, statistical methods, more complex mathematical programming models, and forecasting using demographic data. We present a new mathematical programming model based on equitable resource allocation. The model considers multiple services, e.g., data, video, and voice, and generates a point-to-point demand matrix for each service. Originating and terminating demands for each service and link loads, aggregated over all services, are viewed as resources. Each point-to-point demand is associated with a performance function that measures its weighted, normalized deviation from a target defined by a service-dependent community of interest matrix. The model formulation has a lexicographic minimax objective function and multiple knapsack resource constraints. The model has an intuitively appealing interpretation and a specialized algorithm can generate demand matrices for large network problems very fast.     

博弈联盟模糊收益的分配

提出了联盟模糊收益合理分配的一种新方法.首先,在模糊收益α截集上定义了α合理分配集,分析了该分配集与模糊收益Shapley值的关系.接着,给出了模糊收益的α合理Shapley分配函数,对其性质进行了讨论.然后,构造了模糊合理Shapley分配,证明其连续性,得到了联盟模糊收益与模糊合理Shapley分配具有包含关系的结论.     

Solving multistage asset investment problems by the sample average approximation method

The vast size of real world stochastic programming instances requires sampling to make them practically solvable. In this paper we extend the understanding of how sampling affects the solution quality of multistage stochastic programming problems. We present a new heuristic for determining good feasible solutions for a multistage decision problem. For power and log-utility functions we address the question of how tree structures, number of stages, number of outcomes and number of assets affect the solution quality. We also present a new method for evaluating the quality of first stage decisions.     

Power allocation,relay selection and energy cooperation strategies in energy harvesting cooperative wireless networks

In this paper, optimal power allocation and relay selection strategies in energy harvesting cooperative wireless networks are studied. In particular, signal‐to‐noise ratio (SNR)‐maximizing based power allocation and relay selection without and with energy cooperation—via wireless energy transfer—are considered. Moreover, total relay power minimization subject to target end‐to‐end SNR is investigated. The different optimal strategies are formulated as optimization problems, which are non‐convex. Thus, intelligent transformations are applied to transform non‐convex problems into convex ones, and polynomial‐time solution procedures are proposed. Simulation results illustrate that power allocation strategies achieve higher end‐to‐end SNR than relay selection ones. Finally, energy cooperation is shown to be effective in improving end‐to‐end SNR, while total relay power minimization balances end‐to‐end SNR, transmit power consumption, and harvested energy. Copyright © 2016 John Wiley & Sons, Ltd.     

Coalitional game‐based behavior analysis for spectrum access in cognitive radios

The core of cognitive radio paradigm is to introduce cognitive devices able to opportunistically access the licensed radio bands. The coexistence of licensed and unlicensed users prescribes an effective spectrum hole‐detection and a non‐interfering sharing of those frequencies. Collaborative resource allocation and spectrum information exchange are required but often costly in terms of energy and delay. In this paper, each secondary user (SU) can achieve spectrum sensing and data transmission through a coalitional game‐based mechanism. SUs are called upon to report their sensing results to the elected coalition head, which properly decides on the channel state and the transmitter in each time slot according to a proposed algorithm. The goal of this paper is to provide a more holistic view on the spectrum and enhance the cognitive system performance through SUs behavior analysis. We formulate the problem as a coalitional game in partition form with non‐transferable utility, and we investigate on the impact of both coalition formation and the combining reports costs. We discuss the Nash Equilibrium solution for our coalitional game and propose a distributed strategic learning algorithm to illustrate a concrete case of coalition formation and the SUs competitive and cooperative behaviors inter‐coalitions and intra‐coalitions. We show through simulations that cognitive network performances, the energy consumption and transmission delay, improve evidently with the proposed scheme. Copyright © 2016 John Wiley & Sons, Ltd.     

浅谈分置式防空系统中弹炮结合问题

本文针对分置式弹炮结合防空系统设计和使用,讨论了有关武器选择、阵地布置、攻击区划分、多目标分配、弹炮协同作战以及如何避免弹、炮间相互影响等问题。     

一种结合信道性能的频谱分配算法

在认知无线电网络中,由于授权信道的时变性,各可用信道的性能相差较大。为避免过多使用忙闲交替频繁的信道,首先用ON—OFF模型建模授权信道的使用情况,并推导了认知用户切换概率,提出了一种用信道状态变化率衡量信道性能的方法。在此基础上提出了一种结合信道性能的频谱分配算法,在网络吞吐量相同或相近情况下优先分配性能较好的信道。仿真分析表明,这种结合信道性能的频谱分配算法在降低切换概率的同时提高了实际总效益。