A heuristic method to solve the location and machine selection problem in a two-dimensional continuous area Online publication date: Wed, 01-Jun-2016
by Kamran Azimi; Maghsud Solimanpur
International Journal of Mathematics in Operational Research (IJMOR), Vol. 8, No. 4, 2016
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook