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

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

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Akyuz, M. Hakan</dc:creator>
  <dc:creator>Oncan, Temel</dc:creator>
  <dc:creator>Altinel, I. Kuban</dc:creator>
  <dc:date>2012-01-01</dc:date>
  <dc: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.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/87753</dc:identifier>
  <dc:identifier>oai:zenodo.org:87753</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>COMPUTERS &amp; OPERATIONS RESEARCH 39(2) 225-237</dc:source>
  <dc:title>Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>