An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP)

The multi-objective resource allocation problem (MORAP) addresses the important issue which seeks to find the expected objectives by allocating the limited amount of resource to various activates. Resources may be manpower, assets, raw material or anything else in limited supply which can be used to accomplish the goals. The goals may be objectives (i.e., minimizing costs, or maximizing efficiency) usually driven by specific future needs. In this paper, in order to obtain a set of Pareto solution efficiently, we proposed a modified version of ant colony optimization (ACO), in this algorithm we try to increase the efficiency of algorithm by increasing the learning of ants. Effectiveness and efficiency of proposed algorithm was validated by comparing the result of ACO with hybrid genetic algorithm (hGA) which was applied to MORAP later.     

随机Richlet级数的增长性

本文构造了全平面上的无限级Dirirchlet级数,使得它对型函数的增长性与一个已知的不同分布随机Dirichlet的增长性相同,从而通过前者增长性与指数,系数的关系可研究后者的增长性.     

Locating the two-median of a tree network with continuous link demands

Typical formulations of thep-median problem on a network assume discrete nodal demands. However, for many problems, demands are better represented by continuous functions along the links, in addition to nodal demands. For such problems, optimal server locations need not occur at nodes, so that algorithms of the kind developed for the discrete demand case can not be used. In this paper we show how the 2-median of a tree network with continuous link demands can be found using an algorithm based on sequential location and allocation. We show that the algorithm will converge to a local minimum and then present a procedure for finding the global minimum solution.     

Work allocation to stations with varying learning slopes and without buffers

In this paper, we address the problem of allocating the work elements, belonging to the products of a lot, to the stations of an assembly line so as to minimize the makespan. The lots that are processed on the assembly line are characterized by a low overall demand for each product. There is no buffer permitted in between the stations, and the line operates under learning. In particular, the stations’ learning slopes are assumed to be different. We present a procedure to determine the optimal assignments of the workload to the stations under learning variability and show that it considerably affects these assignments.     

Log-Polynomial Period Functions for Hecke Groups

In this article we shall determine the automorphic integrals of positive and negative integral weight associated with the full modular group and some Hecke groups. This will be done by using the Hecke Correspondence. We will also give a characterization of multiplier systems of real weight for Hecke groups.     

Change of variable formulas for non-anticipative functionals on path space

We derive a change of variable formula for non-anticipative functionals defined on the space of Rd-valued right-continuous paths with left limits. The functionals are only required to possess certain directional derivatives, which may be computed pathwise. Our results lead to functional extensions of the Itô formula for a large class of stochastic processes, including semimartingales and Dirichlet processes. In particular, we show the stability of the class of semimartingales under certain functional transformations.     

A survey of berth allocation and quay crane scheduling problems in container terminals

Due to the variety of technical equipments and terminal layouts, research has produced a multitude of optimization models for seaside operations planning in container terminals. To provide a support in modeling problem characteristics and in suggesting applicable algorithms this paper reviews the relevant literature. For this purpose new classification schemes for berth allocation problems and quay crane scheduling problems are developed. Particular focus is put on integrated solution approaches which receive increasing importance for the terminal management.     

纳税最优的工资奖金分配方案研究

根据我国现行的税法,个人所得税纳税采用九级累进税率.年工资和年终奖在速算扣除数个数上存在不同,使得对于相同的税前年收入,如果采用不同的年工资和年终奖分配方案会产生不同的税后实际所得.通过简化变量和缩小有效解区域,以及一系列严格的数学推导,得到了任意年收入下,月工资和年终奖的最优分配方案,使得在现有税制下,纳税额最小,税后收入最大.这个最优方案避免了税金负效应现象,保证了纳税公平性,有利于国家税务监管,企业员工薪金分配和个人纳税筹划;具有广阔的应用前景.     

A rule for slack allocation proportional to the duration in a PERT network

In this paper, we define a new rule for the resolution of the slack allocation problem in a PERT network. This problem exists of allocating existing extra time in some paths among the activities belonging to those paths. The allocation rule that we propose assigns extra time to the activities proportionally to their durations in such a way that no path duration exceeds the completion time of the whole project. This time allocation enables us to make a schedule for the PERT project under study. We give two characterizations of the rule and we compare it with others that have been previously defined in the literature.     

Nonexistence of local minima of supersolutions for the polyharmonic problems

In this note we study the nonexistence of local minima of the supersolutions of the polyharmonic equations on the balls under generalized homogeneous Dirichlet boundary conditions. Under suitable restriction on the dimensions, this means that a generalized clamped circular plate, which is pushed from below, cannot bend downwards even locally. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)