Adjusted Clustering Clarke-Wright Saving Algorithm for Two Depots-N Vehicles

Halim, Siana and Yonita, Lydia (2015) Adjusted Clustering Clarke-Wright Saving Algorithm for Two Depots-N Vehicles. In: IEEE-IEEM 2015, 6-9 December 2015, Singapore.

Download (1590Kb) | Preview
    PDF (cek plagiasi)
    Download (688Kb) | Preview
      [img] PDF (peerreview)
      Download (402Kb)


        In this paper we modeled the distribution of a single type of products, which are distributed from two depots and use N-vehicles. This problem can be modeled using Capacitated Vehicle Routing Problems (CVRP), and the common algorithm to solve that model is Clarke and Wright Saving Algorithm (CWSA). The needed computational time for finding the nearly global optimum of CWSA grows exponentially with the numbers of the existed routes. Therefore, in this paper, we proposed to combine the clustering algorithm with CWSA. Additionally, we consider the largest item in the cluster, which has to be transported, as the starting point to find the optimum solution.

        Item Type: Conference or Workshop Item (Paper)
        Subjects: Q Science > QA Mathematics
        Divisions: Faculty of Industrial Technology > Industrial Engineering Department
        Depositing User: Siana Halim
        Date Deposited: 21 Jan 2016 14:24
        Last Modified: 04 May 2018 09:14
        URI: http://repository.petra.ac.id/id/eprint/17191

        Actions (login required)

        View Item