考虑配送问题的仓库选址问题

Journal of Research in Mathematics Trends and Technology Pub Date : 2019-02-07 DOI:10.32734/JORMTT.V1I1.753

Henny Sartika, M. Gamal

{"title":"考虑配送问题的仓库选址问题","authors":"Henny Sartika, M. Gamal","doi":"10.32734/JORMTT.V1I1.753","DOIUrl":null,"url":null,"abstract":"In this paper we study the problem of locating m depots to serve n customers in order to minimize the total transportation cost. The way the depots serve the customers is considered as a traveling salesperson problem. We combine the location and the traveling salesperson problem methods to find the near-optimal or the best depot locations. An illustrative example is presented to implement the proposed method.","PeriodicalId":372795,"journal":{"name":"Journal of Research in Mathematics Trends and Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Depot Location Problems By Considering Its Distribution Problems\",\"authors\":\"Henny Sartika, M. Gamal\",\"doi\":\"10.32734/JORMTT.V1I1.753\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we study the problem of locating m depots to serve n customers in order to minimize the total transportation cost. The way the depots serve the customers is considered as a traveling salesperson problem. We combine the location and the traveling salesperson problem methods to find the near-optimal or the best depot locations. An illustrative example is presented to implement the proposed method.\",\"PeriodicalId\":372795,\"journal\":{\"name\":\"Journal of Research in Mathematics Trends and Technology\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Research in Mathematics Trends and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.32734/JORMTT.V1I1.753\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Research in Mathematics Trends and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32734/JORMTT.V1I1.753","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文研究了以总运输成本最小为目标，为n个客户定位m个仓库的问题。仓库为顾客服务的方式被认为是一个流动的销售人员问题。我们将选址问题和旅行销售问题相结合，找到接近最优或最佳的仓库选址。给出了一个示例来实现所提出的方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Depot Location Problems By Considering Its Distribution Problems

In this paper we study the problem of locating m depots to serve n customers in order to minimize the total transportation cost. The way the depots serve the customers is considered as a traveling salesperson problem. We combine the location and the traveling salesperson problem methods to find the near-optimal or the best depot locations. An illustrative example is presented to implement the proposed method.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Research in Mathematics Trends and Technology

自引率

0.00%

发文量