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

Safety of Smart Cities

Present work is based on the concept of integral safety management of system of systems and it gives the proposal of set of measures into the simultaneously modern concept of communities called “smart cities”. The ta...

Feedback Based Conflict Identification and Resolution using Duplicate Elimination and Ranking Techniques

Increase in the amount of data provides a huge scope for data analysts to operate and leverage information from them. Problems arise when the data varies in formats and their storage mechanisms become heterogeneous. Henc...

Fingerprint Image Enhancement Algorithms for Identification in an Electoral Process

Electoral process in many developing nations is characterized with fraud and failure as a result of inefficient and effective system of voter’s register and voting system. This usually leads to crises. This paper prese...

Wavelet-Local binary pattern based face recognition

Over the last twenty years face recognition has made immense progress based on statistical learning or subspace discriminant analysis. This paper investigates a technique to reduce features necessary for face recognition...

A two level approach to discretize cosmetic data using Rough set theory

Discrete values play a very prominent role in extracting knowledge. Most of the machines learning algorithms use discrete values. It is also observed that the rules discovered through discrete values are shorter and prec...

Download PDF file
  • EP ID EP650440
  • DOI 10.24297/ijct.v12i9.2824
  • Views 76
  • Downloads 0

How To Cite

Moh. M. AbdElAziz, Haitham A. El-Ghareeb, M. S. M. Ksasy (2014). Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 12(9), 3844-3851. https://europub.co.uk/articles/-A-650440