KUET Institutional Repository

Solving Capacitated Vehicle Routing Problem through Clustering with Variant Sweep Algorithm and Route Optimization using Swarm Intelligence

Show simple item record

dc.contributor.advisor Akhand, Dr. Muhammad Aminul Haque
dc.contributor.author Peya, Zahrul Jannat
dc.date.accessioned 2018-05-19T11:37:43Z
dc.date.available 2018-05-19T11:37:43Z
dc.date.issued 2016-05
dc.identifier.other ID 0000000
dc.identifier.uri http://hdl.handle.net/20.500.12228/112
dc.description This thesis is submitted to the Department of Computer Science and Engineering, Khulna University of Engineering & Technology in partial fulfillment of the requirements for the degree of Master of Science in Computer Science and Engineering, May, 2016. en_US
dc.description Cataloged from PDF Version of Thesis.
dc.description Includes bibliographical references (pages 51-55).
dc.description.abstract Capacitated Vehicle Routing Problem (CVRP) is a real life constraint satisfaction problem in which customers are optimally assigned to individual vehicles (considering their capacity) to keep total travel distance of the vehicles as minimum as possible while serving customers. Various methods are used to solve CVRP in last few decades, the most popular way of solving CVRP is splitting the task into two different phases: firstly, assigning customers under different vehicles and secondly, finding optimal route of each vehicle. Sweep clustering algorithm is well studied for clustering nodes. On the other hand, route optimization is simply a traveling salesman problem (TSP) and a number of TSP optimization methods are applied for this purpose. This study investigates a variant of Sweep algorithm for clustering nodes and different Swarm Intelligence (SI) based methods for route generation to get optimal CVRP solution. In conventional Sweep algorithm, cluster formation starts from 00 and consequently advance toward 3600 to consider all the nodes. In this study, a variant Sweep cluster is investigated from different starting angle. A heuristic based adaptive method is developed to select cluster formation starting angle. On the other hand, two well-known optimization methods (i.e., Genetic Algorithm and Ant Colony Optimization) and two recent SI based algorithms (i.e., Producer-Scrounger Method and Velocity Tentative Particle Swarm Optimization) are considered for route optimization. The experimental results on a large number of benchmark CVRPs revealed that different starting angles have positive effect on Sweep clustering and finally, VTPSO is able to produce better solution than other SI methods. Finally, the proposed mythology is found to achieve better CVRP solutions for several problems when compared with several prominent en_US
dc.description.statementofresponsibility Zahrul Jannat Peya
dc.format.extent 56 pages
dc.language.iso en_US en_US
dc.publisher Khulna University of Engineering & Technology (KUET), Khulna, Bangladesh. en_US
dc.rights Khulna University of Engineering & Technology (KUET) thesis/dissertation/internship reports are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission.
dc.subject Capacitated Vehicle Routing Problem en_US
dc.subject Algorithm en_US
dc.subject Swarm Intelligence
dc.title Solving Capacitated Vehicle Routing Problem through Clustering with Variant Sweep Algorithm and Route Optimization using Swarm Intelligence en_US
dc.type Thesis en_US
dc.description.degree Master of Science in Computer Science and Engineering
dc.contributor.department Department of Computer Science and Engineering


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search KUET IR


Advanced Search

Browse

My Account

Statistics