移动机器人配送系统中的任务调度问题

2020 12th International Conference on Advanced Computational Intelligence (ICACI) Pub Date : 2020-08-01 DOI:10.1109/ICACI49185.2020.9177514

Wei Yuan, Hui Sun

{"title":"移动机器人配送系统中的任务调度问题","authors":"Wei Yuan, Hui Sun","doi":"10.1109/ICACI49185.2020.9177514","DOIUrl":null,"url":null,"abstract":"This paper studies a task scheduling problem in the context of the mobile robot fulfillment system (MRFS), a parts-to-picker storage system where mobile robots bring movable racks to workstations. It determines the assignment of tasks of transporting racks to a fleet of robots with the objective of makespan minimization. A mixed integer programming model is presented to describe the problem. Aimed at quickly finding good solutions to this NP-hard problem, two heuristic rules and an ant colony optimization algorithm are developed. Computational experiments are conducted to evaluate the performance of the proposed heuristic solution procedures. It shows that the ant colony optimization algorithm generally has the best performance.","PeriodicalId":137804,"journal":{"name":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Task Scheduling Problem in Mobile Robot Fulfillment Systems\",\"authors\":\"Wei Yuan, Hui Sun\",\"doi\":\"10.1109/ICACI49185.2020.9177514\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies a task scheduling problem in the context of the mobile robot fulfillment system (MRFS), a parts-to-picker storage system where mobile robots bring movable racks to workstations. It determines the assignment of tasks of transporting racks to a fleet of robots with the objective of makespan minimization. A mixed integer programming model is presented to describe the problem. Aimed at quickly finding good solutions to this NP-hard problem, two heuristic rules and an ant colony optimization algorithm are developed. Computational experiments are conducted to evaluate the performance of the proposed heuristic solution procedures. It shows that the ant colony optimization algorithm generally has the best performance.\",\"PeriodicalId\":137804,\"journal\":{\"name\":\"2020 12th International Conference on Advanced Computational Intelligence (ICACI)\",\"volume\":\"125 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 12th International Conference on Advanced Computational Intelligence (ICACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACI49185.2020.9177514\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACI49185.2020.9177514","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文研究了移动机器人履约系统(MRFS)中的任务调度问题，MRFS是一个由移动机器人将可移动的货架运送到工作站的从零件到拾取器的存储系统。它以最大完工时间最小化为目标，确定将货架运输任务分配给一组机器人。提出了一个混合整数规划模型来描述这一问题。为了快速求解这一NP-hard问题，提出了两个启发式规则和一种蚁群优化算法。进行了计算实验来评估所提出的启发式求解过程的性能。结果表明，蚁群优化算法一般具有最好的性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Task Scheduling Problem in Mobile Robot Fulfillment Systems

This paper studies a task scheduling problem in the context of the mobile robot fulfillment system (MRFS), a parts-to-picker storage system where mobile robots bring movable racks to workstations. It determines the assignment of tasks of transporting racks to a fleet of robots with the objective of makespan minimization. A mixed integer programming model is presented to describe the problem. Aimed at quickly finding good solutions to this NP-hard problem, two heuristic rules and an ant colony optimization algorithm are developed. Computational experiments are conducted to evaluate the performance of the proposed heuristic solution procedures. It shows that the ant colony optimization algorithm generally has the best performance.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2020 12th International Conference on Advanced Computational Intelligence (ICACI)

自引率

0.00%

发文量