The equilibrium generalized assignment problem and genetic algorithm

The well-known generalized assignment problem (GAP) is to minimize the costs of assigning n jobs to m capacity constrained agents (or machines) such that each job is assigned to exactly one agent. This problem is known to be NP-hard and it is hard from a computational point of view as well. In this paper, follows from practical point of view in real systems, the GAP is extended to the equilibrium generalized assignment problem (EGAP) and the equilibrium constrained generalized assignment problem (ECGAP). A heuristic equilibrium strategy based genetic algorithm (GA) is designed for solving the proposed EGAP. Finally, to verify the computational efficiency of the designed GA, some numerical experiments are performed on some known benchmarks. The test results show that the designed GA is very valid for solving EGAP.     

最大度不小于3的图的星全色数的一个上界

对圈、扇和轮作了简单的剖分,得到了其剖分图的星全色数,并运用Lovasz局部引理证明了若G(V,E)是一个最大度为△≥3的简单无向图,则Χ_(st)(G)≤22Δ~2.     

食饵种群受毒素影响的三种群模型的最优收获问题

讨论了在毒素存在的情况下收获食饵的食饵—捕食模型的平衡点稳定性,生物经济平衡点的存在性和最优收获问题,利用Pontryagin极大值原理确定了最优收获策略.     

圈和完全图的点可区别VE-全染色(英文)

Let G be a simple graph of order at least 2.A VE-total-coloring using k colors of a graph G is a mapping f from V (G) E(G) into {1,2,···,k} such that no edge receives the same color as one of its endpoints.Let C(u)={f(u)} {f(uv) | uv ∈ E(G)} be the color-set of u.If C(u)=C(v) for any two vertices u and v of V (G),then f is called a k-vertex-distinguishing VE-total coloring of G or a k-VDVET coloring of G for short.The minimum number of colors required for a VDVET coloring of G is denoted by χ ve vt (G) and it is called the VDVET chromatic number of G.In this paper we get cycle C n,path P n and complete graph K n of their VDVET chromatic numbers and propose a related conjecture.     

Monotone Iterative Technique for a Class of Semilinear Evolution Equations with Nonlocal Conditions

This paper discusses the existence and uniqueness of mild solutions for a class of semilinear evolution equations with nonlocal conditions in an ordered Banach space E. Under some monotonicity conditions and noncompactness measure conditions of the nonlinearity, a new monotone iterative method on the evolution equations with nonlocal conditions has been established. Particularly, an existence result without using noncompactness measure condition is obtained in ordered and weakly sequentially complete Banach spaces, which is very convenient for application. An example to illustrate our main results is also given.     

An improved cellular automaton model with the consideration of a multi-point tollbooth

Based on the classical Nagel–Schreckenberg model, we in this paper propose an improved cellular automaton (CA) model to study the influences of a multi-point tollbooth on traffic flow. The numerical results show that the multi-point tollbooth can be looked at as a bottleneck and that it can improve the road capacity compared with other tolling stations, which shows that the proposed model is more effective than other traffic flow models. In addition, the results can help readers to better understand the effects of a multi-point tollbooth on traffic flow and help traffic engineers to reasonably design the tolling station.     

CeO_2和Y_2Ba_1Cu_1O_(5-δ)共同掺杂对Y_1Ba_2Cu_3O_(7-δ)的超导电性及其晶格结构的影响

采用固相反应法成功制备出一批Y123与Y211的摩尔比为1∶0.47的混合物,并在此混合物的基础上掺入CeO2,掺入的比例x分别为0.5wt%、1.0wt%、2.0wt%、3.0wt%、4.0wt%。采用了X-射线衍射仪对样品的晶格结构进行了分析,测量结果表明:x=1.0wt%时掺杂效果最好,同时也充分说明Y123的晶格结构与其超导电性之间存在着一种内在的必然关联。并通过对其测试临界转变温度以及转变宽度,测量结果也充分验证了上述结论。     

A Tikhonov-type method for solving a multidimensional inverse heat source problem in an unbounded domain

In this study we prove a stability estimate for an inverse heat source problem in the n-dimensional case. We present a revised generalized Tikhonov regularization and obtain an error estimate. Numerical experiments for the one-dimensional and two-dimensional cases show that the revised generalized Tikhonov regularization works well.