Integrated problem of pick up, delivery and backhaul with three-dimensional loading constraints and time window
The routing and loading problems are two essential issues to reduce transportation costs. In the recent decade, these problems have been integrated to realize the vehicle routing problem. Failure to comply with the loading constraints may result in damage to the goods or less use of the vehicle space, which in each case will result in additional damage and cost. In this paper, for the first time, the integrated routing problem of pickup, delivery, and backhaul with three-dimensional loading constraints and time window is considered, where the constraints of accumulation, orientation, non-reloading, and multi-delivery conditions are examined. In this study, items and containers are considered heterogeneous. By examining the subject literature, this problem was not observed in the literature. A mixed-integer programming model, a heuristic algorithm, and two metaheuristic algorithms based on tabu search and variable neighborhood search are proposed for this problem. For small instances the proposed metaheuristics were compared to the lower bound obtained from relaxing some constraints of the model. For large instances, the two metaheuristic algorithms are compared together. The results show that the average percentage of relative error in the tabu search and variable neighbor search algorithms is 0.96 and 0.88, respectively. Also, the tabu search algorithm and variable neighborhood search were able to give better results out of 54 instances in 27 and 25 instances, respectively.
پرداخت حق اشتراک به معنای پذیرش "شرایط خدمات" پایگاه مگیران از سوی شماست.
اگر عضو مگیران هستید:
اگر مقاله ای از شما در مگیران نمایه شده، برای استفاده از اعتبار اهدایی سامانه نویسندگان با ایمیل منتشرشده ثبت نام کنید. ثبت نام
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.