An Efficient Improvement Of Ant Colony System Algorithm For Handling Capacity Vehicle Routing Problem
Capacitated Vehicle Routing Problem (CVRP) is considered as one of the most famous specialized forms of VRP that has attracted considerable attention from researchers. This problem belongs to complex combinatorial optimization problems included in the NP-Hard Problem category, which is a problem tha...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2020
|
| Online Access: | http://eprints.utem.edu.my/id/eprint/25146/2/IJIEC_2020_12.PDF http://eprints.utem.edu.my/id/eprint/25146/ http://www.growingscience.com/ijiec/Vol11/IJIEC_2020_12.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Capacitated Vehicle Routing Problem (CVRP) is considered as one of the most famous specialized forms of VRP that has attracted considerable attention from researchers. This problem belongs to complex combinatorial optimization problems included in the NP-Hard Problem category, which is a problem that needs difficult computation. This paper presents an improvement of Ant Colony System (ACS) to solve this problem. In this study, the problem deals with a few vehicles which are used for transporting products to specific places. Each vehicle starts from a main location at different times every day. The capacitated vehicle routing problem (CVRP) is defined to serve a group of delivery customers with known demands. The proposed study seeks to find the best solution of CVRP by using improvement ACS with the accompanying targets: (1) To decrease the distance as long distances negatively affect the course of the process since it consumes a great time to visit all customers. (2) To implement the improvement of ACS algorithm on new data from the database of CVRP. Through the implementation of the proposed algorithm better results were obtained from the results of other methods and the results were compared. |
|---|