Search Results for author: Ishaan Mehta

Found 2 papers, 0 papers with code

Pareto Frontier Approximation Network (PA-Net) to Solve Bi-objective TSP

no code implementations2 Mar 2022 Ishaan Mehta, Sharareh Taghipour, Sajad Saeedi

The travelling salesperson problem (TSP) is a classic resource allocation problem used to find an optimal order of doing a set of tasks while minimizing (or maximizing) an associated objective function.

Reinforcement Learning (RL) Scheduling

Pareto Frontier Approximation Network (PA-Net) Applied to Multi-objective TSP

no code implementations29 Sep 2021 Ishaan Mehta, Sajad Saeedi

In this work, we present PA-Net, a network that generates good approximations of the Pareto front for the multi-objective optimization problems.

Cannot find the paper you are looking for? You can Submit a new open access paper.