网络上供应连接位置分配问题的分枝定界算法

Location Science Pub Date : 1998-05-01 DOI:10.1016/S0966-8349(98)00060-6

Gülcan N. Yeşilkökçen, George O. Wesolowsky

{"title":"网络上供应连接位置分配问题的分枝定界算法","authors":"Gülcan N. Yeşilkökçen, George O. Wesolowsky","doi":"10.1016/S0966-8349(98)00060-6","DOIUrl":null,"url":null,"abstract":"<div><p>The Supply Connected Location-Allocation Problem (SCLAP) involves locating <em>p</em> facilities with respect to <em>n</em> demand points and a supply plant. The supply plant produces all material and ships it in bulk to facilities along a route to be determined. Facilities then distribute the material to demand points. In this paper, we formulate SCLAP on networks and develop a single assignment branch-and-bound algorithm to solve the problem. We also present discussions on computational results.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 395-415"},"PeriodicalIF":0.0000,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)00060-6","citationCount":"4","resultStr":"{\"title\":\"A branch-and-bound algorithm for the supply connected location-allocation problem on networks\",\"authors\":\"Gülcan N. Yeşilkökçen, George O. Wesolowsky\",\"doi\":\"10.1016/S0966-8349(98)00060-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The Supply Connected Location-Allocation Problem (SCLAP) involves locating <em>p</em> facilities with respect to <em>n</em> demand points and a supply plant. The supply plant produces all material and ships it in bulk to facilities along a route to be determined. Facilities then distribute the material to demand points. In this paper, we formulate SCLAP on networks and develop a single assignment branch-and-bound algorithm to solve the problem. We also present discussions on computational results.</p></div>\",\"PeriodicalId\":100880,\"journal\":{\"name\":\"Location Science\",\"volume\":\"6 1\",\"pages\":\"Pages 395-415\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0966-8349(98)00060-6\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Location Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0966834998000606\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Location Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0966834998000606","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

供应连接位置分配问题（SCLAP）涉及相对于n个需求点和一个供应工厂定位p个设施。供应厂生产所有材料，并将其散装运送至待确定路线上的设施。然后，工厂将材料分发到需求点。在本文中，我们在网络上建立了SCLAP，并开发了一个单指派分支定界算法来解决这个问题。我们还讨论了计算结果。

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

查看原文本刊更多论文

A branch-and-bound algorithm for the supply connected location-allocation problem on networks

The Supply Connected Location-Allocation Problem (SCLAP) involves locating p facilities with respect to n demand points and a supply plant. The supply plant produces all material and ships it in bulk to facilities along a route to be determined. Facilities then distribute the material to demand points. In this paper, we formulate SCLAP on networks and develop a single assignment branch-and-bound algorithm to solve the problem. We also present discussions on computational results.

求助全文

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

来源期刊

Location Science

自引率

0.00%

发文量