The Weber problem in logistic and services networks under congestion

IF 2.6 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Computational Optimization Pub Date : 2023-01-01 DOI:10.1016/j.ejco.2022.100056

Vanessa Lange , Hans Daduna

{"title":"The Weber problem in logistic and services networks under congestion","authors":"Vanessa Lange , Hans Daduna","doi":"10.1016/j.ejco.2022.100056","DOIUrl":null,"url":null,"abstract":"<div><p>We investigate a location-allocation-routing problem where trucks deliver goods from a central production facility to a set of warehouses with fixed locations and known demands. Due to limited capacities congestion occurs and results in queueing problems. The location of the center is determined to maximize the utilization of the given resources (measured in throughput) and the minimal number of trucks is determined to satisfy the overall demand generated by the warehouses. Main results for this integrated decision problem on strategic and tactical/operational level are: (i) The location decision is reduced to a standard Weber problem with weighted distances. (ii) The joint decision for location and fleet size is separable. (iii) The location of the center is robust against perturbations of several system parameters on the operational/tactical level. Additionally, we consider minimization of travel times as optimization target. By numerical examples we demonstrate the consequences of neglecting available information on long-term (rough) demand structure.</p></div>","PeriodicalId":51880,"journal":{"name":"EURO Journal on Computational Optimization","volume":"11 ","pages":"Article 100056"},"PeriodicalIF":2.6000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Computational Optimization","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192440622000326","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

Abstract

We investigate a location-allocation-routing problem where trucks deliver goods from a central production facility to a set of warehouses with fixed locations and known demands. Due to limited capacities congestion occurs and results in queueing problems. The location of the center is determined to maximize the utilization of the given resources (measured in throughput) and the minimal number of trucks is determined to satisfy the overall demand generated by the warehouses. Main results for this integrated decision problem on strategic and tactical/operational level are: (i) The location decision is reduced to a standard Weber problem with weighted distances. (ii) The joint decision for location and fleet size is separable. (iii) The location of the center is robust against perturbations of several system parameters on the operational/tactical level. Additionally, we consider minimization of travel times as optimization target. By numerical examples we demonstrate the consequences of neglecting available information on long-term (rough) demand structure.

查看原文本刊更多论文

拥挤条件下物流服务网络中的韦伯问题

我们研究了一个位置-分配-路线问题，其中卡车将货物从一个中央生产设施运送到一组具有固定位置和已知需求的仓库。由于容量有限，出现拥塞并导致排队问题。确定中心的位置以最大限度地利用给定资源(以吞吐量衡量)，并确定最小数量的卡车以满足仓库产生的总体需求。这个综合决策问题在战略和战术/作战层面上的主要结果是:(i)位置决策被简化为具有加权距离的标准韦伯问题。(ii)位置和船队规模的联合决策是可分离的。(iii)中心的位置对若干系统参数在作战/战术层面的扰动具有稳健性。此外，我们考虑了最小的行程时间作为优化目标。通过数值例子，我们证明了忽略长期(粗略)需求结构的可用信息的后果。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

EURO Journal on Computational Optimization OPERATIONS RESEARCH & MANAGEMENT SCIENCE-

CiteScore

3.50

自引率

0.00%

发文量

审稿时长

60 days

期刊介绍： The aim of this journal is to contribute to the many areas in which Operations Research and Computer Science are tightly connected with each other. More precisely, the common element in all contributions to this journal is the use of computers for the solution of optimization problems. Both methodological contributions and innovative applications are considered, but validation through convincing computational experiments is desirable. The journal publishes three types of articles (i) research articles, (ii) tutorials, and (iii) surveys. A research article presents original methodological contributions. A tutorial provides an introduction to an advanced topic designed to ease the use of the relevant methodology. A survey provides a wide overview of a given subject by summarizing and organizing research results.