The optimization of logistics distribution can be defined as the multiple traveling salesman problem (MTSP). The purpose of existing heuristic algorithms, such as Genetic Algorithm (GA), Ant Colony Algorithm (ACO), etc., is to find the optimal path in a short time. However, two important factors of logistics distribution optimization, including work time window and the carrying capacity of the vehicle in distribution system, have been ignored. In this paper, we consider the influences of time limitation of modern commercial logistics and carrying capacity of the vehicle on the logistics optimization, and then propose a MTSP with constraints of time window and capacity of each salesman. We design a novel hybrid algorithm by combining the minimum spanning 1-tree with ACO to find the optimal solution. In addition, we improve the pheromone update rules to increase the search efficiency of ACO algorithm. The experiments show that the novel hybrid algorithm achieves a shorter path than the other algorithms.
Energy consumption has overtaken equipment costs given the growth of computing power, thereby becoming the dominant cost to data centers. Constrained by ensuring that peak resource requirements of VMs are met, the effective use of resource fragments is an effective means of energy conservation. We apply resource reservation to the resource-utilization-aware energy efficient server consolidation algorithm (RUAEE), and propose a server consolidation energy-saving algorithm (SCES). We adjust the allocations of VMs by computing the resource reservation and resource allocation ratio dynamically. This technique maintains the host resource utilization to within a reasonable range, reduces resource fragmentation and reserves resources to satisfy the peak resource requests simultaneously. Compared with the RUAEE algorithm, our algorithm can reduce the risk of system overload and improve the stability of the system. The experimental results based on the actual workload of the Google cluster show that the algorithm is effective at reducing resource waste, improving system stability, and achieving energy savings.
24 December 2013 in Journal of Applied Mathematics
This paper studies the indefinite stochastic linear quadratic (LQ) optimal control problem with an inequality constraint for the terminal state. Firstly, we prove a generalized Karush-Kuhn-Tucker (KKT) theorem under hybrid constraints. Secondly, a new type of generalized Riccati equations is obtained, based on which a necessary condition (it is also a sufficient condition under stronger assumptions) for the existence of an optimal linear state feedback control is given by means of KKT theorem. Finally, we design a dynamic programming algorithm to solve the constrained indefinite stochastic LQ issue.
1 January 2014 in Mathematical Problems in Engineering
This paper studies the discrete‐time stochastic linear quadratic (LQ) problem with a second moment constraint on the terminal state, where the weighting matrices in the cost functional are allowed to be indefinite. By means of the matrix Lagrange theorem, a new class of generalized difference Riccati equations (GDREs) is introduced. It is shown that the well‐posedness, and the attainability of the LQ problem and the solvability of the GDREs are equivalent to each other.