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

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

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/87753</identifier>
  <creators>
    <creator>
      <creatorName>Akyuz, M. Hakan</creatorName>
      <givenName>M. Hakan</givenName>
      <familyName>Akyuz</familyName>
      <affiliation>Galatasaray Univ Ortakoy, Dept Ind Engn, TR-34357 Istanbul, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Oncan, Temel</creatorName>
      <givenName>Temel</givenName>
      <familyName>Oncan</familyName>
      <affiliation>Galatasaray Univ Ortakoy, Dept Ind Engn, TR-34357 Istanbul, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Altinel, I. Kuban</creatorName>
      <givenName>I. Kuban</givenName>
      <familyName>Altinel</familyName>
      <affiliation>Bogazici Univ Bebek, Dept Ind Engn, TR-34342 Istanbul, Turkey</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Efficient Approximate Solution Methods For The Multi-Commodity Capacitated Multi-Facility Weber Problem</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2012</publicationYear>
  <dates>
    <date dateType="Issued">2012-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/87753</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1016/j.cor.2011.03.015</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="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.</description>
  </descriptions>
</resource>