Akademik Veri Yönetim Sistemi
Joint International Symposium on "The Social Impacts of Developments in Information, Manufacturing and Service Systems" 44th International Conference on Computers and Industrial Engineering, CIE 2014 and 9th International Symposium on Intelligent Manufacturing and Service Systems, IMSS 2014, İstanbul, Türkiye, 14 - 16 Ekim 2014, ss.2153-2166, (Tam Metin Bildiri)
The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) has gained importance due to its applicability in numerous reverse logistic systems involving bi-directional flow of goods. The VRPSPD can be encountered in a distribution/collection system involving a set of customers requiring delivery and pickup services simultaneously. Originally, the VRPSPD assumes a homogeneous fleet of vehicles to serve the customers. However, in many transportation systems there are different types of vehicles available to perform the pickup and delivery operations. In this study, we extend the original version of the VRPSPD by assuming the fleet of vehicles to be heterogeneous. The Heterogeneous Fleet Vehicle Routing Problem with Simultaneous Pickup and Delivery (HFVRPSPD) is considered to be an NP-hard problem because it generalizes the classical VRP. For this reason, we propose a local search metaheuristic algorithm in which an adaptive threshold adjusting strategy is integrated with tabu search. The proposed algorithm is applied to a set of randomly generated problem instances. The results indicate that the developed approach can produce efficient and effective solutions.