scholarly journals Modeling and Solution Algorithm for Optimization Integration of Express Terminal Nodes With a Joint Distribution Mode

2021 ◽  
Vol 33 (4) ◽  
pp. 142-166
Author(s):  
Fanchao Meng ◽  
Qingran Ji ◽  
Hongzhen Zheng ◽  
Huihui Wang ◽  
Dianhui Chu
Keyword(s):  
Joint Distribution ◽  
Simulated Annealing Algorithm ◽  
Low Cost ◽  
Rapid Development ◽  
Experimental Results ◽  
Neighborhood Search ◽  
Timely Manner ◽  
Integration Model ◽  
Distribution Mode ◽  
Annealing Algorithm

The rapid development of e-commerce has led to increased pressure on the express delivery industry to transport products to customers in a timely manner. The problem of how to deliver an increasing volume of express orders to customer clusters in a timely manner and at low cost with the joint distribution mode is becoming urgent. In this study, an express terminal node optimization and integration model is presented with an option to detach single customer clusters. In addition, the simulated annealing algorithm (SAA) based on neighborhood search that includes four rules is proposed to solve the problem. Contrast experiments are performed with SAA, the immune genetic algorithm (IGA), and the CPLEX solver. The experimental results indicate that IGA is less effective than SAA, and the running time of the IGA is longer. The CPLEX solver is less effective than the SAA, too. Additionally, the experimental results also show that every neighborhood rule proposed in this study plays a role in the optimization process.

Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem

1998 ◽  
Vol 6 (1) ◽  
pp. 45-60 ◽  
Author(s):  
Colin R. Reeves ◽  
Takeshi Yamada
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Simulated Annealing Algorithm ◽  
Search Method ◽  
Neighborhood Search ◽  
Search Technique ◽  
Permutation Flowshop ◽  
Sequencing Problem ◽  
Annealing Algorithm ◽  
Tabu Search Method

In a previous paper, a simple genetic algorithm (GA) was developed for finding (approximately) the minimum makespan of the n-job, m-machine permutation flowshop sequencing problem (PFSP). The performance of the algorithm was comparable to that of a naive neighborhood search technique and a proven simulated annealing algorithm. However, recent results have demonstrated the superiority of a tabu search method in solving the PFSP. In this paper, we reconsider the implementation of a GA for this problem and show that by taking into account the features of the landscape generated by the operators used, we are able to improve its performance significantly.

scholarly journals High-Efficiency Wavelet Compressive Fusion for Improving MEMS Array Performance

Sensors ◽  
2020 ◽  
Vol 20 (6) ◽  
pp. 1662 ◽  
Author(s):  
Siyuan Liang ◽  
Weilong Zhu ◽  
Feng Zhao ◽  
Congyi Wang
Keyword(s):  
Real Time ◽  
High Efficiency ◽  
Microelectromechanical Systems ◽  
Inertial Sensor ◽  
Low Cost ◽  
Rapid Development ◽  
Experimental Results ◽  
Zero Bias ◽  
Real Time Processing ◽  
Application Range

With the rapid development of microelectromechanical systems (MEMS) technology, low-cost MEMS inertial devices have been widely used for inertial navigation. However, their application range is greatly limited in some fields with high precision requirements because of their low precision and high noise. In this paper, to improve the performance of MEMS inertial devices, we propose a highly efficient optimal estimation algorithm for MEMS arrays based on wavelet compressive fusion (WCF). First, the algorithm uses the compression property of the multiscale wavelet transform to compress the original signal, fusing the compressive data based on the support. Second, threshold processing is performed on the fused wavelet coefficients. The simulation result demonstrates that the proposed algorithm performs well on the output of the inertial sensor array. Then, a ten-gyro array system is designed for collecting practical data, and the frequency of the embedded processor in our verification environment is 800 MHz. The experimental results show that, under the normal working conditions of the MEMS array system, the 100 ms input array data require an approximately 75 ms processing delay when employing the WCF algorithm to support real-time processing. Additionally, the zero-bias instability, angle random walk, and rate slope of the gyroscope are improved by 8.0, 8.0, and 9.5 dB, respectively, as compared with the original device. The experimental results demonstrate that the WCF algorithm has outstanding real-time performance and can effectively improve the accuracy of low-cost MEMS inertial devices.

Study on Mechanical Bearing Capacity with Tabu Search Algorithm for Multi-Vehicle and Multi-Cargo Loading Problem

2013 ◽  
Vol 345 ◽  
pp. 3-6
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Bearing Capacity ◽  
Simulated Annealing Algorithm ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Search Efficiency ◽  
Neighborhood Structure ◽  
Loading Problem ◽  
Annealing Algorithm

This paper studies multi-vehicle and multi-cargo loading problem under the limited mechanical bearing capacity. Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the construct initial solution to construct neighborhood structure. Firstly, for the operation, 1-move and 2-opt were applied. Secondly, through utilizing Boltzmann mechanism of simulated annealing algorithm, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and the mechanical engineering examples.

scholarly journals Gaussian Pseudorandom Number Generator Based on Cyclic Rotations of Linear Feedback Shift Registers

Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 2103
Author(s):  
Guillermo Cotrina ◽  
Alberto Peinado ◽  
Andrés Ortiz
Keyword(s):  
Simulated Annealing Algorithm ◽  
Low Cost ◽  
Linear Feedback ◽  
Pseudorandom Number Generator ◽  
Implementation Cost ◽  
Linear Feedback Shift Registers ◽  
Annealing Algorithm ◽  
Feedback Shift Registers ◽  
Optimal Configurations ◽  
Complex Algorithm

This paper presents a new proposal to generate optimal pseudorandom numbers with Gaussian distribution. The generator is especially designed for low-cost hardware implementation, although the software version is also considered. For this reason, Linear Feedback Shift Registers in conjunction with cyclic rotations are employed. The proposal presents a low implementation cost and overcomes the limitations of the previous Gaussian generators based on linear feedback shift registers by means of a less complex algorithm to find optimal configurations. As a consequence, it turns into a really usable generator. Moreover, a further improvement, based on the simulated annealing algorithm, is applied in order for the random values to be better adjusted to the normal distribution.

Research on Dispatching Ready Mixed Concrete Based on Simulated Annealing Algorithm

2011 ◽  
Vol 480-481 ◽  
pp. 701-706
Author(s):  
Li Ping Ll ◽  
Guang Li Xu ◽  
Yue Long
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
High Efficiency ◽  
Low Cost ◽  
Dynamic Change ◽  
Optimal Path ◽  
Distance Matrix ◽  
Annealing Algorithm ◽  
Ready Mixed Concrete ◽  
Mixed Concrete

It has become a huge challenge faced by concrete industry to complete the high efficiency and low cost transportation under constraint trucks and time. Based on establishment of ready mixed concrete dispatching mathematical model and aiming at dynamic change of orders, the paper presented a kind of ready mixed concrete dispatching method based on simulated annealing algorithm. It changes ready mixed concrete dispatching into a combined optimal problem constrained by many conditions and introduces idea of penalty function, and then utilize distance matrix and new searching algorithm to compute optimal path and optimal truck number. Computation example of ready mixed concrete dispatching center in some city verifies the feasibility and validity of the proposed algorithm.

scholarly journals Novel Absolute Rotary Position Sensor Based on Combination of Gray Scale Pattern Disc

2021 ◽  
Author(s):  
Ji Myong Choe ◽  
Nam Chol Yu ◽  
Nam Jin Ri ◽  
Mu Song An ◽  
Un Chol Kim
Keyword(s):  
New Technologies ◽  
Low Cost ◽  
Rapid Development ◽  
Angular Position ◽  
Gray Code ◽  
Measurement Range ◽  
Experimental Results ◽  
Position Sensor ◽  
Gray Scale ◽  
Measurement And Control

Abstract Absolute rotary angular /position sensors play an important role in various applications and rapid development of new technologies requires further accurate measurement and control. In this paper, a novel, very simple, low-cost and high accurate absolute rotary angular/ position sensor is presented. The sensor operation is based on the combination of circular gradient gray scale and gray code pattern. A simple experiment is done in order to demonstrate proof of concept of proposed sensor. The experimental results show that the proposed absolute rotary angular/position sensor has excellent linear characteristics with accuracy below ±1° and resolution of 0.1° within the full measurement range from 0° to 360°. The proposed idea and experimental results can be helpful to design absolute rotary angular/position sensor to improve performance of it.

Sign in / Sign up

Export Citation Format

Share Document