Search

Existing task offloading strategy usually makes offloading decision within one time slot without considering the internal relationship between multiple offload time slots, so they cannot be offloaded according to the actual needs of tasks. To solve this problem, this paper proposed a task secondary application offloading strategy based on deep Q network（DQN-TSAO）. Firstly, this paper introduced a three-layer of cloud-edge-end architecture that supports task secondary application offloading, and established priority model, delay model and energy consumption model for task offloading. Second, aiming at minimizing system energy consumption, the energy consumption optimization problem is transformed into a Markov decision process problem of maximum cumulative offloading reward. Finally, DQNTSAO algorithm can extract the task offload characteristics of each time slot, which enabled the task to obtain the optimal offloading decision of multiple time slots in the continuous interaction with the environment. Simulation results validated that DQN-TSAO algorithm can effectively reduce the total energy consumption of the system in a period of time. [ABSTRACT FROM AUTHOR]

Network virtualization is a technology proven to be a key enabling a family of strategies in different targets, such as energy efficiency, economic revenue, network usage, adaptability or failure protection. Network virtualization allows us to adapt the needs of a network to new circumstances, resulting in greater flexibility. The allocation decisions of the demands onto the physical network resources impact the costs and the benefits. Therefore it is one of the major current problems, called virtual network embedding (VNE). Many algorithms have been proposed recently in the literature to solve the VNE problem for different targets. Due to the current successful rise of artificial intelligence, it has been widely used recently to solve technological problems. In this context, this paper investigates the requirements and analyses the use of the Q-learning algorithm for energy-efficient VNE. The results achieved validate the strategy and show clear improvements in terms of cost/revenue and energy savings, compared to traditional algorithms. [ABSTRACT FROM AUTHOR]

The paper focused on cache optimization and service selection algorithms in the cloud-edge environment. In order to solve the problem of cached content in edge servers, factors such as energy consumption and cost are considered, and finally a cache optimization model based on popularity was proposed. As for service selection, a Q-learning-based service selection algorithm is proposed to address the problems of dynamic task allocation and the optimization of Qos in the edge computing environment. The experimental results show that the proposed cache optimization and service selection algorithms in cloud-edge environment can better improve the cache hit ratio, minimize the transmission overhead, and ensure the server load balancing in the cloud-edge environment. [ABSTRACT FROM AUTHOR]

Recently, energy-saving scheduling issues have attracted more and more attention in the manufacturing field. Meanwhile, in practical production, maintenance planning is viewed as a vital task in the workshop. However, the existing literature about energy-saving scheduling problems rarely consider the effect of preventive maintenance. Therefore, this paper investigates an energy-saving flexible job shop scheduling problem with preventive maintenance. A mathematical model is proposed considering the minimization of total energy consumption. To solve the problem, a novel discrete elephant herding optimization algorithm (NDEHO) is proposed according to the problem's characteristics. To test the NDEHO's performance, the Taguchi design of experiment approach is adopted to get the best combination of parameters in the algorithm. Numerical experiments are conducted based on twenty-four instances, including four benchmark instances and twenty randomly generated instances. Computational data indicate that NDEHO outperforms other compared algorithms for solving the considered problem. [ABSTRACT FROM AUTHOR]

Finding the location of sensors in wireless sensor networks (WSNs) is a major test, particularly in a wide region. A salient clustering approach is laid out to achieve better performance in such a network using an evolutional algorithm. This paper developed a clustered network called neighborhood grid cluster which has a node assuming the part of a cluster center focused in every grid. Grid-based clustering is less difficult and possesses a lot of benefits compared to other clustering techniques. Besides, we proposed a localization algorithm that centers around assessing the target area by considering the least estimated distance embedded with the genetic algorithm. Performance standards incorporate the energy representation, connectivity stratagem, and distance measure as fitness functions that assess our localization problem to demonstrate its viability. Simulation results confirm that our approach further improves localization accuracy, energy utilization, node lifetime, and localization coverage. [ABSTRACT FROM AUTHOR]

In this paper, we consider a computation offloading problem in a three-tier network consisting of multiple mobile users (MUs), multiple edge clouds, and a central cloud. On this basis, we formulate a system Energy Time Cost ($ETC$) minimization problem by jointly optimizing the resource allocation, mobile-edge matching decision, and offloading decision. Due to the difficulty of directly solving the formulated problem, we decompose it and propose two offloading algorithms, namely Gale-Shapley based Minimum/Sequential Offloading Algorithm (GS-MOA/GS-SOA), to optimize offloading decisions by minimizing the system $ETC$ , in which the mobile-edge matching strategies based on the proposed Gale-Shapley based Mobile-Edge mAtching aLgorithm (GS-MEAL) and resource allocations are optimized iteratively. The simulations show the effectiveness of our proposed algorithm. [ABSTRACT FROM AUTHOR]

To improve the capability of multi-objective differential algorithm, this paper proposed a multi-objective differential evolution algorithm based on self-adaptive strategy(MODE-SS). This algorithm not only used the hyper-volume to evaluate the performance of mutation strategies and selected a suitable mutation strategy automatically, but also employed binomial and simulated binary crossover strategies to balance global and local search capabilities. The results on 10 test functions show that MODE-SS outperforms the other six state-of-the-art multi-objective optimization algorithms. Finally, this paper used MODE-SS to solve the problem of energy consumption optimization of sea-rail intermodal transportation. The results can provide a set of available solutions to decision-makers. [ABSTRACT FROM AUTHOR]

In order to solve the problem of lane changing in the dual platoon composed of CAV, this model proposed a distributed cooperative lane changing strategy based on event triggering. In this strategy, this paper designed a second-order consensus control protocol for the dual platoon system. At the same time, in order to reduce the frequent update of CAV' s controller, it also designed an event trigger based on combining measurement. It used the designed of Lyapunov function and the analysis of Zeno behavior to prove the stability and feasibility of the algorithm. The simulation results show that the designed control protocol can make the dual platoon system consensus, effectively reduce the update frequency of CAV controller and reduce the system energy consumption. By comparison, it proves the effectiveness of the model, and the convergence of this system is faster. [ABSTRACT FROM AUTHOR]

Summary: Shared transportation is a new way of traveling generated by the rapid development of the "Internet +" and the sharing economy. Due to the limited energy carried by shared e‐bikes, the energy problem becomes the primary obstacle restricting its development. At present, one way to solve the energy problem is to use mobile charging vehicles (MCVs). However, how to schedule MCVs to achieve fast response, reduce energy consumption, and improve charging efficiency is crucial. In this paper, we propose a Charging Scheduling scheme based on Dynamic Characteristic of shared e‐bike in Obstacle Space (CSDC‐OS). Firstly, we design two MCV departure mechanisms to solve the problems of low utilization of MCVs and long waiting time for shared e‐bikes. Then, we design the schedulability conditions based on the A‐star algorithm and the dynamic change of e‐bikes to ensure that MCVs can return to the service station in time. Finally, we propose a charging sequence algorithm based on linear skyline query and a selective insertion algorithm to improve the charging efficiency of MCVs. Simulation results show that the CSDC‐OS can improve the response time, mobile consumption, and charging efficiency by more than 8% on average. [ABSTRACT FROM AUTHOR]

Nowadays, cloud computing is known as an internet-based modern area among emerging technologies that brings up an environment, in which computing resources such as hardware, software, storage, etc. can be rented by cloud users based on a pay per use model. Since the size of cloud computing is widely expanding and the number of cloud users is also increasing day by day, high energy consumption becomes a serious concern in the operation of complex cloud data centers. In this regards, Virtual Machine (VM) consolidation plays a vital role in utilizing cloud resources in an efficient manner. It migrates the running VMs from overloaded Physical Machines (PMs) to other PMs considering multiple factors, such as migration overhead, energy consumption, resource utilization, and migration time. Since the VM consolidation issue is known as an NP-hard problem, various nature‐inspired meta-heuristic algorithms aiming to solve this problem have been utilized in recent years. However, a lack of systematic and detailed survey study in this field is obvious. Therefore, this gap motivated us to provide the current paper aiming to highlight the role of nature-inspired meta-heuristic algorithms in the VM consolidation problem, review the existing approaches, offer a detailed comparison of approaches based on important factors, and finally, outline the future directions. [ABSTRACT FROM AUTHOR]

This paper proposed a data fusion algorithm based on cellular network structure (DFACN) to solve the problem of unbalance between node energy consumption and data accuracy in wireless sensor network. In the clustered structure based on a cellular network, first, the algorithm screened the cluster head with the smallest energy consumption. Then it calculated the data accuracy and the energy consumption of the node to the fusion factor in order to select the number of nodes in the cluster dynamically. Finally, the cluster head completed the data fusion automatically. In the OPNET simulation environment, compared to the EECDA and the IDDOA algorithm, the data accuracy of the DFACN algorithm increases 2. 6% and 4. 7%, the node energy consumption reduces 2. 7% and 3. 4%. The results show that DFACN algorithm reduces energy consumption while improves the accuracy of data fusion effectively, and extends the life cycle of the network. [ABSTRACT FROM AUTHOR]

In order to solve the problem of packet loss, high overhead and network throughput in the existing interference attack detection technology, this paper proposed a wireless sensor network interference attack detection technology based on cluster and timestamp. This technology grouped the sensor nodes based on the clustering algorithm, identified the malicious nodes by timestamp, and detected the interference by judging whether matched the signature or not. If it identified any node as a malicious node, scheduled the new cluster to bypass the blocked area and continue to communicate through alternate routes. Experiments show that compared with the prior art, the timestamp-based interference detection technology is superior to the existing method performance in PDR, network throughput, energy consumption and routing overhead. [ABSTRACT FROM AUTHOR]

Planetary soft landing has been studied extensively due to its promising application prospects. In this paper, a soft landing control algorithm based on deep reinforcement learning (DRL) with good convergence property is proposed. First, the soft landing problem of the powered descent phase is formulated and the theoretical basis of Reinforcement Learning (RL) used in this paper is introduced. Second, to make it easier to converge, a reward function is designed to include process rewards like velocity tracking reward, solving the problem of sparse reward. Then, by including the fuel consumption penalty and constraints violation penalty, the lander can learn to achieve velocity tracking goal while saving fuel and keeping attitude angle within safe ranges. Then, simulations of training are carried out under the frameworks of Deep deterministic policy gradient (DDPG), Twin Delayed DDPG (TD3), and Soft Actor Critic (SAC), respectively, which are of the classical RL frameworks, and all converged. Finally, the trained policy is deployed into velocity tracking and soft landing experiments, results of which demonstrate the validity of the algorithm proposed. [ABSTRACT FROM AUTHOR]

Abstract: In recent years, the use of extensible processors has been increased. Extensible processors extend the base instruction set of a general-purpose processor with a set of custom instructions. Custom instructions that can be implemented in special hardware units make it possible to improve performance and decrease power consumption in extensible processors. The key issue involved is to generate and select automatically the custom instructions from a high-level application code. In this paper, we propose a new efficient algorithm for the automatic generation of all candidate instructions (or patterns). Our pattern generation algorithm identify all feasible connected and disjoint patterns under different constraints. Compared to a previously proposed well-known algorithm, our algorithm solves the problem more efficiently by taking advantage of the topological property of data flow graph (DFG) as well as overcoming the drawbacks of the previously proposed algorithm. An extension of the proposed algorithm is also presented in this paper. The extended algorithm further radically reduce the search space by considering the input resolving nodes. Experimental results show that our algorithms can achieve orders of magnitude speedup over the well-know algorithm. [Copyright &y& Elsevier]

With increasing demand in multimedia applications and high data rate services, energy consumption of wireless devices has become a problem. At the user equipment side, high-level energy consumption brings much inconvenience, especially for mobile terminals that cannot connect an external charger, due to an exponentially increasing gap between the available and required battery capacity. Motivated by this, in this paper we consider uplink energy-efficient resource allocation in very large multi-user MIMO systems. Specifically, both the number of antenna arrays at BS and the transmit data rate at the user are adjusted to maximize the energy efficiency, in which the power consumption accounts for both transmit power and circuit power. We proposed two algorithms. Algorithm1, we demonstrate the existence of a unique globally optimal data rate and the number of antenna arrays by exploiting the properties of objective function, then we develop an iterative algorithm to obtain this optimal solution. Algorithm2, we transform the considered nonconvex optimization problem into a convex optimization problem by exploiting the properties of fractional programming, then we develop an efficient iterative resource allocation algorithm to obtain this optimal solution. Our simulation results did not only show that the the proposed two algorithms converge to the solution within a small number of iterations, but demonstrated also the performances of the proposed two algorithms are close to the optimum. Meanwhile, it also shows that with a given number iterations the performance of proposed algorithm1 is superior to proposed algorithm2 under small p. On the contrary, the performance of proposed algorithm2 is superior to proposed algorithm1 under large p. [ABSTRACT FROM AUTHOR]

In recent years, green manufacturing has attracted wide attention from researchers. However, the energy efficiency problem in matrix manufacturing workshops is still a blank area. This paper considers a novel automatic guided vehicle (AGV) energy-efficient scheduling problem with release time (AGVEESR) to optimize the three objectives of energy consumption, number of AGVs used and customer satisfaction simultaneously. Considering the development of the AGVEESR, we extract problem-specific knowledge, establish a multiobjective mathematical model, and design a hybrid constructive heuristic. Due to the complexity of the problem, we propose an efficient multiobjective greedy algorithm (MOGA) with effective strategies such as new population initialization, greedy operation, and self-adaptive multiple neighbourhood local search. Meanwhile, an ideal-point-based construction operator in the greedy operation phase is presented to lower the computational complexity. Simulation results show that the proposed MOGA has a tremendously superior performance to the five state-of-the-art algorithms in solving the problem considered. [ABSTRACT FROM AUTHOR]

This paper investigates energy efficient power allocation for orthogonal frequency division multiplexing-(OFDM-) based cognitive radio (CR) systems with partial intersystem channel state information (CSI) available. The goal is to maximize energy efficiency (EE) while ensuring the minimum rate of secondary user (SU) and keeping the average interference power (AIP) introduced to primary user (PU) within a target probability level. We propose a suboptimal algorithm to solve this optimization problem based on classic water-filling (WF) technique. Moreover, we first address the relation between EE and water level. In order to reduce complexity, a simplified algorithm with closed-form solution is also proposed. Numerical results are provided to corroborate our theoretical analysis and to demonstrate the effectiveness of the proposed schemes. [ABSTRACT FROM AUTHOR]

This paper tackles the short-term hydro-power unit commitment problem in a multi-reservoir system — a cascade-based operation scenario. For this, we propose a new mathematical modeling in which the goal is to maximize the total energy production of the hydro-power plant in a sub-daily operation, and, simultaneously, to maximize the total water content (volume) of reservoirs. For solving the problem, we discuss the Multi-objective Evolutionary Swarm Hybridization (MESH) algorithm, a recently proposed multi-objective swarm intelligence-based optimization method which has obtained very competitive results when compared to existing evolutionary algorithms in specific applications. The MESH approach has been applied to find the optimal water discharge and the power produced at the maximum reservoir volume for all possible combinations of turbines in a hydro-power plant. The performance of MESH has been compared with that of well-known evolutionary approaches such as NSGA-II, NSGA-III, SPEA2, and MOEA/D in a realistic problem considering data from a hydro-power energy system with two cascaded hydro-power plants in Brazil. Results indicate that MESH showed a superior performance than alternative multi-objective approaches in terms of efficiency and accuracy, providing a profit of $412,500 per month in a projection analysis carried out. • An efficient Multi-objective Evolutionary Swarm Hybrid algorithm is proposed. • Development of a nonlinear model to operational control of Hydro-power plants. • Hydro-power plant data regression obtains the maximum efficiency of the power units. • Efficiency energy goals achieved an increasing the profit in the energy production. [ABSTRACT FROM AUTHOR]

In recent decades, the Timed Elastic Band (TEB) algorithm is widely used for the AGV local path panning because of its convenient and efficiency. However, it may make a local detour when encountering a curve turn and cause excessive energy consumption. To solve this problem, this paper proposed an improved TEB algorithm to make the AGV walk along the wall when turning, which shortens the planning time and saves energy. Experiments were implemented in the Rviz visualization tool platform of the robot operating system (ROS). Simulated experiment results reflect that an amount of 5% reduction in the planning time has been achieved and the velocity curve implies that the operation was relatively smooth. Practical experiment results demonstrate the effectiveness and feasibility of the proposed method that the robots can avoid obstacles smoothly in the unknown static and dynamic obstacle environment. [ABSTRACT FROM AUTHOR]

The growing energy demand and environmental consciousness provoke the conventional single-objective optimization framework no longer satisfies new power system planning and control requirements. The number of optimization objectives being considered in power system optimization is increasing, necessitating the development of many-objective Optimal Power Flow (OPF) problems and the development of solution methods. In this paper, the fitness functions for the Many-Objective OPF (MaO-OPF) problem have been formulated, and a new Many-Objective Gradient-Based Optimizer (MaOGBO) based on reference point strategy is proposed to solve the MaO-OPF problem. The objectives of the MaO-OPF problem is to minimize the Reactive Power Loss (RPL), Active Power Loss (APL), Voltage Magnitude Deviation (VMD), Voltage Stability Indicator (VSI), Total Emission (TE), and the Total Fuel Cost (TFC) by satisfying different complex equality and inequality constraints. In the proposed MaOGBO, a reference point strategy is employed to acquire evenly spread Pareto -optimal solutions in each objective space. In order to improve the effectiveness of Pareto solutions, a mixed-multi-constraint handling approach is also implemented. In order to deal with the complex non-linear constraints, the process utilizes both the repair technique and penalty function. Besides, a fuzzy-based membership function strategy is also applied to locate the Best Compromise Solution (BCS) from the Pareto -optimal analytical solution. In order to validate the effectiveness of the proposed MaOGBO, DTLZ and MaF benchmark test suites are considered. In addition, a standard Institute of Electrical and Electronics Engineers (IEEE) bus test systems, such as IEEE-30/IEEE-57/IEEE-118 with different case studies, are also considered to assess the performance of the proposed algorithm. The obtained results are compared with other state-of-the-art algorithms, and the proposed MaOGBO proves the superiority over other competitors for most of the selected problems, including MaO-OPF. Finally, the proposed MaOGBO is also validated on large-scale Algerian 59-bus power systems and proved its superiority in handling realistic systems. This research is further supported up with extra online service and guidance at https://premkumarmanoharan.wixsite.com/mysite. • MaOGBO is developed using a reference-point mechanism to obtain the solution diversity and faster convergence. • MaOGBO is combined with a multi-constraint handling mechanism and fuzzy membership-based best compromise solution strategy. • The performance of the MaOGBO is validated on 22 benchmark test suites and three test frameworks of MaO-OPF problems, and also validated on large scale Algerian 59-bus real-time system. • Performance metrics, such as GD, IGD, SP, HV, and RT are calculated for all selected problems. • Three different statistical significance tests are carried out to assess the performance of MaOGBO. [ABSTRACT FROM AUTHOR]

Energy saving is an important issue for multiple-chiller systems. Optimal chiller loading (OCL) in multiple-chiller systems has been investigated with many optimization algorithms to save energy. Particle swarm optimization (PSO) algorithm has been successful in solving this problem in some cases, but not in all. This study innovatively added a team evolution to the original particle swarm optimization algorithm, called team particle swarm optimization (TPSO). The TPSO enhances the effectiveness of original particle swarm optimization to better solve the OCL problem. The TPSO algorithm is composed of two evolutions: particle evolution and team evolution. The partial load ratio (PLR) of each operating chiller and the on-off state of each chiller are the particle evolution parameters and team evolution parameters, respectively. To evaluate the performance of the proposed method, this paper adopts three case studies so the results generated from the proposed algorithm TPSO, the original particle swarm optimization (PSO) and other recently published algorithms can be compared. In these three case studies, the optimal results generated by using TPSO algorithm are the same as those by other compared algorithms. In case 1 under 5717 RT and 5334 RT cooling load, the results generated using the TPSO are lower than those by the original PSO in the amounts of 63.35 and 79.33 kW, respectively. The results indicated that the TPSO algorithm not only enabled the optimal solution in minimizing energy consumption, but also demonstrated the best stability when compared to other algorithms. In conclusion, the presented TPSO algorithm is an efficient and promising new algorithm for solving the OCL problem. [ABSTRACT FROM AUTHOR]

Abstract: The problem of the Earth–Moon low energy trajectory optimization in the real system (the model defined by the JPL ephemeris DE405) is considered in this paper. First, this problem is investigated in the model of circular restricted three-body problem, since the fuel consumption is closely related to the Jacobi integral of the transfer trajectory, a method based on Jacobi integral is proposed and eight optimal trajectories are obtained. These optimal trajectories provide initial information (the flight time and the braking velocity impulse) to search the optimal low energy trajectories in the real system through optimization techniques. Considering the merit and drawback of particle swarm optimization and differential evolution algorithm in solving the space trajectory problem, an improved cooperative evolutionary algorithm is put forward. Result shows that the low energy trajectories in the real system are more fuel-efficient than the corresponding ones under the circular restricted three-body problem. [Copyright &y& Elsevier]

This paper considers the energy consumption minimization in permutation flow shop (PFS) scheduling problem. The energy consumption of eachmachine is decomposed into two parts: useful part which completes the operation at current stage and wasted part which is consumed during idle period. The objective considered here is to minimize the total wasted energy consumption which is a weighted summation of the idle time of each machine. To solve this new problem, a branch-and-bound algorithm is developed. Two lower bounds are proposed, and an initial upper bound by using a variant of NEH heuristic algorithm is applied. Compared with themakespan minimization criterion, thismodel deduces more energy-saving solutions. Experimental results also validate the efficiency of the proposed algorithm for problems with job number not larger than 15. [ABSTRACT FROM AUTHOR]

Abstract: In this paper the optimal energy efficiency and high pressure problem in single stage transcritical carbon dioxide vapour compression units is addressed. A real-time model-based optimisation algorithm for the optimal (or quasi-optimal, close to the optimal) pressure determination is developed as a more efficient and robust solution than literature approximated ones. The problem is solved by a model estimating the system performance and by measuring its boundary conditions. The model is obtained by an on-line artificial neural network identification technique and the optimisation problem is worked out by a particle swarm technique. The proposed algorithm is dynamically tested by simulation, considering the performance of a supply water temperature controlled carbon dioxide heat pump. It appears to successfully approximate the optimal cycle discharge pressure showing an average daily pressure deviation of 0.9×105 Pa over a two years simulation period, corresponding to 1.1% increase in the cumulated energy consumption, compared to the optimal pressure solution. [Copyright &y& Elsevier]

Abstract: We present a novel transmission expansion planning model that explicitly considers a multi-year planning horizon. The proposed formulation is a mixed-integer linear problem that can be solved using commercially available software. The algorithm determines the best overall transmission expansion plan, reflecting both investment and operational costs. To analyze the results obtained from the model, we use a set of efficiency metrics to appraise the effect of the expansion among generators and demands, as well as congestion metrics to measure changes in nodal prices and line congestions. This paper also provides a case study that considers the expansion plan for a transmission system based on the one of mainland Spain. [Copyright &y& Elsevier]

Abstract: This study employs differential evolution algorithm to solve the optimal chiller loading problem for reducing energy consumption. To testify the performance of the proposed method, the paper adopts two case studies to compare the results of the developed optimal model with those of the Lagrangian method, genetic algorithm and particle swarm algorithm. The result shows that the proposed differential evolution algorithm can find the optimal solution as the particle swarm algorithm can, but obtain better average solutions. Moreover, it outperforms the genetic algorithm in finding optimal solution and also overcomes the divergence problem caused by the Lagrangian method occurring at low demands. [ABSTRACT FROM AUTHOR]