Show simple item record

dc.contributor.authorGo, Jungtae
dc.date.accessioned2016-04-05T19:33:03Z
dc.date.available2016-04-05T19:33:03Z
dc.date.issued2014
dc.identifier.isbn9781321262957
dc.identifier.other1625772058
dc.identifier.urihttp://hdl.handle.net/10477/50918
dc.description.abstractThe changes in the security environment such as reduced human resources, increasing need to operate the military in a more economical way and to satisfy civilian demands force the Korean Army to reorganize its structure and relocate its facilities to other places. In order to handle this problem the mathematical model and the heuristic solution method of the Relocating Military Installation Problem (RMIP) are introduced. The suggested model is a 4-level hierarchical location-routing problem describing the hierarchical relationship between units and responsibility of units for their combat positions. While considering these conditions and transportation costs, the RMIP determines the optimal locations of units, and routing strategies to supply foods, fuel, and parts of equipment. The heuristic problem solving method also has been developed for the RMIP since its complexity makes it hard to find the exact solution. The heuristic method decomposes the RMIP into location-allocation and its subsequent routing problems implemented based on tabu search to find the solution for the divisional level of unit and its subordinate units.
dc.languageEnglish
dc.sourceDissertations & Theses @ SUNY Buffalo,ProQuest Dissertations & Theses Global
dc.subjectSocial sciences
dc.subjectApplied sciences
dc.subjectMilitary installations
dc.subjectRelocation
dc.titleThe relocating military installations problem
dc.typeDissertation/Thesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record