电信运营商云网规划数字化研究和实现

基于电信运营商数字化转型，系统性地提出了数据驱动的云网发展规划体系，以及六大关键数字化能力构建，设计和实现了一种云网规划数字化平台，该平台可用于实现目标网络精细规划、边缘计算精准预测等场景，并探讨了数字孪生在规划领域的应用前景，对运营商推进云网融合战略、推进高质量发展具有指导和参考意义。     

基于改进D?Lite遗传算法路径规划研究

针对遗传算法在移动机器人路径规划中易产生早熟现象和收敛速度慢的问题,提出了改进的D~* Lite遗传算法。该算法将D~* Lite算法和遗传算法相结合,通过引入碰撞系数和可视检测技术以提高路径安全性,寻找最短路径。在遗传算法设计中加入动态调整交叉与变异概率,以解决算法在路径规划中因陷入局部最优值而不能到达目标点的问题。最后,通过实验仿真可知:与蚁群算法和免疫遗传算法相比,改进的D~* Lite遗传算法执行效率高,可以快速规划出全局最优路径。     

A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

Strategic planning optimization for natural gas to liquid transportation fuel (GTL) systems

A strategic planning optimization model is proposed for a network of natural gas to liquids (GTL) systems, and it is solved using a rolling horizon strategy. The model formulation determines the strategic and tactical decisions of the GTL supply chain over a long time horizon. The decisions to build new GTL refineries may be made over the span of 30 years and their operations cover the span of 60 years. Multiple capacities of GTL refineries (i.e., 1, 5, 10, 50, and 200 thousand barrels per day) that produce gasoline, diesel, and kerosene commensurate to the United States demand ratio may exist in the network. The parameter inputs include the locations, availabilities, and prices of natural gas in the United States discretized by county, the delivery locations of fuel products, and the transportation costs of every input and output of the refinery, defined for each time period. Formulated as a large-scale mixed-integer linear optimization (MILP) model, the problem is solved using a rolling horizon strategy for tractability. Case studies on the state of Pennsylvania are presented for different planning schemes and their impact on the economic performance of the GTL network is discussed.     

无线传感器网络中移动sink节点的路径规划

在无线传感器网络中,大量感知数据汇集到sink节点的采集方法会导致sink节点附近的节点能量耗尽,造成能量空洞。针对该问题,利用移动的sink节点进行数据收集是一种解决方法,其中移动sink的路径规划成为一个重要的问题。提出了一个移动sink路径规划算法,将无线传感器中随机分布的节点划分为不同的子区域,寻找sink节点移动的最佳转向点,最终得到最优的移动路径,以实现无线传感器网络生命周期最大化。仿真实验表明,与现有方案相比,该算法能显著延长网络的生命周期。     

Generation expansion planning in electricity markets: A novel framework based on dynamic stochastic MPEC

This paper presents a novel framework for generation expansion planning (GEP) of restructured power systems under uncertainty in a multi-period horizon, which includes generation investment from a price maker perspective. The investment problem is modeled as a bi-level optimization problem. The first level problem includes decisions related to investment in order to maximize total profit in the planning horizon. The second level problem consists of maximizing social welfare where the power market is cleared. Rival uncertainties on offering and investment are modeled using sets of scenarios. The bi-level optimization problem is then converted to a dynamic stochastic MPEC and represented as a mixed integer linear program (MILP) after linearization. The proposed framework is examined on a typical six-bus power network, MAZANDARAN regional electric company (MREC) transmission network as an area of IRAN interconnected power system and IEEE RTS 24-bus network. Simulation results confirm that the proposed framework can be a useful tool for analyzing the behavior of investments in electricity markets.     

A modified particle swarm optimization with multiple subpopulations for multimodal function optimization problems

In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations.     

Teaching and Learning Electrochemistry

Numerous conceptual difficulties and misconceptions have been reported in the science and chemistry education literature about electrochemistry concepts such as electrolytes, redox equations, and about electrochemical (galvanic and electrolytic) cells. Other studies have considered teaching approaches aimed at improving learning and at overcoming misconceptions. This paper reviews these studies and considers strategies and approaches for the effective teaching of electrochemistry. Then, the review focuses on problem solving in equilibrium electrochemistry, especially problems involving the Nernst equation. The main findings of four studies with Greek university chemistry students, dealing with: (i) algorithmic problem‐solving ability; (ii) practice on problem solving; (iii) the effect of the format of a problem; and (iv) the construction and evaluation of a website devoted to electrochemistry problem solving, are reported.     

Control theory for stochastic distributed parameter systems,an engineering perspective

The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.