Research on vehicle scheduling based on C-W algorithm

Vehicle scheduling is one of the most important links in logistics distribution, a large number of demands also lead to logistics companies have to reasonably arrange the transportation of vehicle routes to save costs. By optimizing the distribution routes of vehicles, logistics companies can save transportation mileage and thus save transportation costs. In this paper,10 demand points of an agricultural products logistics company in Beijing are selected, and the location of the distribution center is obtained through the center of gravity method. Finally, the route allocation is completed by using the mileage saving algorithm, and the scheduling of transport vehicles is realized. The example shows that the mileage saving algorithm can optimize the vehicle route and realize route allocation.

Reconstruction of potential function in inverse Sturm-Liouville problem via partial data

In this paper, three different uniqueness data are investigated to reconstruct the potential function in the Sturm-Liouville boundary value problem in the normal form. Taking account of R\"{o}hrl's objective function, the steepest descent method is used in the computation of potential functions. To decrease the volume of computation, we propose a theorem to precalculate the minimization parameter that is required in the optimization. Further, we propose a novel time-saving algorithm in which the obligation of using the asymptotics of eigenvalues and eigenfunctions and the appropriateness of selected boundary conditions are also eliminated. As partial data, we take two spectra, the set of the $j$th elements of the infinite numbers of spectra obtained by changing boundary conditions in the problem, and one spectrum with the set of terminal velocities. In order to show the efficiency of the proposed method, numerical results are given for three test potentials which are smooth, nonsmooth continuous, and noncontinuous, respectively.

Energy saving algorithm and simulation test in wireless sensor networks

In recent years, scientists have begun to introduce dynamic elements into wireless networks. With the introduction of mobile sink node, the phenomenon of “hot node” and “energy hole” can be effectively avoided, so as to realize more network connection and improve network flexibility. Therefore, it is imperative to design energy-saving algorithm with popular sink code. In this paper, a multi hop data forwarding algorithm is proposed for solar powered wireless sensor networks. The algorithm divides the monitoring area of the network and the communication area of the node. Through the sensor node, the next hop node is selected from the appropriate area, thus forming the path from the data source point to the base station. At the same time, in order to reduce the energy consumption and delay in the network, a multi-objective programming model of the next hop data forwarding node is established. The reasonable area of static and dynamic area is calculated by mathematical analysis. Finally, the paper calculates the network’s life cycle, energy consumption and transmission time, and compares the static sink with the network using only mobile sink.