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

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

JSON

{
  "conceptrecid": "87752", 
  "created": "2021-03-16T07:14:01.435553+00:00", 
  "doi": "10.1016/j.cor.2011.03.015", 
  "files": [
    {
      "bucket": "9f54af86-5345-470e-8b1b-c7017a3e99a2", 
      "checksum": "md5:f70a02e7f5669fed604f3c6f2c98896a", 
      "key": "bib-4d10f492-0718-41c7-a95e-6667c4fbf3e8.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/9f54af86-5345-470e-8b1b-c7017a3e99a2/bib-4d10f492-0718-41c7-a95e-6667c4fbf3e8.txt"
      }, 
      "size": 196, 
      "type": "txt"
    }
  ], 
  "id": 87753, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.1016/j.cor.2011.03.015.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/9f54af86-5345-470e-8b1b-c7017a3e99a2", 
    "doi": "https://doi.org/10.1016/j.cor.2011.03.015", 
    "html": "https://aperta.ulakbim.gov.tr/record/87753", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/87753", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/87753"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "Galatasaray Univ Ortakoy, Dept Ind Engn, TR-34357 Istanbul, Turkey", 
        "name": "Akyuz, M. Hakan"
      }, 
      {
        "affiliation": "Galatasaray Univ Ortakoy, Dept Ind Engn, TR-34357 Istanbul, Turkey", 
        "name": "Oncan, Temel"
      }, 
      {
        "affiliation": "Bogazici Univ Bebek, Dept Ind Engn, TR-34342 Istanbul, Turkey", 
        "name": "Altinel, I. Kuban"
      }
    ], 
    "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.", 
    "doi": "10.1016/j.cor.2011.03.015", 
    "has_grant": false, 
    "journal": {
      "issue": "2", 
      "pages": "225-237", 
      "title": "COMPUTERS & OPERATIONS RESEARCH", 
      "volume": "39"
    }, 
    "license": {
      "id": "cc-by"
    }, 
    "publication_date": "2012-01-01", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "87753"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "87752"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "article", 
      "title": "Dergi makalesi", 
      "type": "publication"
    }, 
    "title": "Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 3.0, 
    "unique_downloads": 3.0, 
    "unique_views": 8.0, 
    "version_downloads": 3.0, 
    "version_unique_downloads": 3.0, 
    "version_unique_views": 8.0, 
    "version_views": 8.0, 
    "version_volume": 588.0, 
    "views": 8.0, 
    "volume": 588.0
  }, 
  "updated": "2021-03-16T07:14:01.489503+00:00"
}