Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2014, Vol 12, Issue 9
Abstract
The Capacitated Vehicle Routing Problem is the most common and basic variant of the vehicle routing problem, where it represents an important problem in the fields of transportation, distribution and logistics. It involves finding a set of optimal routes that achieve the minimum cost and serve scattered customer locations under several constraints such as the distance between customers’ locations, available vehicles, vehicle capacity and customer demands. The Cluster first – Route second is the proposed approach used to solve capacitated vehicle routing problem which applied in a real case study used in that research, it consists of two main phases. In the first phase, the objective is to group the closest geographical customer locations together into clusters based on their locations, vehicle capacity and demands by using Sweep algorithm. In the second phase, the objective is to generate the minimum cost route for each cluster by using the Nearest Neighbor algorithm. The hybrid approach is evaluated by Augerat’s Euclidean benchmark datasets.
Authors and Affiliations
Moh. M. AbdElAziz, Haitham A. El-Ghareeb, M. S. M. Ksasy
Keywords
Related Articles
- EP ID EP650440
- DOI 10.24297/ijct.v12i9.2824
- Views 65
- Downloads 0
THE IMPORTANCE OF NORMALIZATION METHODS FOR MINING MEDICAL DATA
Over the past decades, the field of medical informatics has been growing rapidly and has drawn the attention of many researchers. The digitization of different medical information, including medical history records, rese...
MESSAGE GUIDED RANDOM AUDIO STEGANOGRAPHY USING MODIFIED LSB TECHNIQUE
Steganography is the science of hiding secret data in such a way that its presence can't be noticed. Techniques which hide more secret data in cover files and which doesn't affect transparency of cover signal are better...
STUDY OF TEST CASE PRIORITIZATION TECHNIQUE USING APFD
Regression testing is used to ensure that bugs are fixed and new functionality introduce in a new version of a software that don't adversely affect the original functionality inherited from the previous version.Regressio...
P-Codec: Parallel Compressed File Decompression Algorithm for Hadoop
The increasing amount and size of data being handled by data analytic applications running on Hadoop has created a need for faster data processing. One of the effective methods for handling big data sizes is compression....
Robust Singular Value Decomposition Algorithm for Unique Faces
It has been read and also seen by physical encounters that there found to be seven near resembling humans by appearance .Many a times one becomes confused with respect to identification of such near resembling faces wh...