Improved Genetic Algorithm in Multi-objective Cargo Logistics Loading and Distribution

نویسندگان

چکیده

In order to solve the problem of material distribution path planning in production workshop, this paper proposes a research on multi-objective cargo logistics loading and based improved genetic algorithm. This improves algorithm (P), that is, evolution mode draws lessons from coding algorithm, uses row insertion method obtain initial population. crossover operation, narrow gene similarity is used distinguish chromosome similarity, double variation rate added mutation operation process. The basic parameters are population size pop taken_ = 100, number iterations Max_ gen 200, selection probability 0.8, Local_ Pm 0.1 Global_ Pm=0.2 。 Matlab simulation calculate under different weight settings. When 1, shows stable downward trend after 30 generations converges 55 generations; However, convergence speed traditional very slow middle late stage, it does not begin converge until generation 126. basically has no fluctuation. From whole image, we can see two, connection between starting point point. slope significantly greater than fast, upward with increase iterations. Obviously, better

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Research on Kruskal Crossover Genetic Algorithm for Multi- Objective Logistics Distribution Path Optimization

To effectively optimize multi-objective logistics distribution path, the distance and distance related customer satisfaction factor are used as the objective function, a novel kruskal crossover genetic algorithm (KCGA) for multi-objective logistics distribution path optimization is proposed. To test the optimization results, the terminal distribution model and the virtual logistics system opera...

متن کامل

Multi-objective genetic algorithm

Real world problems often present multiple, frequently conflicting, objectives. The research for optimal solutions of multi-objective problems can be achieved through means of genetic algorithms, which are inspired by the natural process of evolution: an initial population of solutions is randomly generated, then pairs of solutions are selected and combined in order to create new solutions slig...

متن کامل

A Multi Objective Genetic Algorithm (MOGA) for Optimizing Thermal and Electrical Distribution in Tumor Ablation by Irreversible Electroporation

Background: Irreversible electroporation (IRE) is a novel tumor ablation technique. IRE is associated with high electrical fields and is often reported in conjunction with thermal damage caused by Joule heating. For good response to surgery it is crucial to produce minimum thermal damage in both tumoral and healthy tissues named Non-Thermal Irreversible Electroporation(NTIRE). Non-thermal irrev...

متن کامل

An Improved Multi-Objective Genetic Algorithm for Solving Multi-objective Problems

Multi-objective optimization (MO) has been an active area of research in the last two decades. In multi-objective genetic algorithm (MOGA), the quality of newly generated offspring of the population will directly affect the performance of finding the Pareto optimum. In this paper, an improved MOGA, named SMGA, is proposed for solving multi-objective optimization problems. To increase efficiency...

متن کامل

Study of logistics distribution route based on improved genetic algorithm and ant colony optimization algorithm

To solve the problem of vehicle routing problem under capacity limitation, this paper puts forward a novel method of logistics distribution route optimization based on genetic algorithm and ant colony optimization algorithm (GA-ACO). On the first stage, improved genetic algorithm with a good global optimization searching ability is used to find the feasible routes quickly. On the second stage, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Informatica

سال: 2023

ISSN: ['0350-5596', '1854-3871']

DOI: https://doi.org/10.31449/inf.v47i2.3958