Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 최경현 | - |
dc.date.accessioned | 2018-02-07T07:54:33Z | - |
dc.date.available | 2018-02-07T07:54:33Z | - |
dc.date.issued | 2011-06 | - |
dc.identifier.citation | 대한산업공학회지, 2011, 37(2), P.124-131(8) | en_US |
dc.identifier.issn | 1225-0988 | - |
dc.identifier.issn | 2234-6457 | - |
dc.identifier.uri | http://koreascience.or.kr/article/ArticleFullRecord.jsp?cn=SGHHB1_2011_v37n2_124 | - |
dc.description.abstract | In this research report, we propose a heuristic algorithm with some primal recovery strategies for capacitated facility location problems (CFLP), which is a well-known combinatorial optimization problem with applications in distribution, transportation and production planning. Many algorithms employ the branch-and-bound technique in order to solve the CFLP. There are also some different approaches which can recover primal solutions while exploiting the primal and dual structure simultaneously. One of them is a MVCD (Mean Value Cross Decomposition) ensuring convergence without solving a master problem. The MVCD was designed to handle LP-problems, but it was applied in mixed integer problems. However the MVCD has been applied to only uncapacitated facility location problems (UFLP), because it was very difficult to obtain 'Integrality' property of Lagrangian dual subproblems sustaining the feasibility to primal problems. We present some heuristic strategies to recover primal feasible integer solutions, handling the accumulated primal solutions of the dual subproblem, which are used as input to the primal subproblem in the mean value cross decomposition technique, without requiring solutions to a master problem. Computational results for a set of various problem instances are reported. | - |
dc.language.iso | ko_KR | en_US |
dc.publisher | 대한산업공학회 | en_US |
dc.subject | Capacitated Facility Location Problem | en_US |
dc.subject | Cross Decomposition | en_US |
dc.subject | Mean Value Cross Decomposition | en_US |
dc.subject | rimal Recovery Strategies | en_US |
dc.subject | Lagrangian Relaxation | en_US |
dc.subject | Heuristics | en_US |
dc.title | 제한용량이 있는 설비입지결정 문제에 대한 적응형 평균치교차분할 알고리즘 | en_US |
dc.title.alternative | Adaptive Mean Value Cross Decomposition Algorithms for Capacitated Facility Location Problems | en_US |
dc.type | Article | en_US |
dc.relation.no | 2 | - |
dc.relation.volume | 37 | - |
dc.identifier.doi | 10.7232/JKIIE.2011.37.2.124 | - |
dc.relation.page | 124-131 | - |
dc.relation.journal | 대한산업공학회지 | - |
dc.contributor.googleauthor | 김철연 | - |
dc.contributor.googleauthor | 최경현 | - |
dc.contributor.googleauthor | Kim, Chul-Yeon | - |
dc.contributor.googleauthor | Choi, Gyung-Hyun | - |
dc.relation.code | 2012100333 | - |
dc.sector.campus | S | - |
dc.sector.daehak | GRADUATE SCHOOL OF TECHNOLOGY & INNOVATION MANAGEMENT[S] | - |
dc.sector.department | DEPARTMENT OF TECHNOLOGY MANAGEMENT | - |
dc.identifier.pid | ghchoi | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.