283 lines
10 KiB
Plaintext
283 lines
10 KiB
Plaintext
{
|
|
"cells": [
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"##### Copyright 2020 Google LLC."
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"Licensed under the Apache License, Version 2.0 (the \"License\");\n",
|
|
"you may not use this file except in compliance with the License.\n",
|
|
"You may obtain a copy of the License at\n",
|
|
"\n",
|
|
" http://www.apache.org/licenses/LICENSE-2.0\n",
|
|
"\n",
|
|
"Unless required by applicable law or agreed to in writing, software\n",
|
|
"distributed under the License is distributed on an \"AS IS\" BASIS,\n",
|
|
"WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n",
|
|
"See the License for the specific language governing permissions and\n",
|
|
"limitations under the License.\n"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"# vrp_initial_routes"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"<table align=\"left\">\n",
|
|
"<td>\n",
|
|
"<a href=\"https://colab.research.google.com/github/google/or-tools/blob/master/examples/notebook/constraint_solver/vrp_initial_routes.ipynb\"><img src=\"https://raw.githubusercontent.com/google/or-tools/master/tools/colab_32px.png\"/>Run in Google Colab</a>\n",
|
|
"</td>\n",
|
|
"<td>\n",
|
|
"<a href=\"https://github.com/google/or-tools/blob/master/ortools/constraint_solver/samples/vrp_initial_routes.py\"><img src=\"https://raw.githubusercontent.com/google/or-tools/master/tools/github_32px.png\"/>View source on GitHub</a>\n",
|
|
"</td>\n",
|
|
"</table>"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"First, you must install [ortools](https://pypi.org/project/ortools/) package in this colab."
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "code",
|
|
"execution_count": null,
|
|
"metadata": {},
|
|
"outputs": [],
|
|
"source": [
|
|
"!pip install ortools"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "code",
|
|
"execution_count": null,
|
|
"metadata": {},
|
|
"outputs": [],
|
|
"source": [
|
|
"# Copyright 2010-2018 Google LLC\n",
|
|
"# Licensed under the Apache License, Version 2.0 (the \"License\");\n",
|
|
"# you may not use this file except in compliance with the License.\n",
|
|
"# You may obtain a copy of the License at\n",
|
|
"#\n",
|
|
"# http://www.apache.org/licenses/LICENSE-2.0\n",
|
|
"#\n",
|
|
"# Unless required by applicable law or agreed to in writing, software\n",
|
|
"# distributed under the License is distributed on an \"AS IS\" BASIS,\n",
|
|
"# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n",
|
|
"# See the License for the specific language governing permissions and\n",
|
|
"# limitations under the License.\n",
|
|
"# [START program]\n",
|
|
"\"\"\"Vehicles Routing Problem (VRP).\"\"\"\n",
|
|
"\n",
|
|
"# [START import]\n",
|
|
"from ortools.constraint_solver import pywrapcp\n",
|
|
"\n",
|
|
"# [END import]\n",
|
|
"\n",
|
|
"\n",
|
|
"# [START data_model]\n",
|
|
"def create_data_model():\n",
|
|
" \"\"\"Stores the data for the problem.\"\"\"\n",
|
|
" data = {}\n",
|
|
" data['distance_matrix'] = [\n",
|
|
" [\n",
|
|
" 0, 548, 776, 696, 582, 274, 502, 194, 308, 194, 536, 502, 388, 354,\n",
|
|
" 468, 776, 662\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 548, 0, 684, 308, 194, 502, 730, 354, 696, 742, 1084, 594, 480, 674,\n",
|
|
" 1016, 868, 1210\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 776, 684, 0, 992, 878, 502, 274, 810, 468, 742, 400, 1278, 1164,\n",
|
|
" 1130, 788, 1552, 754\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 696, 308, 992, 0, 114, 650, 878, 502, 844, 890, 1232, 514, 628, 822,\n",
|
|
" 1164, 560, 1358\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 582, 194, 878, 114, 0, 536, 764, 388, 730, 776, 1118, 400, 514, 708,\n",
|
|
" 1050, 674, 1244\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 274, 502, 502, 650, 536, 0, 228, 308, 194, 240, 582, 776, 662, 628,\n",
|
|
" 514, 1050, 708\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 502, 730, 274, 878, 764, 228, 0, 536, 194, 468, 354, 1004, 890, 856,\n",
|
|
" 514, 1278, 480\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 194, 354, 810, 502, 388, 308, 536, 0, 342, 388, 730, 468, 354, 320,\n",
|
|
" 662, 742, 856\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 308, 696, 468, 844, 730, 194, 194, 342, 0, 274, 388, 810, 696, 662,\n",
|
|
" 320, 1084, 514\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 194, 742, 742, 890, 776, 240, 468, 388, 274, 0, 342, 536, 422, 388,\n",
|
|
" 274, 810, 468\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 536, 1084, 400, 1232, 1118, 582, 354, 730, 388, 342, 0, 878, 764,\n",
|
|
" 730, 388, 1152, 354\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 502, 594, 1278, 514, 400, 776, 1004, 468, 810, 536, 878, 0, 114,\n",
|
|
" 308, 650, 274, 844\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 388, 480, 1164, 628, 514, 662, 890, 354, 696, 422, 764, 114, 0, 194,\n",
|
|
" 536, 388, 730\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 354, 674, 1130, 822, 708, 628, 856, 320, 662, 388, 730, 308, 194, 0,\n",
|
|
" 342, 422, 536\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 468, 1016, 788, 1164, 1050, 514, 514, 662, 320, 274, 388, 650, 536,\n",
|
|
" 342, 0, 764, 194\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 776, 868, 1552, 560, 674, 1050, 1278, 742, 1084, 810, 1152, 274,\n",
|
|
" 388, 422, 764, 0, 798\n",
|
|
" ],\n",
|
|
" [\n",
|
|
" 662, 1210, 754, 1358, 1244, 708, 480, 856, 514, 468, 354, 844, 730,\n",
|
|
" 536, 194, 798, 0\n",
|
|
" ],\n",
|
|
" ]\n",
|
|
" # [START initial_routes]\n",
|
|
" data['initial_routes'] = [\n",
|
|
" [8, 16, 14, 13, 12, 11],\n",
|
|
" [3, 4, 9, 10],\n",
|
|
" [15, 1],\n",
|
|
" [7, 5, 2, 6],\n",
|
|
" ]\n",
|
|
" # [END initial_routes]\n",
|
|
" data['num_vehicles'] = 4\n",
|
|
" data['depot'] = 0\n",
|
|
" return data\n",
|
|
" # [END data_model]\n",
|
|
"\n",
|
|
"\n",
|
|
"# [START solution_printer]\n",
|
|
"def print_solution(data, manager, routing, solution):\n",
|
|
" \"\"\"Prints solution on console.\"\"\"\n",
|
|
" max_route_distance = 0\n",
|
|
" for vehicle_id in range(data['num_vehicles']):\n",
|
|
" index = routing.Start(vehicle_id)\n",
|
|
" plan_output = 'Route for vehicle {}:\\n'.format(vehicle_id)\n",
|
|
" route_distance = 0\n",
|
|
" while not routing.IsEnd(index):\n",
|
|
" plan_output += ' {} -> '.format(manager.IndexToNode(index))\n",
|
|
" previous_index = index\n",
|
|
" index = solution.Value(routing.NextVar(index))\n",
|
|
" route_distance += routing.GetArcCostForVehicle(\n",
|
|
" previous_index, index, vehicle_id)\n",
|
|
" plan_output += '{}\\n'.format(manager.IndexToNode(index))\n",
|
|
" plan_output += 'Distance of the route: {}m\\n'.format(route_distance)\n",
|
|
" print(plan_output)\n",
|
|
" max_route_distance = max(route_distance, max_route_distance)\n",
|
|
" print('Maximum of the route distances: {}m'.format(max_route_distance))\n",
|
|
"\n",
|
|
"\n",
|
|
"# [END solution_printer]\n",
|
|
"\n",
|
|
"\n",
|
|
"\"\"\"Solve the CVRP problem.\"\"\"\n",
|
|
"# Instantiate the data problem.\n",
|
|
"# [START data]\n",
|
|
"data = create_data_model()\n",
|
|
"# [END data]\n",
|
|
"\n",
|
|
"# Create the routing index manager.\n",
|
|
"# [START index_manager]\n",
|
|
"manager = pywrapcp.RoutingIndexManager(len(data['distance_matrix']),\n",
|
|
" data['num_vehicles'], data['depot'])\n",
|
|
"# [END index_manager]\n",
|
|
"\n",
|
|
"# Create Routing Model.\n",
|
|
"# [START routing_model]\n",
|
|
"routing = pywrapcp.RoutingModel(manager)\n",
|
|
"\n",
|
|
"# [END routing_model]\n",
|
|
"\n",
|
|
"# Create and register a transit callback.\n",
|
|
"# [START transit_callback]\n",
|
|
"def distance_callback(from_index, to_index):\n",
|
|
" \"\"\"Returns the distance between the two nodes.\"\"\"\n",
|
|
" # Convert from routing variable Index to distance matrix NodeIndex.\n",
|
|
" from_node = manager.IndexToNode(from_index)\n",
|
|
" to_node = manager.IndexToNode(to_index)\n",
|
|
" return data['distance_matrix'][from_node][to_node]\n",
|
|
"\n",
|
|
"transit_callback_index = routing.RegisterTransitCallback(distance_callback)\n",
|
|
"# [END transit_callback]\n",
|
|
"\n",
|
|
"# Define cost of each arc.\n",
|
|
"# [START arc_cost]\n",
|
|
"routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index)\n",
|
|
"# [END arc_cost]\n",
|
|
"\n",
|
|
"# Add Distance constraint.\n",
|
|
"# [START distance_constraint]\n",
|
|
"dimension_name = 'Distance'\n",
|
|
"routing.AddDimension(\n",
|
|
" transit_callback_index,\n",
|
|
" 0, # no slack\n",
|
|
" 3000, # vehicle maximum travel distance\n",
|
|
" True, # start cumul to zero\n",
|
|
" dimension_name)\n",
|
|
"distance_dimension = routing.GetDimensionOrDie(dimension_name)\n",
|
|
"distance_dimension.SetGlobalSpanCostCoefficient(100)\n",
|
|
"# [END distance_constraint]\n",
|
|
"\n",
|
|
"# [START print_initial_solution]\n",
|
|
"initial_solution = routing.ReadAssignmentFromRoutes(data['initial_routes'],\n",
|
|
" True)\n",
|
|
"print('Initial solution:')\n",
|
|
"print_solution(data, manager, routing, initial_solution)\n",
|
|
"# [END print_initial_solution]\n",
|
|
"\n",
|
|
"# Set default search parameters.\n",
|
|
"# [START parameters]\n",
|
|
"search_parameters = pywrapcp.DefaultRoutingSearchParameters()\n",
|
|
"# [END parameters]\n",
|
|
"\n",
|
|
"# Solve the problem.\n",
|
|
"# [START solve]\n",
|
|
"solution = routing.SolveFromAssignmentWithParameters(\n",
|
|
" initial_solution, search_parameters)\n",
|
|
"# [END solve]\n",
|
|
"\n",
|
|
"# Print solution on console.\n",
|
|
"# [START print_solution]\n",
|
|
"if solution:\n",
|
|
" print('Solution after search:')\n",
|
|
" print_solution(data, manager, routing, solution)\n",
|
|
"# [END print_solution]\n",
|
|
"\n"
|
|
]
|
|
}
|
|
],
|
|
"metadata": {},
|
|
"nbformat": 4,
|
|
"nbformat_minor": 4
|
|
}
|