مشخصات پژوهش

صفحه نخست /A Column Generation for the ...
عنوان
A Column Generation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
نوع پژوهش مقاله چاپ‌شده
کلیدواژه‌ها
Open Vehicle Routing Problem, Heterogeneous Fixed Fleet, NP-hard Problems, Column Generation
چکیده
This paper addressed the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), in which the vehicles are not required to return to the depot after completing a service. In this new problem, the demands of customers are fulfilled by a heterogeneous fixed fleet of vehicles having various capacities, fixed costs and variable costs. This problem is an important variant of the open vehicle routing problem (OVRP) and can cover more practical situations in transportation and logistics. Since this problem belongs to NP-hard Problems, An approach based on column generation (CG) is applied to solve the HFFOVRP. A tight integer programming model is presented and the linear programming relaxation of which is solved by the CG technique. Since there have been no existing benchmarks, this study generated 19 test problems and the results of the proposed CG algorithm is compared to the results of exact algorithm. Computational experience confirms that the proposed algorithm can provide better solutions within a comparatively shorter period of time.
پژوهشگران