LOCATION ROUTING PROBLEM |
![]() | ![]() | ![]() | ![]() |
Ch. Duhamel | P. Lacomme | C. Prins | C. Prodhon |
see for example | Duhamel C. P. Lacomme, C. Prins, and C. Prodhon, "A GRASPxELS approach for real-life Location Routing Problems", International Conference on Computers and Industrial Engineering, Université de Troyes, 6-8 july, 2009. |
Prodhon's instances | download |
Tuzun's instances | download |
Barreto's instances | download |
Main characteristics: | - Asymetric graph (distance from i to j differt from distance from j to i) - Non euclidean distances - Homogeounous fleet of vehicles - Strongly heterogeonous hubs - No linear dependence between distance and transportation time on arcs - No linear dependence between quantities to collect and serviced time |
DLPP's instances small instances | download |
DLPP's instances medium instances | download |
DLPP's instances large instances | download |
Instances generator: | - Provides graphical representation of instances - Provides graphical representation of solution - download |
Instances description: | ![]() ![]() |
Example of instances: | ![]() - File of the instance (download) |
Solution description: | ![]() |
Example of solution: | ![]() - File of the solution (download) |