pseudo parallel genetic algorithm
Recently Published Documents


TOTAL DOCUMENTS

12
(FIVE YEARS 0)

H-INDEX

2
(FIVE YEARS 0)

2015 ◽  
Vol 2015 ◽  
pp. 1-15 ◽  
Author(s):  
Bailing Liu ◽  
Hui Chen ◽  
Yanhui Li ◽  
Xiang Liu

Facility location, inventory control, and vehicle routes scheduling are three key issues to be settled in the design of logistics system for e-commerce. Due to the online shopping features of e-commerce, customer returns are becoming much more than traditional commerce. This paper studies a three-phase supply chain distribution system consisting of one supplier, a set of retailers, and a single type of product with continuous review (Q, r) inventory policy. We formulate a stochastic location-inventory-routing problem (LIRP) model with no quality defects returns. To solve the NP-hand problem, a pseudo-parallel genetic algorithm integrating simulated annealing (PPGASA) is proposed. The computational results show that PPGASA outperforms GA on optimal solution, computing time, and computing stability.


2014 ◽  
Vol 532 ◽  
pp. 422-426
Author(s):  
Ji Ming Tian ◽  
Xin Tan

According to the characteristics of genetic algorithm, an improved method combined dynamic penalty function with pseudo-parallel genetic algorithm is presented in this paper and it can overcome the disadvantages of genetic algorithm for improving the efficiency of algorithm. The improved genetic algorithm is applied to optimization design of multistage hybrid planetary transmission. It takes the minimum volumes as object functions, and fully considered such constraint condition. It is showed that the ability to search the global optimal solution of improved genetic algorithm and less number of iterations. The global optimal solution is worked out quickly. Therefore, the size parameters are optimized, as much as the driving stability and efficiency. Compared to the original program, the volume of 16.55% is decreased.


Sign in / Sign up

Export Citation Format

Share Document