Sustainable closed-loop supply chain network design: heuristic hybrid approach with considering inflation and carbon emission policies by Saeid Kalantari, Hamed Kazemipoor, Farzad Movahedi Sobhani, Seyyed Mohammad Hadji Molana

Subjects: Get full text

Energy efficient optimal sink position selection algorithm for multi-sink wireless sensor networks by TANG Wei, GUO Wei

Subjects: Get full text

Minimum number oriented relay node deployment algorithm in two-tiered WSN by Chun-yu MIAO, Li-na CHEN, Guo-yong DAI, Fan YANG, Qing-zhang CHEN

“…In the large-scale wireless sensor network, the heuristic algorithm was proposed that found the best deployment re-gion through iteratively updating the deployment area luding the most relay nodes. …”
Get full text

Data-Driven Robust Optimization of the Vehicle Routing Problem with Uncertain Customers by Jingling Zhang, Yusu Sun, Qinbing Feng, Yanwei Zhao, Zheng Wang

“…The Q-learning algorithm in reinforcement learning is introduced into the high-level selection strategy using the hyper-heuristic algorithm, and a hyper-heuristic algorithm based on the Q-learning algorithm is designed to solve the problem. …”
Get full text

Multiproduct Multiperiod Newsvendor Problem with Dynamic Market Efforts by Jianmai Shi, Yiping Bao

“…A Lagrangian relaxation based solution approach is developed to solve the problem, in which the subgradient algorithm is used to find an upper bound of the solution and a feasibility heuristic algorithm is proposed to search for a feasible lower bound. …”
Get full text

DQN-based energy-efficient routing algorithm in software-defined data centers by Zan Yao, Ying Wang, Xuesong Qiu

“…Compared with the solver and the CERA heuristic algorithm, energy-saving effect of the deep Q-network-based energy-efficient routing algorithm is almost the same as the heuristic algorithm; however, its calculation time is reduced a lot, especially in a large number of flow scenarios; and it is more flexible to design and resolve the multi-objective optimization problem.…”
Get full text

An Ante Hoc Enhancement Method for Image-Based Complex Financial Table Extraction by Weiyu Peng, Xuhui Li

“…The split module uses an OCR (optical character recognition) model to locate text regions, and a heuristic algorithm to obtain candidate demarcation lines. …”
Get full text

A new population initialisation method based on the Pareto 80/20 rule for meta‐heuristic optimisation algorithms by Mohammad Reza Hasanzadeh, Farshid Keynia

“…Abstract In this research, a new method for population initialisation in meta‐heuristic algorithms based on the Pareto 80/20 rule is presented. …”
Get full text

Integrated Optimization of Mixed Cargo Packing and Cargo Location Assignment in Automated Storage and Retrieval Systems by Bin Lei, Zhaoyuan Jiang, Haibo Mu

“…A heuristic algorithm for a two-dimensional rectangular-packing problem is designed to determine whether a variety of goods can be mixed in packing. …”
Get full text

Design and analysis of intelligent service chain system for network security resource pool by Zenan WANG, Jiahao LI, Chaohong TAN, Dechang PI

“…The traditional network security architecture ensures network security by directing traffic through hardware based network security function devices.Since the architecture consists of fixed hardware devices, it leads to a single form of network security area deployment and poor scalability.Besides, the architecture cannot be flexibly adjusted when facing network security events, making it difficult to meet the security needs of future networks.The intelligent service chain system for network security resource pool was based on software-defined network and network function virtualization technologies, which can effectively solve the above problems.Network security functions of virtual form were added based on network function virtualization technology, combined with the existing hardware network elements to build a network security resource pool.In addition, the switching equipment connected to the network security elements can be flexibly controlled based on software-defined network technology.Then a dynamically adjustable network security service chain was built.Network security events were detected based on security log detection and a expert library consisting of security rules.This enabled dynamic and intelligent regulation of the service chain by means of centralized control in the face of network security events.The deployment process of the service chain was mathematically modeled and a heuristic algorithm was designed to realize the optimal deployment of the service chain.By building a prototype system and conducting experiments, the results show that the designed system can detect security events in seconds and automatically adjust the security service chain in minutes when facing security events, and the designed heuristic algorithm can reduce the occupation of virtual resources by 65%.The proposed system is expected to be applied to the network security area at the exit of the campus and data center network, simplifying the operation and maintenance of this area and improving the deployment flexibility of this area.…”
Get full text

Presentating a multi-objective optimization model for resource-constrained project scheduling regarding financial costs, time delays and the reliability function by Saeideh Naderi, Mohsen Vaez-Ghasemi, Farzad Movahedi Sobhani

“…Accordingly, it can be concluded that this meta-heuristic algorithm (GA) has more efficiency and more apposite performance for the recommended model compared with the Exact optimization software. …”
Get full text

Survivable virtual network mapping with differentiated services QoP by Guang-yuan LIU, Kai SHUANG, Sen SU

“…The protection needs of virtual network are more and more diversified.So how to realize survival virtual net-work mapping of different needs is the important issue.The mathematical model of differentiated services QoP issue was formulated.Then a heuristic algorithm was proposed to solve it.The simulation results demonstrate the algorithm can sa-tisfy various virtual networks protection for users and decline the substrate network bandwidth cost compared with other algorithms.…”
Get full text

Highly reliable access algorithm for PD-NOMA based IoT with delay guarantee by Chaonong XU, Jianxiong WU, Yongjun XU

“…A single-hop PD-NOMA network supporting k-successive interference cancellation (k-SIC) was considered.Given the real-time performance requirements,how to maximize the average reliability of uplink transmissions by the joint users grouping and power allocation was studied.A heuristic algorithm with complexity of O(nlogn) was presented,where n was the number of users.The algorithm was also proved to be the optimal if k=2.The performance evaluations reveal that the transmission reliability will increase exponentially with the linear degradation of the real-time performance guarantee.Besides,the transmission reliability is enhanced with respect to the random users grouping algorithm.…”
Get full text

Optimal cluster head deployment in heterogeneous wireless sensor networks by LIU Lin1, YU Hai-bin2

“…Cluster-based method has better adaptability and energy-efficiency to wireless sensor networks（WSN） used for environmental monitoring.If the cluster head is served by more powerful node,the performance of WSN will be improved greatly.In large scale WSN,high-power cluster head deployment is a kind of NP-hard problem.The optimal problem of cluster head deployment was formulated as an integer programming with the condition of restrictions of cluster head capacity and the maximal cluster radius.To satisfy the time effectiveness,a heuristic algorithm called KMSA was proposed which was a hybrid algorithm of K-mean and simulated annealing.The simulation results show that the KMSA can improve the performance of WSN on varieties of network size and cluster number.…”
Get full text

Novel algorithm for dynamic bandwidth scheduling in WDM EPON by Xue-shun WANG, Shao-hua YU, Jin-you DAI

“…Optical network unit(ONU)grant scheduling techniques for wavelength division multiplexed Ethernet passive optical networks (WDM EPON) was investigated and the grant scheduling problem based on scheduling theory was solved the question was formulated into a rectangle packing problem and a high performance ONU grant scheduling policy based on Euclidian distance was proposed by taking quasi-human strategy.An effective heuristic algorithm was provided to quickly solve ONU grant scheduling problem in WDM EPON.Further simulation experiments show the grant scheduling algorithm can decrease average packet delay and increase network utilization.The results indicate the effectiveness of this algorithm.…”
Get full text

Algoritma Simulated Annealing untuk Menentukan Rute Kendaraan Heterogen (Studi Kasus) by Andriansyah Andriansyah, Rizky Novatama, Prima Denny Sentia

“…Analitycal method, insertion heuristic algorithm as heuristic method and simulated annealing algorithm as metaheuristic method are the methods used. …”
Get full text

Service function chain construct algorithm based on reliability by Julong LAN, Zijin JIN, Penghao SUN, Yiming JIANG, Yue WANG

“…With the continuous expansion of network size and content quantity,network operators often face the problem of data transmission interruption,thus how to improve the reliability of data transmission has become a research hotspot.Started with the huge advantages of NFV environment over traditional TCP/IP architecture based on the background that every network node has the capability of security service,a reliability algorithm for constructing functional service chains was proposed.First,the network topology was introduced and abstracted it into a digraph for a better analyzation.Then,several quantitative indices were used to define the upper and lower bounds of failure probability and resolved the model through a heuristic algorithm.The experimental results show that the proposed algorithm increases the reliability of service chain selection and spends less time.…”
Get full text

Minimum latency data aggregation scheduling in MR-MC wireless sensor networks by Jin-bao LI, Meng WANG, Long-jiang GUO

“…The problem of minimum latency data aggregation scheduling in single-radio single-channel wireless sensor networks is a NPC problem and many solutions have been proposed.In multi-radio multi-channel networks,the latency may be lower as a node may receive transmission data from other different nodes simultaneously.It formulates the minimum latency data aggregation scheduling into an optimization problem with joint consider of tree structure,time slot assignment,channel assignment and radio assignment.The problem is divided into constructing data aggregation tree and designing a node schedule subproblems.For each subproblem,heuristic algorithm has been proposed.The simulation results show that the proposed algorithm achieve good performance.…”
Get full text

Multicast service protection algorithm based on elastic optical network by Jingjing WU, Jianfang ZHANG

“…With the rapid growth of the network traffic,the elastic optical network (EON) has been proposed as a promising solution due to its high spectrum efficiency and flexible bandwidth provision.Meanwhile,multicast routing and spectrum allocation,and the survivability of the network become more challenging than that in the conventional optical network.The routing for multicast traffic and its protection algorithm in EON was investigated.An integer linear programming (ILP) formulation with the objective to minimize total spectrum consumption was presented.In addition,a heuristic algorithm called multicast sub-tree protection algorithm (MSPA) to achieve sufficient protection and satisfy resources savings was designed.The simulation results demonstrate that comparing with the traditional multicast routing and protection algorithm,MSPA performs well in improving the blocking probability and the spectrum utilization of the network.…”
Get full text

An algorithm for embedding oversubscribed virtual data center by Chukun LU, Fangfang YAN, Dong LI

“…Predictable network performance is critical for cloud applications and can be achieved by providing tenants a dedicated virtual data center (VDC) with bandwidth guarantee.The embedding problem of oversubscribed data center in physical data center network was studied.Compared with the general virtual data center,the traffic pattern between the virtual machines in the over-subscription virtual data was more complicated.Therefore,the flow model and the embedding problem were described.A heuristic algorithm with lower time complexity was proposed for the embedding problem of virtual machine-packet perturbation algorithm.Finally,the simulation algorithm was used to compare the packet perturbation algorithm with the algorithm proposed in the previous work and the famous first-fit.The experiment result shows that the proposed algorithm improves the embedding success rate while reducing the complexity of the algorithm.…”
Get full text