An Approximate Algorithm for the Resource Constrained Grouping Problem Based on the Lagrangian Relaxation Method

スポンサーリンク

概要

• 論文の詳細を見る

• A problem to devide n objects into m(≥2) groups according to the similarity among the objects is called the homogeneous clustering problem, and the same problem with side resource constraints is called the resource constrained grouping problem. In this study, we propose an approximate algorithm of the latter problem using Lagrangian relaxation method. First, we formulate the problem as a 0-1 integer programming problem. Next, we explain how to get the lower bound, and propose an approximate algorithm of the problem, which can gradually reduce the difference between the upper bound and the lower bound. Finally, we verify the effectiveness of this approximate algorithm with some computational experiments by computer.

• 東海大学の論文

著者

• HADA Takao

  Department of Management Engineering

• Omura Kazuhiko

  Department Of Management Engineering School Of Engineering

関連論文

• An Algorithm for the Parameters Determination of a Dynamic Priority Discipline in a Central Server Model
• Approximate Solutions for Assembly Process Formation Problem in Aggregative Production System
• A Planning Method of Optical Fiber Cable Routing Based on Integer Programming(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)
• A Near-Optimal Solution for the Vehicle Routing Problem with Multiple Use of Vehicles(Production and Logistics)
• Approximate Algorithm For Group Technology Line Formation Problem(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)
• An Approximate Algorithm for the Resource Constrained Grouping Problem Based on the Lagrangian Relaxation Method

スポンサーリンク