SOLUTION PROCEDURES FOR THE RECTILINEAR DISTANCE SINGLE SOURCE CAPACITATED MULTI-FACILITY WEBER PROBLEM

 

Temel Öncan, M. Hakan Akyüz, Ġ. Kuban Altinel, M. Emre Demġrcġoğlu

 

Abstract

 

In this work we consider the Single Source Capacitated Multi-facility Weber Problem (SSCMWP) which deals with locating I capacitated facilities in the plane in order to satisfy the demands of J customers for a single commodity type so that each customer satisfies all its demand from a single facility and the total transportation cost is minimized. We address the rectilinear case of the SSCMWP. We propose a Lagrangean relaxation scheme. Lower and upper bound values are obtained by employing a sub-gradient optimization algorithm. Furthermore an alternate location allocation heuristic is also suggested. The proposed solution procedures are tested on random test instances.

 

Lecture Notes in Management Science (2011) Vol. 3: 91-106

3rd International Conference on Applied Operational Research, Proceedings

© Tadbir Operational Research Group Ltd. All rights reserved.

www.tadbir.ca

 

ISSN 2008-0050 (Print)

ISSN 1927-0097 (Online)

 

ARTICLE OUTLINE

 

·         Introduction

·         A Lagrangean Relaxation Scheme For The SSCMWP

·         Alternate Location Allocation Heuristic For The SSCMWP

·         A VLSN Search Algorithm For The SSTP

·         Computational Results

·         Conclusion And Future Research

·         Acknowledgement

·         References

 

Full Text PDF