An effective way to solve your problem would be to create dummy nodes for your ultra narrow aisles. A set of normal nodes for the points in ultra narrow aisles and a set of dummy nodes for those points. The entrance to an aisle should be either a dummy node or normal node, depending on the side of the aisle you are entering from. If you now set the distance between dummy nodes and normal nodes in an aisle to a very large number (e.g. infinite), you will always exit trough the side you came in, as that path is always shorter.

Note: for heuristic approaches (which I assume you are using) this may have a neglible effect on your results or solving time. For exact solutions (using linear programms) this increases the problem size by the amount of nodes in narrow aisles, and may exponentially increasse the solving time for this problem.