z-logo
open-access-imgOpen Access
Research on Logistics Distribution Vehicle Scheduling Based on Heuristic Genetic Algorithm
Author(s) -
Chunli Wang,
Yang Wang,
Zeyu Zeng,
Cheng-Yu Lin,
Qiu-Li Yu
Publication year - 2021
Publication title -
complexity
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.447
H-Index - 61
eISSN - 1099-0526
pISSN - 1076-2787
DOI - 10.1155/2021/8275714
Subject(s) - computer science , genetic algorithm , scheduling (production processes) , vehicle routing problem , heuristic , mathematical optimization , operations research , algorithm , artificial intelligence , machine learning , mathematics , embedded system , routing (electronic design automation)
To study the genetic algorithm, this paper solves the problem of shop scheduling under the premise of layout Flying − V . Firstly, double-layer coding is used for optimization. When calculating fitness, the time to return to the mouth P & D approaches the optimum through the greedy idea. Individual screening is carried out through the roulette method. Different crossover and genetic operators are used for different coding layers. Through thinking of elitism and catastrophe and the immigration operator to ensure the diversity of the algorithm in the calculation process, it can achieve the recommendation of the number of cars to control the cost. The stability of the algorithm is good. It can recommend a better picking sequence and number of carts for various types of picking problems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom