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

Halim, Siana and YOANITA, LYDIA (2015) Adjusted Clustering Clarke-Wright Saving Algorithm for Two Depots-N Vehicles. In: IEEE-IEEM, 07-12-2015 - 07-12-2015, Singapore - Singapore.

[img] PDF
Download (299Kb)


    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)
    Additional Information: Cover diambil dari FlashDisk. Conference tidak menerbitkan hardbook.
    Uncontrolled Keywords: CVRP, Clarke and Wright Saving Algorithm, Clustering
    Subjects: Q Science > QA Mathematics
    Divisions: Faculty of Industrial Technology > Industrial Engineering Department
    Depositing User: Admin
    Date Deposited: 09 Jan 2016 16:10
    Last Modified: 27 Jan 2016 16:58
    URI: http://repository.petra.ac.id/id/eprint/17232

    Actions (login required)

    View Item