1 Ocak 2012 Dergi makalesi Açık Erişim

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

Citation Style Language JSON

{
  "DOI": "10.1016/j.cor.2011.03.015", 
  "abstract": "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.", 
  "author": [
    {
      "family": "Akyuz", 
      "given": " M. Hakan"
    }, 
    {
      "family": "Oncan", 
      "given": " Temel"
    }, 
    {
      "family": "Altinel", 
      "given": " I. Kuban"
    }
  ], 
  "container_title": "COMPUTERS & OPERATIONS RESEARCH", 
  "id": "87753", 
  "issue": "2", 
  "issued": {
    "date-parts": [
      [
        2012, 
        1, 
        1
      ]
    ]
  }, 
  "page": "225-237", 
  "title": "Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem", 
  "type": "article-journal", 
  "volume": "39"
}