1. Determine the picker route in the storage zone of the French warehouse of the Guillen company (see given figure), using the S-shaped heuristic, the largest gap heuristic, the combined heuristic and the aisle-by-aisle heuristic.
2. Show that an optimal picker route cannot traverse an aisle (or a portion of an aisle) more than twice. Illustrate how this property can be used to devise a dynamic programming algorithm.