.png){kind=icon}
.png){kind=icon}
Return
The Generalized Median Tour Problem: Modeling, Solving and an Application
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3026933.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Traveling salesman problems
Distribution networks
Industrial engineering
Transportation
Marine vehicles
Clustering algorithms
Approximation algorithms
Combinatorial optimization
health supply chain
generalized median tour
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
View more organizations