Distributing products at various locations in a large city network, with differentdemand along with the time and capacity constraints is a very crucial task fromthe supply chain and logistics management perspective. The research work dealswith the distribution of a food/beverage product at the vending machines (VMs)located throughout the city using vehicles of different capacities in limited time.A delivery pattern has been fixed to serve the VMs on different days of theweek based on their given type and demand. A Vehicle Routing Problem hasbeen developed by a mathematical model based heuristic algorithm to get theallocation of vehicles of different capacities along with the time and capacityconstraints to a designated set of VMs. The final route of each vehicle has beenobtained by solving a Travelling Salesman Problem.Keywords:Delivery optimization, Logistics management, Vehicle Routing Prob-lem, Routing, Mathematical models, Heuristic, Travelling Salesman Problem