Optimizing a Parking Lot Problem. Is this problem NP-Complete?
The other day I was trying to park in a parking lot and noticed that parking lot could have been designed better.

That got me thinking of trying to figure out an algorithm to organize a parking lot in the most efficient manner (as many cars as possible).

However I immediately started to think that the problem must be NP-Complete as it reminded me of the Knapsack problem. 

**Has anyone tackled this problem with a Machine Learning algorithm (I couldn't google it) ? Or there some heuristic out there I am missing?**

With energy efficiency becoming so important and populations growing so fast that these kind of space fitting problems would be very important to solve.
Optimizing a Parking Lot Problem. Is this problem NP-Complete?
===

The other day I was trying to park in a parking lot and noticed that parking lot could have been designed better.

That got me thinking of trying to figure out an algorithm to organize a parking lot in the most efficient manner (as many cars as possible).

However I immediately started to think that the problem must be NP-Complete as it reminded me of the Knapsack problem. 

**Has anyone tackled this problem with a Machine Learning algorithm (I couldn't google it) ? Or there some heuristic out there I am missing?**

With energy efficiency becoming so important and populations growing so fast that these kind of space fitting problems would be very important to solve.