Facility Location and routing problems: Survey, Models and Algorithm
-
Updated
Apr 16, 2021 - Jupyter Notebook
Facility Location and routing problems: Survey, Models and Algorithm
Location Routing problem solved using Integer Programming of Operations Research. The purpose was to decide where to place depots at lowest building cost, that serve customers on a map with truks minimizing their travelling costs.
This repository contains an implementation of a Simulated Annealing (SA) approach to solve the Capacitated Location Routing Problem (CLRP), based on the method proposed by Yu et al. (2010)
Add a description, image, and links to the location-routing topic page so that developers can more easily learn about it.
To associate your repository with the location-routing topic, visit your repo's landing page and select "manage topics."