基于基因搜索的团队调度

Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296) Pub Date : 1999-07-10 DOI:10.1109/IPMM.1999.791495

Tiehua Zhang, William A. GruveP, Michael H. Smith

{"title":"基于基因搜索的团队调度","authors":"Tiehua Zhang, William A. GruveP, Michael H. Smith","doi":"10.1109/IPMM.1999.791495","DOIUrl":null,"url":null,"abstract":"We consider a photographic studio that must schedule multiple teams of photographers to a large number of elementary and secondary schools. The photographers' schedules are to be optimized so that time constraints are satisfied and each team is able to at least visit two schools daily. A multiple travelling salesman model is used where the total distance traveled and time consumed can be evaluated in a single cost function to achieve overall optimality. A genetic algorithm has been applied to solve the problem. The results show that this approach rapidly provides an effective means for solving the problem.","PeriodicalId":194215,"journal":{"name":"Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"53","resultStr":"{\"title\":\"Team scheduling by genetic search\",\"authors\":\"Tiehua Zhang, William A. GruveP, Michael H. Smith\",\"doi\":\"10.1109/IPMM.1999.791495\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a photographic studio that must schedule multiple teams of photographers to a large number of elementary and secondary schools. The photographers' schedules are to be optimized so that time constraints are satisfied and each team is able to at least visit two schools daily. A multiple travelling salesman model is used where the total distance traveled and time consumed can be evaluated in a single cost function to achieve overall optimality. A genetic algorithm has been applied to solve the problem. The results show that this approach rapidly provides an effective means for solving the problem.\",\"PeriodicalId\":194215,\"journal\":{\"name\":\"Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"53\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPMM.1999.791495\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPMM.1999.791495","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 53

摘要

我们考虑一个摄影工作室，必须安排多个团队的摄影师到大量的小学和中学。摄影师的日程安排将得到优化，以满足时间限制，每个团队每天至少可以访问两所学校。采用多旅行推销员模型，用单个成本函数对总行程和总耗时进行评估，以达到整体最优。采用遗传算法求解该问题。结果表明，该方法为快速解决该问题提供了一种有效的手段。

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

查看原文本刊更多论文

Team scheduling by genetic search

We consider a photographic studio that must schedule multiple teams of photographers to a large number of elementary and secondary schools. The photographers' schedules are to be optimized so that time constraints are satisfied and each team is able to at least visit two schools daily. A multiple travelling salesman model is used where the total distance traveled and time consumed can be evaluated in a single cost function to achieve overall optimality. A genetic algorithm has been applied to solve the problem. The results show that this approach rapidly provides an effective means for solving the problem.

求助全文

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

来源期刊

Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296)

自引率

0.00%

发文量