3 papers
math.OC2016
Clustering with Capacity and Size Constraints: A Deterministic Approach
Mayank Baranwal, Srinivasa M. Salapaka
This paper discusses a deterministic clustering approach to capacitated resource allocation problems. In particular, the Deterministic Annealing (DA) algorithm from the data-compre…
math.OC2016
A Deterministic Annealing Approach to the Multiple Traveling Salesmen and Related Problems
Mayank Baranwal, Brian Roehl, Srinivasa M. Salapaka
This paper presents a novel and efficient heuristic framework for approximating the solutions to the multiple traveling salesmen problem (m-TSP) and other variants on the TSP. The…
math.OC2016
Vehicle Routing Problem with Time Windows: A Deterministic Annealing approach
Mayank Baranwal, Pratik M. Parekh, Lavanya Marla +2
The Vehicle Routing Problem with Time-Windows (VRPTW) is an important problem in allocating resources on networks in time and space. We present in this paper a Deterministic Anneal…