Solver - How to find the lowest possible combinations within a MAX sum limit

I hope to a good job explaining my issue.

I have 18 different shipping destinations. All shipments will be done in pairs from a drop/point, shipping to location at a time. The total mileage for the pair cannot exceed 300 miles from the drop point. This is obviously a watered down version. In real life I might be dealing with 100 possible destinations.

Example:
Drop Point: Fort Erie, ON

Destinations
Rochester, NY - 82 Miles
Blasell, NY - 14 Miles
Ballston Spa, NY - 284 Miles
Phoenix, NY - 161 Miles

In this example we can't pair Ballston Spa with Rochester because the sum of 366 miles exceeds the 300 mile limit. How can I use solver or formulas to find all the possible paired combinations, trying to keep the sums as low as possible?

I've attached an example spreadsheet.

Thanks!