Stochastic Facility Layout Problem with Search Range Grouping for AGV Delivery Demand(<Special English Issue>Industrial Management)

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, new solution expression and search range grouping rules are proposed for the Stochastic Facility Layout Problem (SFLP). The solution expression is the expansion of the space partitioning method. The new search range grouping rule suppresses long distance delivery as much as possible by limiting the range where AGV searches for delivery request. The objective function of the SFLP is the minimization of average lead time. The throughput is treated as one of the constraints. The average lead time and throughput is calculated by simulation for each solution during the simulated annealing based optimization process. The results of computational experiments show the effectiveness of the proposed algorithm.

• 社団法人日本経営工学会の論文
• 2009-02-15

著者

• IROHARA Takashi

  Sophia University

• YAMASHITA Hideaki

  Tokyo Metroporitan University

• Yamashita Hideaki

  Tokyo Metropolitan University

関連論文

• Facility Layout Problem with Buffer Space Allocation for Throughput and Material Handling Cost
• Stochastic Facility Layout Problem with Search Range Grouping for AGV Delivery Demand(Industrial Management)

スポンサーリンク