自动化立体仓库中的拣选路径：解决在线非对称的tsp问题---外文翻译.doc
约30页DOC格式手机打开展开
自动化立体仓库中的拣选路径：解决在线非对称的tsp问题---外文翻译,abstractwe report on a joint project with industry that had the aim to sequence transportation requests within an automatic storage system in such a way that th...
内容介绍
此文档由会员 wanli1988go 发布
Abstract
We report on a joint project with industry that had the aim to sequence transportation requests within an automatic storage system in such a way that the overall travel time is minimized. The manufacturing environment is such that scheduling decisions have to be made before all jobs are known. We have modeled this task as an online Asymmetric Traveling Salesman Problem (ATSP). Several heuristics for the online ATSP are compared computationally within a simulation environment to judge which should be used in practice. Compared to the priority rule used so far, the optimization package reduced the unloaded travel time by about 40 %. Because of these significant savings our procedure was implemented as part of the control software for the stacker cranes of the storage systems
Keywords : Traveling Salesman Problem, Online-Algorithm, Automatic Storage System
1 Introduction
摘 要
我们和企业提出了一个联合项目，旨在通过最短的时间用自动化存储系统将运输请求按顺序排列。其生产工作环境是在所有工作确定前要安排决定。我们将这种任务称为在线非对称旅行商问题（ATSP）。在一个模拟环境里，一些针对在线ATSP问题的启发式方法被通过计算比较来判定什么方法将在实践中被采用。比较到目前为止所采用的主要规则，包裹优化减少了无载货运输时间的40%。由于这重要的节省，我们的程序被作为存储系统中堆垛起重机控制软件的一部分执行。
关键词：TSP问题，在线算法，自动化存储系统
We report on a joint project with industry that had the aim to sequence transportation requests within an automatic storage system in such a way that the overall travel time is minimized. The manufacturing environment is such that scheduling decisions have to be made before all jobs are known. We have modeled this task as an online Asymmetric Traveling Salesman Problem (ATSP). Several heuristics for the online ATSP are compared computationally within a simulation environment to judge which should be used in practice. Compared to the priority rule used so far, the optimization package reduced the unloaded travel time by about 40 %. Because of these significant savings our procedure was implemented as part of the control software for the stacker cranes of the storage systems
Keywords : Traveling Salesman Problem, Online-Algorithm, Automatic Storage System
1 Introduction
摘 要
我们和企业提出了一个联合项目，旨在通过最短的时间用自动化存储系统将运输请求按顺序排列。其生产工作环境是在所有工作确定前要安排决定。我们将这种任务称为在线非对称旅行商问题（ATSP）。在一个模拟环境里，一些针对在线ATSP问题的启发式方法被通过计算比较来判定什么方法将在实践中被采用。比较到目前为止所采用的主要规则，包裹优化减少了无载货运输时间的40%。由于这重要的节省，我们的程序被作为存储系统中堆垛起重机控制软件的一部分执行。
关键词：TSP问题，在线算法，自动化存储系统
