Cover Image

A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem

Vehicle Routing Problem (VRP) is a real life constraint satisfaction problem to find minimal travel distances of vehicles to serve customers. Capacitated CVRP (CVRP) is the simplest form of VRP considering vehicle capacity constraint. Constructive and clustering are the two popular approaches to...

Full description

Saved in:
Bibliographic Details
Main Authors: Sultana, Tanzima, Akhand, Md Aminul Haque, Rahman, M.M. Hafizur
Format: Conference or Workshop Item
Language:English
English
Published: IEEE 2017
Subjects:
T Technology (General)
Online Access:http://irep.iium.edu.my/61954/1/61954-A%20Variant%20Fisher%20and%20Jaikuamr%20Algorithm.pdf
http://irep.iium.edu.my/61954/2/61954-A%20variant%20fisher%20and%20Jaikuamr%20algorithm-SCOPUS.pdf
http://irep.iium.edu.my/61954/
http://ieeexplore.ieee.org/document/8079932/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.iium.irep.61954
record_format dspace
spelling my.iium.irep.61954 http://irep.iium.edu.my/61954/ A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem Sultana, Tanzima Akhand, Md Aminul Haque Rahman, M.M. Hafizur T Technology (General) Vehicle Routing Problem (VRP) is a real life constraint satisfaction problem to find minimal travel distances of vehicles to serve customers. Capacitated CVRP (CVRP) is the simplest form of VRP considering vehicle capacity constraint. Constructive and clustering are the two popular approaches to solve CVRP. A constructive approach creates routes and attempts to minimize the cost at the same time. On the other hand, a clustering based method first assigns nodes into vehicle wise cluster and then generates route for each vehicle. Route generation is a traveling sales man problem (TSP) and any TSP optimization method is useful for this purpose. Fisher and Jaikumar algorithm is a well-known cluster based method which creates clusters with a geometric method partitioning the customer plane into equal angular cones where the total cones are equal to the number of vehicles. This study investigates a variant of Fisher and Jaikumar algorithm owning to solve CVRP efficiently. In the proposed method clusters form such a way that each cluster cone contains equal number of nodes. The initial clusters formation in a method are subjected to route optimization. Three prominent metaheuristic methods (i.e., genetic algorithm, ant colony optimization, particle swarm optimization) for TSP are considered for route optimization. The efficiency of the proposed method is identified while solving benchmark CVRPs. Experimental result reveals that variant Fisher and Jaikumar with particle swarm optimization is an effective method in solving CVRP. IEEE 2017 Conference or Workshop Item PeerReviewed application/pdf en http://irep.iium.edu.my/61954/1/61954-A%20Variant%20Fisher%20and%20Jaikuamr%20Algorithm.pdf application/pdf en http://irep.iium.edu.my/61954/2/61954-A%20variant%20fisher%20and%20Jaikuamr%20algorithm-SCOPUS.pdf Sultana, Tanzima and Akhand, Md Aminul Haque and Rahman, M.M. Hafizur (2017) A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem. In: 8th International Conference on Information Technology (ICIT) 2017, 17th-18th May 2017, Amman, Jourdan. http://ieeexplore.ieee.org/document/8079932/ 10.1109/ICITECH.2017.8079932
institution Universiti Islam Antarabangsa Malaysia
building IIUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider International Islamic University Malaysia
content_source IIUM Repository (IREP)
url_provider http://irep.iium.edu.my/
language English
English
topic T Technology (General)
spellingShingle T Technology (General)
Sultana, Tanzima
Akhand, Md Aminul Haque
Rahman, M.M. Hafizur
A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem
description Vehicle Routing Problem (VRP) is a real life constraint satisfaction problem to find minimal travel distances of vehicles to serve customers. Capacitated CVRP (CVRP) is the simplest form of VRP considering vehicle capacity constraint. Constructive and clustering are the two popular approaches to solve CVRP. A constructive approach creates routes and attempts to minimize the cost at the same time. On the other hand, a clustering based method first assigns nodes into vehicle wise cluster and then generates route for each vehicle. Route generation is a traveling sales man problem (TSP) and any TSP optimization method is useful for this purpose. Fisher and Jaikumar algorithm is a well-known cluster based method which creates clusters with a geometric method partitioning the customer plane into equal angular cones where the total cones are equal to the number of vehicles. This study investigates a variant of Fisher and Jaikumar algorithm owning to solve CVRP efficiently. In the proposed method clusters form such a way that each cluster cone contains equal number of nodes. The initial clusters formation in a method are subjected to route optimization. Three prominent metaheuristic methods (i.e., genetic algorithm, ant colony optimization, particle swarm optimization) for TSP are considered for route optimization. The efficiency of the proposed method is identified while solving benchmark CVRPs. Experimental result reveals that variant Fisher and Jaikumar with particle swarm optimization is an effective method in solving CVRP.
format Conference or Workshop Item
author Sultana, Tanzima
Akhand, Md Aminul Haque
Rahman, M.M. Hafizur
author_facet Sultana, Tanzima
Akhand, Md Aminul Haque
Rahman, M.M. Hafizur
author_sort Sultana, Tanzima
title A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem
title_short A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem
title_full A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem
title_fullStr A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem
title_full_unstemmed A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem
title_sort variant fisher and jaikuamr algorithm to solve capacitated vehicle routing problem
publisher IEEE
publishDate 2017
url http://irep.iium.edu.my/61954/1/61954-A%20Variant%20Fisher%20and%20Jaikuamr%20Algorithm.pdf
http://irep.iium.edu.my/61954/2/61954-A%20variant%20fisher%20and%20Jaikuamr%20algorithm-SCOPUS.pdf
http://irep.iium.edu.my/61954/
http://ieeexplore.ieee.org/document/8079932/
_version_ 1643617045546270720
score 13.211869

Similar Items