LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

GENETIC ALGORITHM FOR THE CONTINUOUS LOCATION-ROUTING PROBLEM

Photo from wikipedia

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.… Click to show full abstract

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.

Keywords: continuous location; location; routing problem; genetic algorithm; location routing; problem

Journal Title: Neural Network World
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.