In this paper we applicate the Hungarian algorithm for assignment problem to solve traveling salesman problem. Tree examples of application of algorithm are included.
Firstly an overview of the potential impact on work-in-process （WIP） and lead time is provided when transfer lot sizes are undifferentiated from processing lot sizes. Simple performance examples are compared to thos...Firstly an overview of the potential impact on work-in-process （WIP） and lead time is provided when transfer lot sizes are undifferentiated from processing lot sizes. Simple performance examples are compared to those from a shop with one-piece transfer lots. Next, a mathematical programming model for minimizing lead time in the mixed-model job shop is presented, in which one-piece transfer lots are used. Key factors affecting lead time are found by analyzing the sum of the longest setup time of individual items among the shared processes （SLST） and the longest processing time of individual items among processes （LPT）. And lead time can be minimized by cutting down the SLST and LPT. Reduction of the SLST is described as a traveling salesman problem （TSP）, and the minimum of the SLST is solved through job shop scheduling. Removing the bottleneck and leveling the production line optimize the LPT. If the number of items produced is small, the routings are relatively short, and items and facilities are changed infrequently, the optimal schedule will remain valid. Finally a brief example serves to illustrate the method.展开更多
针对迭代局部搜索(iterated local search,ILS)算法求解旅游线路时间花费较长的问题,提出了一种ILS结合布谷鸟搜索(cuckoo search,CS)的优化算法,来优化旅游线路的时间花费。该算法首先根据相关目标和约束采用ILS算法求解旅游景点及初...针对迭代局部搜索(iterated local search,ILS)算法求解旅游线路时间花费较长的问题,提出了一种ILS结合布谷鸟搜索(cuckoo search,CS)的优化算法,来优化旅游线路的时间花费。该算法首先根据相关目标和约束采用ILS算法求解旅游景点及初始旅游线路,然后在满足旅游景点时间窗约束及景点总数不变的情况下采用CS算法进一步最小化旅游线路的时间花费。该研究获得的线路更符合旅游习惯,并且旅游时间花费更少。通过Daminaos数据集和桂林景点数据集进行验证,结果表明该优化算法相比于仅使用ILS算法所规划出的旅游线路,平均时间花费减少8%,更符合用户旅游选择习惯。展开更多
文摘In this paper we applicate the Hungarian algorithm for assignment problem to solve traveling salesman problem. Tree examples of application of algorithm are included.
基金This project is supported by National Natural Science Foundation of China (No.70372062, No.70572044)Program for New Century Excellent Talents in University of China (No.NCET-04-0240).
文摘Firstly an overview of the potential impact on work-in-process （WIP） and lead time is provided when transfer lot sizes are undifferentiated from processing lot sizes. Simple performance examples are compared to those from a shop with one-piece transfer lots. Next, a mathematical programming model for minimizing lead time in the mixed-model job shop is presented, in which one-piece transfer lots are used. Key factors affecting lead time are found by analyzing the sum of the longest setup time of individual items among the shared processes （SLST） and the longest processing time of individual items among processes （LPT）. And lead time can be minimized by cutting down the SLST and LPT. Reduction of the SLST is described as a traveling salesman problem （TSP）, and the minimum of the SLST is solved through job shop scheduling. Removing the bottleneck and leveling the production line optimize the LPT. If the number of items produced is small, the routings are relatively short, and items and facilities are changed infrequently, the optimal schedule will remain valid. Finally a brief example serves to illustrate the method.
文摘针对迭代局部搜索(iterated local search,ILS)算法求解旅游线路时间花费较长的问题,提出了一种ILS结合布谷鸟搜索(cuckoo search,CS)的优化算法,来优化旅游线路的时间花费。该算法首先根据相关目标和约束采用ILS算法求解旅游景点及初始旅游线路,然后在满足旅游景点时间窗约束及景点总数不变的情况下采用CS算法进一步最小化旅游线路的时间花费。该研究获得的线路更符合旅游习惯,并且旅游时间花费更少。通过Daminaos数据集和桂林景点数据集进行验证,结果表明该优化算法相比于仅使用ILS算法所规划出的旅游线路,平均时间花费减少8%,更符合用户旅游选择习惯。
