General variable neighborhood search for the multi-AGV scheduling problem with sorting operations

To solve the intractable multiple automatic guided vehicles (AGVs) scheduling problem encountered in the sorting processes of the logistics sorting centers,a large-scale AGV scheduling problem was studied on the basis of considering the sorting time windows and charging requirements.A general variab...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Chao GUO, Xiangling CHEN, Peng GUO, Qiang WANG
Formato:	article
Lenguaje:	ZH
Publicado:	Hebei University of Science and Technology 2021
Materias:	logistics system management; sorting operation; automatic guided vehicle; scheduling; charging demand; vari-able neighborhood search Technology T
Acceso en línea:	https://doaj.org/article/8bc6370d2d5a4cd5b2709db2243c8276
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:8bc6370d2d5a4cd5b2709db2243c8276
record_format	dspace
spelling	oai:doaj.org-article:8bc6370d2d5a4cd5b2709db2243c82762021-11-23T07:09:07ZGeneral variable neighborhood search for the multi-AGV scheduling problem with sorting operations1008-154210.7535/hbkd.2021yx05011https://doaj.org/article/8bc6370d2d5a4cd5b2709db2243c82762021-10-01T00:00:00Zhttp://xuebao.hebust.edu.cn/hbkjdx/ch/reader/create_pdf.aspx?file_no=b202105011&flag=1&journal_https://doaj.org/toc/1008-1542To solve the intractable multiple automatic guided vehicles (AGVs) scheduling problem encountered in the sorting processes of the logistics sorting centers,a large-scale AGV scheduling problem was studied on the basis of considering the sorting time windows and charging requirements.A general variable neighborhood search (GVNS) algorithm was proposed to minimize the makespan of the sorting operations,in which the assignment of transferring packages to AGVs and the sequence of sorting tasks for each AGV were determined.The traversal insertion heuristic was developed to generate the initial solution of the developed algorithm to ensure the constraint of time windows.Ten neighborhood operators were designed to optimize the initial solution for the iteration of the algorithm.Different sized test instances were compared,and the impacts of AGV charging rate and quantity configuration on sorting efficiency were analyzed.The results show that the GVNS algorithm is superior in computing time and solution performance.It can obtain the approximate optimal solution in a short time.The average computing time of GVNS is only [BF]532.78[BFQ] s，which is obviously better than the mixed integer and constraint programming models;when the number of packages is 100,the most suitable number of AGVs is 14.Therefore,GVNS can effectively solve the large-scale and multi-AGV scheduling problem with charging demand and hard time window,improve the efficiency of logistics sorting,and help enterprises find the scientific and reasonable AGV configuration scheme.[HQ]Chao GUOXiangling CHENPeng GUOQiang WANGHebei University of Science and Technologyarticlelogistics system management; sorting operation; automatic guided vehicle; scheduling; charging demand; vari-able neighborhood searchTechnologyTZHJournal of Hebei University of Science and Technology, Vol 42, Iss 5, Pp 523-534 (2021)
institution	DOAJ
collection	DOAJ
language	ZH
topic	logistics system management; sorting operation; automatic guided vehicle; scheduling; charging demand; vari-able neighborhood search Technology T
spellingShingle	logistics system management; sorting operation; automatic guided vehicle; scheduling; charging demand; vari-able neighborhood search Technology T Chao GUO Xiangling CHEN Peng GUO Qiang WANG General variable neighborhood search for the multi-AGV scheduling problem with sorting operations
description	To solve the intractable multiple automatic guided vehicles (AGVs) scheduling problem encountered in the sorting processes of the logistics sorting centers,a large-scale AGV scheduling problem was studied on the basis of considering the sorting time windows and charging requirements.A general variable neighborhood search (GVNS) algorithm was proposed to minimize the makespan of the sorting operations,in which the assignment of transferring packages to AGVs and the sequence of sorting tasks for each AGV were determined.The traversal insertion heuristic was developed to generate the initial solution of the developed algorithm to ensure the constraint of time windows.Ten neighborhood operators were designed to optimize the initial solution for the iteration of the algorithm.Different sized test instances were compared,and the impacts of AGV charging rate and quantity configuration on sorting efficiency were analyzed.The results show that the GVNS algorithm is superior in computing time and solution performance.It can obtain the approximate optimal solution in a short time.The average computing time of GVNS is only [BF]532.78[BFQ] s，which is obviously better than the mixed integer and constraint programming models;when the number of packages is 100,the most suitable number of AGVs is 14.Therefore,GVNS can effectively solve the large-scale and multi-AGV scheduling problem with charging demand and hard time window,improve the efficiency of logistics sorting,and help enterprises find the scientific and reasonable AGV configuration scheme.[HQ]
format	article
author	Chao GUO Xiangling CHEN Peng GUO Qiang WANG
author_facet	Chao GUO Xiangling CHEN Peng GUO Qiang WANG
author_sort	Chao GUO
title	General variable neighborhood search for the multi-AGV scheduling problem with sorting operations
title_short	General variable neighborhood search for the multi-AGV scheduling problem with sorting operations
title_full	General variable neighborhood search for the multi-AGV scheduling problem with sorting operations
title_fullStr	General variable neighborhood search for the multi-AGV scheduling problem with sorting operations
title_full_unstemmed	General variable neighborhood search for the multi-AGV scheduling problem with sorting operations
title_sort	general variable neighborhood search for the multi-agv scheduling problem with sorting operations
publisher	Hebei University of Science and Technology
publishDate	2021
url	https://doaj.org/article/8bc6370d2d5a4cd5b2709db2243c8276
work_keys_str_mv	AT chaoguo generalvariableneighborhoodsearchforthemultiagvschedulingproblemwithsortingoperations AT xianglingchen generalvariableneighborhoodsearchforthemultiagvschedulingproblemwithsortingoperations AT pengguo generalvariableneighborhoodsearchforthemultiagvschedulingproblemwithsortingoperations AT qiangwang generalvariableneighborhoodsearchforthemultiagvschedulingproblemwithsortingoperations
_version_	1718416839391838208

General variable neighborhood search for the multi-AGV scheduling problem with sorting operations

Ejemplares similares