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

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

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="p">COMPUTERS &amp; OPERATIONS RESEARCH</subfield>
    <subfield code="v">39</subfield>
    <subfield code="n">2</subfield>
    <subfield code="c">225-237</subfield>
  </datafield>
  <controlfield tag="001">87753</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">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.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="2">opendefinition.org</subfield>
    <subfield code="a">cc-by</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Galatasaray Univ Ortakoy, Dept Ind Engn, TR-34357 Istanbul, Turkey</subfield>
    <subfield code="a">Oncan, Temel</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Bogazici Univ Bebek, Dept Ind Engn, TR-34342 Istanbul, Turkey</subfield>
    <subfield code="a">Altinel, I. Kuban</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="b">article</subfield>
    <subfield code="a">publication</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Galatasaray Univ Ortakoy, Dept Ind Engn, TR-34357 Istanbul, Turkey</subfield>
    <subfield code="a">Akyuz, M. Hakan</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2012-01-01</subfield>
  </datafield>
  <controlfield tag="005">20210316071401.0</controlfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:zenodo.org:87753</subfield>
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:f70a02e7f5669fed604f3c6f2c98896a</subfield>
    <subfield code="s">196</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/87753/files/bib-4d10f492-0718-41c7-a95e-6667c4fbf3e8.txt</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
    <subfield code="a">Creative Commons Attribution</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1016/j.cor.2011.03.015</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
</record>