Author, Subjects, Keywords

Cited Author

 

 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

A Simulated Annealing Approach for Uncapacitated Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost

Tolhah Abdullah, and Zaitul Marlizawati Zainuddin, and Sutinah Salim, (2008) A Simulated Annealing Approach for Uncapacitated Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost. Matematika, 24 (1). pp. 67-73. ISSN 01278274

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
183Kb

Official URL: http://www.fs.utm.my/matematika/images/stories/matematika/20082417.pdf

Affiliations

Universiti Teknologi Malaysia, Faculty of Science, Dept. of Mathematics
Universiti Teknologi Malaysia, Faculty of Science, Dept. of Mathematics
Universiti Teknologi Malaysia, Faculty of Science, Dept. of Mathematics

Abstract

Location analysis is concerned with locating one or more service facilities while fulfilling some constraints such as the demand of the customers and minimizing the total cost. Despite the cost of transporting goods or services, there is a fixed cost associated with opening a given facility such as the cost of the land, taxes or trunking (or hauling) cost to supply product, services and labour. This cost may vary from one area to another. The aim of this study is to put forward a Simulated Annealing (SA) procedure for solving the uncapacitated continuous location-allocation problem in the presence of a zone-dependent fixed cost. Simulated Annealing is one of the metaheuristic methods derived from the annealing process of a solid. Several parameters in SA will be tested such as initial starting points, initial temperature and cooling schedules. Data set for 50 customer problem taken from the literature is used. The problems of locating 2 to 15 facilities are solved by using C++. The computational results are presented with encouraging results.

Item Type:Journal
Keywords:Uncapacitated, location-alocation, zone-dependent, fixed cost, heuristics
Subjects:Q Science, Computer Science
ID Code:5461

[1] K.H. Hsieha & F.C. Tien, Self-organizing Feature Maps for Solving LocationAllocation Problems With Rectilinear Distances, Computers & Operations Research, 31(2004), 1017-1031.

[2] Y.S. Polyakov, Feedback Algorithm for Switch Location: Analysis of Complexity and Application to Network Design, PhD thesis, New Jersey Institute of Technology, Department of Computer Science, 2003.

[3] Z. Drezner, K. Klamroth, A. Schobel & G.O. Wesolowsky, The Weber Problem, In Z. Drezner and H.W. Hamacher, editors, Facility Location Applications and Theory, pages 1-36. Springer-Verlag Berlin Heidelberg, New York, 2002.

[4] J. Brimberg & S. Salhi, A Continuous Location-Allocation Problem with Zone Dependent Fixed Cost, Journal Annals OR, 136(2005) 99-115.

[5] M.L. Brandeau & S.L. Chiu, An Overview of Representative Problems in Location Research, Management Science, 35(1989), 645-674.

[6] J. Brimberg & N. Mladenovic, A Variable Neighbourhood Algorithm for Solving the Continuous Location Allocation Problem, Studies in Location Analysis, 10(1996), 110.

[7] J. Brimberg, P. Hansen, N. Mladenovic & E.D. Taillard, Improvement and Comparison of Heuristics for Solving The Uncapacitated Multisource Weber Problem, Operations Research, 48(3)(2000), 444-460.

[8] S. Eilon, C.D.T Watson-Gandy & N. Christo¯elds, Distribution Management: Mathematical Modelling and Practical Analysis, Charles Gri±n & Company Limited, Hafner, London, 1971.

Repository Staff Only: item control page