Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

M. Hakan Akyüz, Kuban Altınel, Temel Öncan

Research output: Contribution to journalArticleAcademicpeer-review

13 Citations (Scopus)

Abstract

Given the locations of J customers, their demands and I capacitated facilities, the Capacitated Multi-facility Weber Problem (CMWP) is concerned with locating I facilities in the plane to satisfy the demand of J customers with the minimum total transportation cost which is proportional to the distance between them. We propose two types of branch and bound algorithms for the ℓr distance CMWP with 1≤r<∞. One of them is an allocation space based branch and bound algorithm for which a new branching variable selection strategy and new lower bounding procedures have been proposed. The other one is new and partitions the location space. Based on extensive computational experiments we can say that the proposed algorithms are promising and perform better than the existing ones.

Original languageEnglish
Pages (from-to)45-71
Number of pages27
JournalAnnals of Operations Research
Volume222
Issue number1
DOIs
Publication statusPublished - 31 Oct 2014
Externally publishedYes

Keywords

  • Branch and bound
  • Discrete approximation
  • Facility location–allocation
  • Transportation

Fingerprint Dive into the research topics of 'Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem'. Together they form a unique fingerprint.

Cite this