DeepAI
Log In Sign Up

Learning Combined Set Covering and Traveling Salesman Problem

07/07/2020
by   Yuwen Yang, et al.
0

The Traveling Salesman Problem is one of the most intensively studied combinatorial optimization problems due both to its range of real-world applications and its computational complexity. When combined with the Set Covering Problem, it raises even more issues related to tractability and scalability. We study a combined Set Covering and Traveling Salesman problem and provide a mixed integer programming formulation to solve the problem. Motivated by applications where the optimal policy needs to be updated on a regular basis and repetitively solving this via MIP can be computationally expensive, we propose a machine learning approach to effectively deal with this problem by providing an opportunity to learn from historical optimal solutions that are derived from the MIP formulation. We also present a case study using the vaccine distribution chain of the World Health Organization, and provide numerical results with data derived from four countries in sub-Saharan Africa.

READ FULL TEXT
03/06/2022

A Survey for Solving Mixed Integer Programming via Machine Learning

This paper surveys the trend of leveraging machine learning to solve mix...
06/23/2019

Optimal Solution Predictions for Mixed Integer Programs

Mixed Integer Programming (MIP) is one of the most widely used modeling ...
02/20/2020

Contextual Reserve Price Optimization in Auctions

We study the problem of learning a linear model to set the reserve price...
02/01/2015

Chemical Reaction Optimization for the Set Covering Problem

The set covering problem (SCP) is one of the representative combinatoria...
07/25/2019

Optimizing vaccine distribution networks in low and middle-income countries

Vaccination has been proven to be the most effective method to prevent i...
08/27/2019

Outreach Strategies for Vaccine Distribution: A Two-Period Robust Approach

Vaccination has been proven to be the most effective method to prevent i...
10/08/2021

Polygon Area Decomposition Using a Compactness Metric

In this paper, we consider the problem of partitioning a polygon into a ...