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

Impact of Ransomware on Cybersecurity

This paper attempts to discover ransomware exposing the lack of cyber-security. It intends to elicit attention with regards to ransomware, a newly emerged cyber threat and to help organizations; IT practitioners understa...

Secure and Distributed On-Demand Randomized Routing in WSN

Security and energy efficiency is of paramount importance in a wireless sensor network. This is due to their vulnerabledeployment conditions and battery based power. This paper presents a secure and distributed algorithm...

Comparative Study of DES, 3DES, AES and RSA

In today world importance of exchange of data over internet and other media type is eminent; the search for best data protection against security attacks and a method to timely deliver the data without much delay is the...

Logistics Innovation in the Medico-Social Sector: An Optimized Workflow for an Efficient Patient Care

The issue of care for the elderly is a real challenge for our society. The French government offers solutions to users, particularly through institutions hosting for dependent elderly people (nursing homes). We position...

A NOVEL APPROACH OF JOB ALLOCATION USING MULTIPLE PARAMETERS IN IN CLOUD ENVIRONMENT

Cloud computing is Internet ("cloud") based development and use of computer technology ("computing"). It is a style of computing in which dynamically scalable and often virtualized resources are provided as a service ove...

Download PDF file
  • EP ID EP650440
  • DOI 10.24297/ijct.v12i9.2824
  • Views 75
  • 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