2015/08/24 by Kaarthik Sundar, Sundar, Kaarthik, Saravanan Venkatachalam +3
Business, Management and Accounting · Engineering · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Facility Location and Emergency Management #Optimization and Mathematical Programming #Vehicle Routing Optimization Methods
paper · pdf · doi:10.48550/arxiv.1508.05968
openalex publication_date 2015/08/24 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28
We consider a multiple depot, multiple vehicle routing problem with fuel\nconstraints. We are given a set of targets, a set of depots and a set of\nhomogeneous vehicles, one for each depot. The depots are also allowed to act as\nrefueling stations. The vehicles are allowed to refuel at any depot, and our\nobjective is to determine a route for each vehicle with a minimum total cost\nsuch that each target is visited at least once by some vehicle, and the\nvehicles never run out fuel as it traverses its route. We refer this problem as\nMultiple Depot, Fuel-Constrained, Multiple Vehicle Routing Problem (FCMVRP).\nThis paper presents four new mixed integer linear programming formulations to\ncompute an optimal solution for the problem. Extensive computational results\nfor a large set of instances are also presented.\n