In some cases delivering customer’s demand in one place is not considered to be sutible, and customers need to satisfy their demand during the horizon, in this thesis, Periodic Vehicle Routing Problem with Two-Dimensional Loading Constarint is investigated. This problem addresses the customer services that distributed in different parts of the city and the service time is periodically executed, so that each customer choose the days in which need services. Selection of days by the customers is assumed to be possible to select a few days from the horizon. In this problem costumers are asking for the rectangular items, so in addition to weight, the width and length of the items should also be considered as an important factor of feasible loading. In short, in this problem the delivery of load is from depot by fleet to customers through periodic time, and the loading is managed in a way that in addition to the limitation of the capacity of the vehicle, the limitation of Key words: Periodic Vehicle Routing Problem with Two-Dimensional Loading Constraints, adaptive large neighborhood search, improved adaptive large neighborhood search.
