GENETIC ALGORITHM FOR THE CONTINUOUS LOCATION-ROUTING PROBLEM

This paper focuses on the continuous location-routing problem that comprises of the location of multiple depots from a given region and determining the routes of vehicles assigned to these depots.The objective of the problem is to design the delivery system of depots and routes so that the total cost is minimal.The standard location-routing problem considers a finite number of possible locations.The continuous location-routing problem allows location to infinite number of locations in a given region and makes the problem much more complex.We present a genetic algorithm that tackles both location and routing subproblems simultaneously.