One way to do this is:

• For every parcel, find the closest road. (NeighborFinder, parcels are bases, roads are candidates, find only 1 candidate)
• Draw the results as lines using closest base x and y and closest candidate x an y. (VertexCreators)
• Exclude all results where the line overlaps with a parcel other than itself. (SpatialRelator, list, tester.)

Thanks, Dear, Idea looks to be great but the shortest path to the road might not intersect with other parcels but actually the parcel might intersect as shown below

Yes, Ill admin it is a challenging problem. I created some sample data and tried a few things but I have not a working solution for now.

Maybe it helps to set a maximum distance in the Neighborfinder?

The community can help you better when you provide some relevant sample data.