Research on Logistics Distribution Vehicle Scheduling Based on Heuristic Genetic Algorithm

Chun-Li Wang, Yang Wang, Ze-Yu Zeng, Cheng-Yu Lin, Qiu-Li Yu and Muhammad Javaid

Complexity, 2021, vol. 2021, 1-8

Abstract: 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.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/8275714.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/8275714.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:8275714

DOI: 10.1155/2021/8275714

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().