%0 Journal Article
%T A CONSTRUCTION MATHEURISTIC FOR MULTI-TRIP VEHICLE ROUTING PROBLEM AT SANTA FE-INDONESIA
%A Bahar £¿avdar
%A Haldun S¨¹ral
%J -
%D 2018
%X This study is motivated by a real-life application of the multi-trip vehicle routing problem (VRPM). The VRPM relaxes a strong assumption that each vehicle can perform only a single trip. Even though this problem setting is more suitable for many applications, the literature on the VRPM is limited compared to the other variants of the Vehicle Routing Problem. In this paper, we propose a construction matheuristic based on a set covering approach, and provide the results of computational experiments for a more involved variant of VRPM
%K Ara£¿ rotalama
%K mat-sezgisel
%U http://dergipark.org.tr/endustrimuhendisligi/issue/46633/584016