检索结果-南通市图书馆

China Communications 2016年第8期13卷 177-183页

作者： Zeheng Yang Yongan Guo School of Computer Science and Engineering University of Electronic Science and Technology of China(UESTC) College of Telecommunications and Information Engineering Nanjing University of Posts and Telecommunications

Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the *** exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link *** on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on integer linear programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate *** topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.

关键词： network virtualization virtual network embedding exact VNE algorithm integer linear programming location constraint VNR acceptance ratio

An Intelligent Optimization Method of Reinforcing Bar Cutting for Construction Site

在线全文

学校读者我要写书评

暂无评论

Computer Modeling in Engineering & Sciences 2023年第1期134卷 637-655页

作者： Zhaoxi Ma Qin Zhao Tianyou Cang Zongjian Li Yiyun Zhu Xinhong Hei Department of Civil Engineering and Architecture Xi’an University of TechnologyXi’an710048China State Key Laboratory of Rail Transit Engineering Informatization(FSDI) Xi’an710043China Department of Computer Science and Engineering Xi’an University of TechnologyXi’an710048China

To meet the requirements of specifications,intelligent optimization of steel bar blanking can improve resource utilization and promote the intelligent development of sustainable *** one of the most important building materials in construction engineering,reinforcing bars(rebar)account for more than 30%of the cost in civil engineering.A significant amount of cutting waste is generated during the construction *** cutting waste increases construction costs and generates a considerable amount of CO_(2)*** study aimed to develop an optimization algorithm for steel bar blanking that can be used in the intelligent optimization of steel bar engineering to realize sustainable *** the proposed algorithm,the integer linear programming algorithm was applied to solve the *** was combined with the statistical method,a greedy strategy was introduced,and a method for determining the dynamic critical threshold was developed to ensure the accuracy of large-scale data *** proposed algorithm was verified through a case study;the results confirmed that the rebar loss rate of the proposed method was reduced by 9.124%compared with that of traditional distributed processing of steel bars,reducing CO_(2)emissions and saving construction *** the scale of a project increases,the calculation quality of the optimization algorithmfor steel bar blanking proposed also increases,while maintaining high calculation *** the results of this study are applied in practice,they can be used as a sustainable foundation for building informatization and intelligent development.

关键词： Building construction rebar work cutting stock problem optimization algorithm integer linear programming

XGRouter： high-quality global router in X-architecture with particle swarm optimization

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2015年第4期9卷 576-594页

作者： Genggeng LIU Wenzhong GUO Rongrong LI Yuzhen NIU Guolong CHEN College of Mathematics and Computer Science Fuzhou University Fuzhou 350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou 350116 China

This paper presents a high-quality very large scale integration （VLSI） global router in X-architecture, called XGRouter, that heavily relies on integer linear pro- gramming （ILP） techniques, partition strategy and particle swarm optimization （PSO）. A new ILP formulation, which can achieve more uniform routing solution than other formu- lations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing re- gion is extended progressively from the most congested re- git）n. In the post-processing stage of XGRouter, maze rout- ing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global rout- ing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global touters, XGRouter has no overflow.

关键词： global routing overflow total wire length con-gestion uniformity X-architecture particle swarm optimiza-tion integer linear programming

THE TIME INTERVAL ALIGNMENT (IA) POLICIES, BOUNDARY AND APPLICATIONS WITH MULTIPLE STREAM ARRIVALS

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science and Systems Engineering 2011年第4期20卷 400-415页

作者： Meimei WANG James R. PERKINS Decision Support Information System Beth Israel Deaconess Medical Center Boston MA 02120 USA Department of Manufacturing Engineering Boston University Boston MA 02446 USA

This paper discusses a class of interval alignment （IA） scheduling policies, which are particularly effective for the systems that do not have Markovian structure. The numerical results show that IA policies effectively smooth part flows, improve performance and decrease average Work-in-Process （WlP） by adding intermediate delays to the system, The boundary of IA policy is proven and the applications of IA policy in the system with multiple stream arrivals have been discussed. With the combination of release policy, it is practical to implement IA to multiple stream arrival system.

关键词： Detailed scheduling policies non-Markovian multiple stream interval alignment policies integer linear programming lea

Hierarchical method of task assignment for multiple cooperating UAV teams

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2015年第5期26卷 1000-1009页

作者： Xiaoxuan Hu Huawei Ma Qingsong Ye He Luo School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education

The problem of task assignment for multiple cooperating unmanned aerial vehicle(UAV) teams is considered. Multiple UAVs forming several small teams are needed to perform attack tasks on a set of predetermined ground targets. A hierarchical task assignment method is presented to address the problem. It breaks the original problem down to three levels of sub-problems: target clustering, cluster allocation and target assignment. The first two sub-problems are centrally solved by using clustering algorithms and integer linear programming, respectively, and the third sub-problem is solved in a distributed and parallel manner, using a mixed integer linear programming model and an improved ant colony algorithm. The proposed hierarchical method can reduce the computational complexity of the task assignment problem considerably, especially when the number of tasks or the number of UAVs is large. Experimental results show that this method is feasible and more efficient than non-hierarchical methods.

关键词： unmanned aerial vehicle(UAV) task assignment clustering integer linear programming ant colony optimization(ACO) algorithm

Optimization Models for Hybrid Work Scheduling

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

American Journal of Operations Research 2023年第6期13卷 147-176页

作者： Vardges Melkonian Department of Mathematics Ohio University Athens USA

Remote and Hybrid work has been a common practice for many organizations in recent years. It has many advantages such as offering a better work-life balance but it might also negatively affect productivity and teamwork. While an organization would like to satisfy the remote/hybrid preferences of its employees, it also must ensure that there are enough people working in the office to satisfy certain professional needs. Finding the right balance between in-office and remote work is not an easy task. We develop three optimization models to give solutions to the problem. The most comprehensive model allows employees to work remotely some days of the week and flexible hours for those weekdays when employees work in the office. Our computational results show that the models are very time-efficient in practice. The computational results also include a sensitivity analysis of the most comprehensive model.

关键词： integer linear programming Work Scheduling Remote Work Hybrid Work

QoS aware routing and wavelength allocation in optical burst switching networks using differential evolution optimization

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Digital Communications and Networks 2018年第1期4卷 3-12页

作者： Ravi Sankar Barpanda Ashok Kumar Turuk Bibhudatta Sahoo Department of Computer Science & Engineering National Instiute of Technology Rourkela India 769008

The issue of burst losses imposes a constraint on the development of Optical Burst Switching (OBS) networks. Heavy burst losses strongly affect the Quality of Service (QoS) intended by end users. This article presents a QoS aware Routing and Wavelength Allocation (RWA) technique for burst switching in OBS networks. The RWA problem is modeled as a bi-objective integer linear programming (ILP) problem, where objective functions are based on minimizing the number of wavelengths used and the number of hops traversed to fulfill the burst transmission requests for a given set of node pairs. The ILP model is solved using a novel approach based on a Differential Evolution (DE) algorithm. Analytical results show that the DE algorithm provides a better performance compared to shortest path routing, which is a widely accepted routing strategy for OBS networks.

关键词： burst loss optical burst switching quality of service routing and wavelength assignment integer linear programming differential evolution

Security-aware Signal Packing Algorithm for CAN-based Automotive Cyber-physical Systems

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2015年第4期2卷 422-430页

作者： Yong Xie Liangjiao Liu Renfa Li Jianqiang Hu Yong Han Xin Peng Key Laboratory for Application Technology of Internet of Things of Fujian Educational Bureau Xiamen University of Technology Key Laboratory of Embedded and Networking Computing of Hunan Province Hunan University Key Laboratory on Complex Systems Optimization & Controlling of Hunan High Education Institutions Hunan Institute of Science and Technology

Network and software integration pose severe challenges in cyber-security for controller area network(CAN)-based automotive cyber-physical system(ACPS), therefore we employ message authentication code(MAC) to defend CAN against masquerade attack, but the consequent bandwidth overhead makes it a necessity to find the tradeoff among security, real-time and bandwidth utilization for signal packing problem(SPP) of CAN.A mixed-security signal model is firstly proposed to formally describe the properties and requirements on security and real-time for signals, and then a mixed-integer linear programming(MILP)formulation of SPP security-aware signal packing(SASP) is implemented to solve the tradeoff problem, where the bandwidth utilization is improved and the requirements in both security and real-time are met. Experiments based on both society of automotive engineers(SAE) standard signal set and simulated signal set showed the effectiveness of SASP by comparing with the state-of-the-art algorithm.

关键词： Signal packing security automotive cyberphysical systems(ACPS) integer linear programming

Attractor-Based Simultaneous Design of the Minimum Set of Control Nodes and Controllers in Boolean Networks

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics 2016年第14期7卷 1510-1520页

作者： Koichi Kobayashi Graduate School of Information Science and Technology Hokkaido University Sapporo Japan

Design of control strategies for gene regulatory networks is a challenging and important topic in systems biology. In this paper, the problem of finding both a minimum set of control nodes (control inputs) and a controller is studied. A control node corresponds to a gene that expression can be controlled. Here, a Boolean network is used as a model of gene regulatory networks, and control specifications on attractors, which represent cell types or states of cells, are imposed. It is important to design a gene regulatory network that has desired attractors and has no undesired attractors. Using a matrix-based representation of BNs, this problem can be rewritten as an integer linear programming problem. Finally, the proposed method is demonstrated by a numerical example on a WNT5A network, which is related to melanoma.

关键词： Boolean Networks integer linear programming Minimum Set of Control Nodes Singleton Attractors

Fair Scheduling Models for Doubles Group Competitions

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

American Journal of Operations Research 2021年第6期11卷 338-356页

作者： Vardges Melkonian Department of Mathematics Ohio University Athens OH USA

This paper gives integer linear programming models for scheduling doubles tennis group competitions. The goal is to build a fair and competitive schedule for all players. Our basic model achieves that for each player the average ranking of his partners in all matches is as close as possible to the average ranking of his opponents in all matches. One of the variations of the basic model provides that each matchup is fair and competitive. We also give models for the case when the number of players is 4n + 2, and thus one of the matches has to be singles. Our models were implemented and tested using optimization software AMPL. Computational results along with schedules for some typical situations are also given the paper.

关键词： Sport Scheduling Doubles Tournaments Optimization Modeling integer linear programming