C -Language Approach to Vehicle Routing Problem with Inter Loading Facilities

Authors

  • Sangeetham Prasad
  • G. Balaji Prakash
  • V. B. V. N. Prasad
  • T.Nageswara Rao
  • B. Mahaboob
  • M.Sundara Murthy

Abstract

This paper primarily focuses on the problem ‘Vehicle Routing Problem with Inter Loading Facilities’. Suppose there are some cities/stations available. Among them some of the cities act as sources including head quarter and remaining cities act as destinations. All sources have some availability of goods/commodity/load and all destinations have the requirements of goods. The vehicle starts from the head quarter with given load capacity and supply requirements of some destinations. If all the destination requirements are satisfied then the vehicle comeback to the head quarter city. Suppose the load/goods of a vehicle is low while supplying the destinations, then there is a facility that the vehicle fill the sufficient load by visiting the near source station and supply the destinations. Here the vehicle need not visit all source cities while supplying the destination requirements, but all the destinations must be satisfied. The availability of goods at the source cities are always greater than or equal vehicle capacity. The aim of the problem is to get minimum distance/cost for satisfy all destinations subject to some conditions.

Downloads

Published

2020-04-13

Issue

Section

Articles