检索结果-南通市图书馆

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2011年第11期12卷 860-872页

作者： Xiao LIU Jia-wei YE School of Civil and Transportation Engineering South China University of Technology Guangzhou 510640 China

We present a new algorithm for nesting *** equally spaced points are set on a sheet,and a piece is moved to one of the points and rotated by an *** the point and the rotation angle constitute the packing attitude of the *** propose a new algorithm named HAPE(heuristic algorithm based on the principle of minimum total Potential Energy) to find the optimal packing attitude at which the piece has the lowest center of *** addition,a new technique for polygon overlap testing is proposed which avoids the time-consuming calculation of no-fit-polygon(NFP).The detailed implementation of HAPE is presented and two computational experiments are *** first experiment is based on a real industrial problem and the second on 11 published benchmark *** a hill-climbing(HC) search method,the proposed algorithm performs well in comparison with other published solutions.

关键词： Packing Cutting Nesting Irregular heuristic algorithm Minimum total potential energy

Enterprise-wide optimization of integrated planning and scheduling for refinery-petrochemical complex with heuristic algorithm

在线全文

学校读者我要写书评

暂无评论

Frontiers of Chemical Science and Engineering 2023年第10期17卷 1516-1532页

作者： Lifeng Zhang Haoyang Hu Zhiquan Wang Zhihong Yuan Bingzhen Chen State Key Laboratory of Chemical Engineering Department of Chemical EngineeringTsinghua UniversityBeijing 100084China Department of Chemical Engineering Tsinghua UniversityBeijing 100084China

This paper focuses on the integrated problem of long-term planning and short-term scheduling in a largescale refinery-petrochemical complex,and considers the overall manufacturing process from the upstream refinery to the downstream petrochemical *** time scales are incorporated from the planning and scheduling *** the end of each discrete time period,additional constraints are imposed to ensure material balance between different time *** time representation is applied to the planning subproblem,while continuous time is applied to the scheduling of ethylene cracking and polymerization processes in the petrochemical *** enterprise-wide mathematical model is formulated through mixed integer nonlinear *** solve the problem efficiently,a heuristic algorithm combined with a convolutional neural network(CNN),is *** variables are used as the CNN input,leading to the integration of a data-driven approach and classical optimization by which a heuristic algorithm is *** results do not only illustrate the detailed operations in a refinery and petrochemical complex under planning and scheduling,but also confirm the high efficiency of the proposed algorithm for solving large-scale problems.

关键词： planning scheduling refinery-petrochemical convolutional neural network heuristic algorithm

High speed ghost imaging based on a heuristic algorithm and deep learning

在线全文

学校读者我要写书评

暂无评论

Chinese Physics B 2021年第6期30卷 287-293页

作者： Yi-Yi Huang Chen Ou-Yang Ke Fang Yu-Feng Dong Jie Zhang Li-Ming Chen Ling-An Wu Institute of Physics Chinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China IFSA Collaborative Innovation Center and School of Physics and Astronomy Shanghai Jiao Tong UniversityShanghai 200240China College of Engineering Physics Shenzhen Technology UniversityShenzhen 518118China

We report an overlapping sampling scheme to accelerate computational ghost imaging for imaging moving targets,based on reordering a set of Hadamard modulation matrices by means of a heuristic algorithm. The new condensed overlapped matrices are then designed to shorten and optimize encoding of the overlapped patterns, which are shown to be much superior to the random matrices. In addition, we apply deep learning to image the target, and use the signal acquired by the bucket detector and corresponding real image to train the neural network. Detailed comparisons show that our new method can improve the imaging speed by as much as an order of magnitude, and improve the image quality as well.

关键词： high speed computational ghost imaging heuristic algorithm deep learning

A heuristic algorithm for Task Scheduling Based on Mean Load on Grid

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2006年第4期21卷 559-564页

作者：倪丽娜张金泉闫春钢蒋昌俊 Department of Computer Science Tongji University Shanghai 200092 P.R. China College of Information Science & Engineering Shandong University of Science & Technology Qingdao 266510 P.R. China

Efficient task scheduling is critical to achieving high performance on grid computing environment. The task scheduling on grid is studied as optimization problem in this paper. A heuristic task scheduling algorithm satisfying resources load balancing on grid environment is presented. The algorithm schedules tasks by employing mean load based on task predictive execution time as heuristic information to obtain an initial scheduling strategy. Then an optimal scheduling strategy is achieved by selecting two machines satisfying condition to change their loads via reassigning their tasks under the heuristic of their mean load. Methods of selecting machines and tasks are given in this paper to increase the throughput of the system and reduce the total waiting time. The efficiency of the algorithm is analyzed and the performance of the proposed algorithm is evaluated via extensive simulation experiments. Experimental results show that the heuristic algorithm performs significantly to ensure high load balancing and achieve an optimal scheduling strategy almost all the time. Furthermore, results show that our algorithm is high efficient in terms of time complexity.

关键词： heuristic algorithm task scheduling load balancing knowledge grid

Designing an optimal stope layout for underground mining based on a heuristic algorithm

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

International Journal of Mining Science and Technology 2015年第5期25卷 767-772页

作者： Sandanayake Don Suneth Sameera Topal Erkan Asad Mohammad Waqar Ali Mining Engineering Western Australian School of MinesCurtin University

An optimal layout or three-dimensional spatial distribution of stopes guarantees the maximum profitability over life span of an underground mining ***,stope optimization is one of the key areas in underground mine planning ***,the computational complexity in developing an optimal stope layout has been a reason for limited availability of the algorithms offering solution to this *** article shares a new and efficient heuristic algorithm that considers a three-dimensional ore body model as an input,maximizes the economic value,and satisfies the physical mining and geotechnical constraints for generating an optimal stope *** implementation at a copper deposit demonstrates the applicability and robustness of the algorithm.A parallel processing based modification improving the performance of the original algorithm in terms of enormous computational time saving is also presented.

关键词： Stope optimization Underground mining Underground mine planning heuristic algorithm

A new heuristic algorithm for the circular packing problem with equilibrium constraints

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2011年第8期54卷 1572-1584页

作者： LIU JingFa 1,2,LI Gang 3 & GENG HuanTong 1 1 School of Computer and Software,Nanjing University of Information Science & Technology,Nanjing 210044,China 2 Network Information Center,Nanjing University of Information Science & Technology, Nanjing 210044,China 3 School of Mathematics and Physics,Nanjing University of Information Science & Technology,Nanjing 210044,China 1. School of Computer and Software Nanjing University of Information Science & Technology Nanjing 210044 China2. Network Information Center Nanjing University of Information Science & Technology Nanjing 210044 China3. School of Mathematics and Physics Nanjing University of Information Science & Technology Nanjing 210044 China

The circular packing problem with equilibrium constraints is an optimization problem about simplified satellite module layout design.A heuristic algorithm based on tabu search is put forward for solving this *** algorithm begins from a random initial configuration and applies the gradient method with an adaptive step length to search for the minimum energy *** jump out of the local minima and avoid the search doing repeated work,the algorithm adopts the strategy of tabu *** the process of tabu search,we improve the traditional neighboring solutions,tabu objects and the acceptance criteria of the current solution *** test two sets of benchmarks consisting of 11 representative instances from the current *** numerical results show that the proposed algorithm breaks the records in seven out of 11 instances,and obtains the optimal solutions for the other four instances.

关键词： equilibrium constraints packing problem heuristic algorithm tabu search layout optimization

Scheduling Method for Tire Building Based on heuristic algorithm

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Scheduling Method for Tire Building Based on Heuristic Algor...

Multilocation Inventory Models and their heuristic algorithm

第25届中国控制与决策会议

作者： Shengping Yu Diancai Yang Kehui Zhu Shaowen Lu Key Laboratory of Process Industry Automation of Ministry of Education Northeastern University Mesnac Co. Ltd National Tire Technology and Control Engineering Technology Research Center

ISBN: (纸本)9781467355339

There are more product specifications, great production and much equipment over the whole process of tire building. The actual complex scheduling problem of tire building is described in detail. To solve the complex multi-objective, large-scale production scheduling problem of tire building, a heuristic algorithm is proposed from the experience of the experts. The algorithm was tested by online data. Results show that the heuristic algorithm can quickly workout the optimal production scheduling of tire building, reduce the production cost, and improve productivity. The algorithm will lay the firm groundwork for application to production process in the future.

关键词： Tire Building Scheduling heuristic algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Systems Science and Systems Engineering 2000年第4期10卷 488-495页

作者： LUO Jian\|wen,\ WANG Yuan Department of Management, Hangzhou Institute of Electronic Engineering, Hangzhou 310037, China

In this paper, we first construct multilocation inventory models and design a heuristic approximate algorithm of the inventory models. Finally we analyze timing results for algorithm′s implementation on a parallel co... 详细信息

关键词： multilocation inventory model heuristic algorithm timing res0

Production Planning Simulating System for Tire Vulcanization Based on heuristic algorithm

在线全文

学校读者我要写书评

暂无评论

Production Planning Simulating System for Tire Vulcanization...

A new heuristic algorithm for general integer linear programming problems

第24届中国控制与决策会议

作者： Shengping Yu 1 , Diancai Yang 2 , Kehui Zhu 2 1. State Key Laboratory of Synthetical Automation for Process Industries (Northeastern University), Shenyang 110819, China2. Mesnac Co., Ltd, National Tire Technology and Control Engineering Technology Research Center, Qingdao 266045, China

In the process of tire production, vulcanization process is the last process and core process in the total production. The vulcanization process becomes the main bottleneck of the whole tire production process because of the process’s long manufacture time, manufacture centralizing, energy sources large consume. Its plan quality is the key function of improving the utilization of vulcanization equipments and reducing the production cost. Production planning simulating system for vulcanization process based on heuristic algorithm was developed on the basis of studying planning strategy. The system integrates production planning, adjusting production starting time, adjusting the number of devices, inserting orders and withdrawing orders. The software system was tested by online data. Results show that the planning method can quickly workout the optimal production planning of vulcanization. The method will lay the firm groundwork for application to production process in the future.

关键词： Tire vulcanization heuristic algorithm Production planning plan adjustment

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Chongqing University 2006年第3期5卷 170-174页

作者：高培旺 Department of Finance Guangxi University of Finance and Economics Nanning 530003 P. R. China

A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of assistant sets, an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane. A simple numerical example shows that the algorithm is efficient for some problems, and therefore, of practical interest.

关键词： integer linear programming objective function hyperplane cutting plane heuristic algorithm