期刊
IEEE ACCESS
卷 8, 期 -, 页码 178097-178107出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2020.3026933
关键词
Traveling salesman problems; Distribution networks; Industrial engineering; Transportation; Marine vehicles; Clustering algorithms; Approximation algorithms; Combinatorial optimization; health supply chain; generalized median tour
资金
- ANID/CONICYT/FONDECYT [11170102]
We introduce, formulate, and solve the Generalized Median Tour Problem, which is motivated in the health supplies distribution for urban and rural areas. A region comprises districts that must be served by a specialized vehicle visiting its health facilities. We propose a distribution strategy to serve these health facilities efficiently. A single tour is determined that visits a set of health facilities (nodes) composed of disjoint clusters. The tour must visit at least one facility within each cluster, and the unvisited facilities are assigned to the closest facility on the tour. We minimize the sum of the total tour distance and the access distance traveled by the unvisited facilities. Efficient formulations are proposed and several solution strategies are developed to avoid subtours based on branch & cut. We solve a set of test instances and a real-world instance to show the efficiency of our solution approaches.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据