Dergi makalesi Açık Erişim

Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem

Akyuz, M. Hakan; Oncan, Temel; Altinel, I. Kuban


JSON-LD (schema.org)

{
  "@context": "https://schema.org/", 
  "@id": 87753, 
  "@type": "ScholarlyArticle", 
  "creator": [
    {
      "@type": "Person", 
      "affiliation": "Galatasaray Univ Ortakoy, Dept Ind Engn, TR-34357 Istanbul, Turkey", 
      "name": "Akyuz, M. Hakan"
    }, 
    {
      "@type": "Person", 
      "affiliation": "Galatasaray Univ Ortakoy, Dept Ind Engn, TR-34357 Istanbul, Turkey", 
      "name": "Oncan, Temel"
    }, 
    {
      "@type": "Person", 
      "affiliation": "Bogazici Univ Bebek, Dept Ind Engn, TR-34342 Istanbul, Turkey", 
      "name": "Altinel, I. Kuban"
    }
  ], 
  "datePublished": "2012-01-01", 
  "description": "The capacitated multi-facility Weber problem is concerned with locating 1 capacitated facilities in the plane to satisfy the demand of J customers with the minimum total transportation cost of a single commodity. This is a nonconvex optimization problem and difficult to solve. In this work, we focus on a multi-commodity extension and consider the situation where K distinct commodities are shipped subject to capacity constraints between each customer and facility pair. Customer locations, demands and capacities for each commodity, and bundle restrictions are known a priori. The transportation costs, which are proportional to the distance between customers and facilities, depend on the commodity type. We address several location-allocation and discrete approximation heuristics using different strategies. Based on the obtained computational results we can say that the alternate solution of location and allocation problems is a very efficient strategy; but the discrete approximation has excellent accuracy. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.", 
  "headline": "Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem", 
  "identifier": 87753, 
  "image": "https://aperta.ulakbim.gov.tr/static/img/logo/aperta_logo_with_icon.svg", 
  "license": "http://www.opendefinition.org/licenses/cc-by", 
  "name": "Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem", 
  "url": "https://aperta.ulakbim.gov.tr/record/87753"
}
8
3
görüntülenme
indirilme
Görüntülenme 8
İndirme 3
Veri hacmi 588 Bytes
Tekil görüntülenme 8
Tekil indirme 3

Alıntı yap