An ant colony optimization approach for the single machine total tardiness problem.pdfVIP

下载本文档

12
0
约2.6万字
约 13页
2017-04-06 发布于江苏
举报
版权申诉

An ant colony optimization approach for the single machine total tardiness problem.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

An ant colony optimization approach for the single machine total tardiness problem

An Ant Colony Optimization Approach for theSingle Machine Total Tardiness ProblemyAndreas BauerBernd BullnheimerzRichard F. HartlChristine StraussDepartment of Management ScienceUniversity of ViennaAbstractMachine scheduling is a central task in production planning. Ingeneral it means the problem of scheduling job operations on a givennumber of available machines. In this paper we consider a machinescheduling problem with one machine, the Single Machine Total Tardi-ness Problem. To solve this NP-hard problem, we apply the ant colonyoptimization metaphor, a recently developed meta-heuristic that hasproven its potential for various other combinatorial optimization prob-lems. We test our algorithmusing 125 benchmark problems and presentcomputational results.1 IntroductionAnt Colony Optimization (ACO) is a rather new meta-heuristic introducedin the early nineties (cf. [6, 7, 11, 15]) and has successfully been applied toseveral combinatorial optimization problems (cf. e.g. [4, 5, 8, 9, 16, 21, 25]).In this paper we apply ACO to the Single Machine Total Tardiness ProblemyWe would like to thank Herbert Dawid and Marco Dorigo for their contributionsto this research. Financial support from the Austrian Science Foundation under GrantF 01005 \Adaptive Information Systems and Modelling in Economics and ManagementScience is gratefully acknowledged.zCorresponding author: Bernd Bullnheimer, Department of Management Science, Uni-versity of Vienna, Brunner Strasse 72, A-1210 Vienna, Austria; fax: +43-1-29128-504;email: bernd.bullnheimer@univie.ac.at. 1 (SMTTP), a well-known NP-hard combinatorial optimization problem thathas been tackled by various optimization procedures (cf. [10, 19, 24, 27, 31,33]) and heuristic approaches (cf. [20, 23, 26, 28, 34]).The purpose of this study is twofold: we present another evidence of theversatility of ACO, and at the same time propose a meta-heuristic approachto solve the SMTTP that can compete with leading heuristics. We testeddierent heuristic