期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
Impact of box ratio and pinwheel pattern on the pallet loading problem 被引量:1
1
作者 伊俊敏 王笃鹏 周晶 《Journal of Southeast University(English Edition)》 EI CAS 2009年第2期267-270,共4页
The pinwheel pattern as a suitable and advantageous alternative for the loading implementation of the pallet loading problem (PLP) is identified after a survey on the loading pattern. The definitions, elements, cate... The pinwheel pattern as a suitable and advantageous alternative for the loading implementation of the pallet loading problem (PLP) is identified after a survey on the loading pattern. The definitions, elements, categories, generating algorithms of the pinwheel pattern are discussed and a uniform symmetric pinwheel notation is proposed. Based on the forming geometry of a pinwheel, the pinwheel structure is analyzed in terms of the innate box ratio, the box/block orientation and the box number by combinatorial and geometrical methods. A revised data set for the PLP with an area ratio range from 1 to 76 and a box ratio range from 1 to 10 is proposed. All pinwheel instances with this data set are calculated, and box ratio range is obtained for each possible pinwheel pattern, which can be found for all non-prime numbers of boxes. And a high box ratio makes an optimal pinwheel pattern more likely appear. Results identify the impact of the above pinwheel pattern and the box ratio on the pallet loading problem. 展开更多
关键词 PACKING pallet loading problem loading pattern box ratio pinwheel pattern
在线阅读 下载PDF
Layer-layout-based heuristics for loading homogeneous items into a single container 被引量:3
2
作者 WANG Zhou-jing LI Kevin W 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2007年第12期1944-1952,共9页
The container loading problem (CLP) is a well-known NP-hard problem. Due to the computation complexity, heuristics is an often-sought approach. This article proposes two heuristics to pack homogeneous rectangular boxe... The container loading problem (CLP) is a well-known NP-hard problem. Due to the computation complexity, heuristics is an often-sought approach. This article proposes two heuristics to pack homogeneous rectangular boxes into a single container. Both algorithms adopt the concept of building layers on one face of the container, but the first heuristic determines the layer face once for all, while the second treats the remaining container space as a reduced-sized container after one layer is loaded and, hence, selects the layer face dynamically. To handle the layout design problem at a layer's level, a block-based 2D packing procedure is also developed. Numerical studies demonstrate the efficiency of the heuristics. 展开更多
关键词 Container loading problem (CLP) HEURISTIC LAVER Packing. Optimization
在线阅读 下载PDF
Solving Load Flow Problems of Power System by Explicit Pseudo-Transient Continuation (E-ψtc) Method
3
作者 Tianmin Han Yuhuan Han 《Energy and Power Engineering》 2016年第2期99-115,共17页
This paper is a further study of two papers [1] and [2], which were related to Ill-Conditioned Load Flow Problems and were published by IEEE Trans. PAS. The authors of this paper have some different opinions, for exam... This paper is a further study of two papers [1] and [2], which were related to Ill-Conditioned Load Flow Problems and were published by IEEE Trans. PAS. The authors of this paper have some different opinions, for example, the 11-bus system is not an ill-conditioned system. In addition, a new approach to solve Load Flow Problems, E-&psi;tc, is introduced. It is an explicit method;solving linear equations is not needed. It can handle very tough and very large systems. The advantage of this method has been fully proved by two examples. The authors give this new method a detailed description of how to use it to solve Load Flow Problems and successfully apply it to the 43-bus and the 11-bus systems. The authors also propose a strategy to test the reliability, and by solving gradient equations, this new method can answer if the solution exists or not. 展开更多
关键词 Load Flow problems of Power System Ill-Conditioned System Normal Newton Method Optimal Multiplier Method Brown Method Explicit Pseudo-Transient Continuation (E-ψtc) 11-Bus and 43-Bus Systems Reliability Gradient Equation
在线阅读 下载PDF
Reinforcement Learning Algorithm for Solving Load Commitment Problem Considering a General Load Model
4
作者 Thythodath Parambath Imthias Ahamed Sayed Danish Maqbool Nazar Hussain Malik 《Journal of Energy and Power Engineering》 2013年第6期1150-1162,共13页
Under the smart grid paradigm, in the near future all consumers will be exposed to variable pricing schemes introduced by utilities. Hence, there is a need to develop algorithms which could be used by the consumers to... Under the smart grid paradigm, in the near future all consumers will be exposed to variable pricing schemes introduced by utilities. Hence, there is a need to develop algorithms which could be used by the consumers to schedule their loads. In this paper, load scheduling problem is formulated as a LCP (load commitment problem). The load model is general and can model atomic and non-atomic loads. Furthermore, it can also take into consideration the relative discomfort caused by delay in scheduling any load. For this purpose, a single parameter "uric" is introduced in the load model which captures the relative discomfort caused by delay in scheduling a particular load. Guidelines for choosing this parameter are given. All the other parameters of the proposed load model can be easily specified by the consumer. The paper shows that the general LCP can be viewed as multi-stage decision making problem or a MDP (Markov decision problem). RL (reinforcement learning) based algorithm is developed to solve this problem. The efficacy of the algorithm is investigated when the price of electricity is available in advance as well as for the case when it is random. The scalability of the approach is also investigated. 展开更多
关键词 Reinforcement learning Markov decision problem demand response load scheduling problem load model.
在线阅读 下载PDF
Optimal Kernel-based Extreme Learning and Multi-objective Function-aided Task Scheduling for Solving Load Balancing Problems in Cloud Environment
5
作者 Ravi Gugulothu Vijaya Saradhi Thommandru Suneetha Bulla 《Journal of Systems Science and Systems Engineering》 2025年第4期385-409,共25页
Workload balancing in cloud computing is not yet resolved,particularly considering Infrastructure as a Service(IaaS)in the cloud network.The problem of being underloaded or overloaded should not occur at the time of t... Workload balancing in cloud computing is not yet resolved,particularly considering Infrastructure as a Service(IaaS)in the cloud network.The problem of being underloaded or overloaded should not occur at the time of the server or host accessing the cloud which may lead to create system crash problem.Thus,to resolve these existing problems,an efficient task scheduling algorithm is required for distributing the tasks over the entire feasible resources,which is termed load balancing.The load balancing approach assures that the entire Virtual Machines(VMs)are utilized appropriately.So,it is highly essential to develop a load-balancing model in a cloud environment based on machine learning and optimization strategies.Here,the computing and networking data is utilized for the analysis to observe the traffic as well as performance patterns.The acquired data is offered to the machine learning decision to select the right server by predicting the performance effectively by employing an Optimal Kernel-based Extreme Learning Machine(OK-ELM)and their parameter is tuned by the developed hybrid approach Population Size-based Mud Ring Tunicate Swarm Algorithm(PS-MRTSA).Further,effective scheduling is performed to resolve the load balancing issues by employing the developed model MR-TSA.Here,the developed approach effectively resolves the multi-objective constraints such as Response time,Resource cost,and energy consumption.Thus,the recommended load balancing model securesan enhanced performance rate than the traditional approaches over several experimental analyses. 展开更多
关键词 Cloud environment load balancing problem optimal kernel-based extreme learning machine population size-based mud ring tunicate swarm algorithm multi-objective function
原文传递
Review of pantograph and catenary interaction 被引量:7
6
作者 Weihua ZHANG Dong ZOU +3 位作者 Mengying TAN Ning ZHOU Ruiping LI Guiming MEI 《Frontiers of Mechanical Engineering》 SCIE CSCD 2018年第2期311-322,共12页
The application of electrified railway directly promotes relevant studies on pantograph-catenary interac- tion. With the increase of train running speed, the operating conditions for pantograph and catenary have becom... The application of electrified railway directly promotes relevant studies on pantograph-catenary interac- tion. With the increase of train running speed, the operating conditions for pantograph and catenary have become increasingly complex. This paper reviews the related achievements contributed by groups and institutions around the world. This article specifically focuses on three aspects: The dynamic characteristics of the panto- graph and catenary components, the systems' dynamic properties, and the environmental influences on the pantograph-catenary interaction. In accordance with the existing studies, future research may prioritize the task of identifying the mechanism of contact force variation. This kind of study can be carried out by simplifying the pantograph-catenary interaction into a moving load problem and utilizing the theory of matching mechanical impedance. In addition, developing a computational platform that accommodates environmental interferences and multi-field coupling effects is necessary in order to further explore applications based on fundamental studies. 展开更多
关键词 electrified railway pantograph and catenary interaction contact force variation moving load problem mechanical impedance multi-field
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部