The Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and Two-Dimensional Loading Constraints
We introduce a problem generalizing previous VRPs with 2-D loading constraints. Memorization strategies are employed for keeping the CPU times in acceptable levels. Extensive computational results on well-known benchmark instances are reported. The proposed model promotes high loading space utilization throughout the routes. Item rearrangements along vehicle routes bring significant routing cost savings.
vehicle routing simultaneous pick-ups and deliveries loading constraints logistics heuristics