 A heuristic method to solve the location and machine selection problem in a two-dimensional continuous areaKamran Azimi and Maghsud Solimanpur International Journal of Mathematics in Operational Research, 2016, vol. 8, issue 4, 424-448 Abstract: In this paper, a heuristic method is developed to solve the location and machine selection problem in a two-dimensional continuous area. In this method, a two-step algorithm is proposed in which the choosing sequence of the machines is determined in the first step and machines are located in the second step. Initially, the problem is formulated as a nonlinear mixed integer programming (MIP) model. This model is then modified to determine the location of machines step by step. Some small, medium and large-sized problems are designed and solved by both branch-and-bound (B%B) and the proposed method to verify the efficiency and effectiveness of the proposed method and the results obtained are compared. Computational results show that the proposed method can provide high quality solutions in a very reasonable time in comparison to B%B method, particularly in the case of medium-to-large sized problems. Keywords: facilities planning; layout design; location selection; machine selection; mathematical programming; continuous layout; machine sequencing; nonlinear MIP; mixed integer programming; NMIP; branch-and-bound. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:8:y:2016:i:4:p:424-448 Access Statistics for this article More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.