text/folder add update

Author: nparavicini7

guide/11-performing-network-analyses/part7_vehicle_routing_problem.ipynb

@@ -23,7 +23,7 @@
    "source": [
     "## Introduction\n",
     "\n",
-    "Now we have learned about Network Datasets and Network Analysis services in [Part 1](../part1-introduction-to-network-analysis), how to find routes from one point to another, and among multiple points in [Part 2](../part2-find-routes), how to generate service area in [Part 3](../part3-generate-service-area), how to find closest facility in [Part 4](../part4-find-closest-facilities), how to create an Origin Destination Cost Matrix in [Part 5](../part5-generate-od-cost-matrix), how to solve location allocation in [Part 6](../part6-solve-location-allocation), let's move onto the seventh topic - how to perform `Vehicle Routing Problem` service. Please refer to the road map below if you want to revisit the previous topics or jump to the next topic -\n",
+    "Now we have learned about Network Datasets and Network Analysis services in [Part 1](../part1-introduction-to-network-analysis), how to find routes from one point to another & between multiple points in [Part 2](../part2-find-routes), how to generate service areas in [Part 3](../part3-generate-service-area), how to find closest facilities in [Part 4](../part4-find-closest-facilities), how to create an Origin Destination Cost Matrix in [Part 5](../part5-generate-od-cost-matrix), how to solve location allocation in [Part 6](../part6-solve-location-allocation), let's move onto the seventh topic - how to perform the `Vehicle Routing Problem` service. Please refer to the road map below if you want to revisit the previous topics or jump to the next topic:\n",
     "\n",
     " - Network Dataset and Network Analysis services ([Part 1](../part1-introduction-to-network-analysis)) \n",
     " - Find Routes ([Part 2](../part2-find-routes))\n",
@@ -704,9 +704,7 @@
   {
    "cell_type": "code",
    "execution_count": 14,
-   "metadata": {
-    "scrolled": false
-   },
+   "metadata": {},
    "outputs": [
     {
      "data": {
@@ -1550,7 +1548,7 @@
    "source": [
     "route_data = result1.out_route_data.download('.')\n",
     "root_folder = my_gis.content.folders.get()\n",
-    "route_data_item = root_folder.add({\"type\": \"File Geodatabase\"}, route_data)\n",
+    "route_data_item = root_folder.add({\"type\": \"File Geodatabase\"}, route_data).result()\n",
     "route_data_item"
    ]
   },
@@ -2827,7 +2825,7 @@
     "\n",
     "`Breaks` are the rest periods, for the routes in a given vehicle routing problem. A break is associated with exactly one route, and can be taken after completing an order, while en route to an order, or prior to servicing an order. It has a start time and a duration for which the driver may or may not be paid. There are three options for establishing when a break begins: (1) using a time window, (2) a maximum travel time, or (3) a maximum work time ([5](#references)).\n",
     "\n",
-    "In the CSV file we specified below, the time variable being used is `MaxCumuWorkTime`, which represents \"the maximum amount of work time that can be accumulated before the break is taken. Work time is always accumulated from the beginning of the route.\" This field is designed to limit how long a person can work until a break is required. In this case, the time unit for the analysis is set to Minutes, `MaxCumulWorkTime` has a value of 240, and `ServiceTime` has a value of 30, the driver will get a 30-minute break after 4 hours of work.\n",
+    "In the CSV file we specified below, the time variable being used is `MaxCumulWorkTime`, which represents \"the maximum amount of work time that can be accumulated before the break is taken. Work time is always accumulated from the beginning of the route.\" This field is designed to limit how long a person can work until a break is required. In this case, the time unit for the analysis is set to Minutes, `MaxCumulWorkTime` has a value of 240, and `ServiceTime` has a value of 30, the driver will get a 30-minute break after 4 hours of work.\n",
     "\n",
     "Otherwise, you can either use a combination of `TimeWindowStart`, `TimeWindowEnd`, and `MaxViolationTime`, or `MaxTravelTimeBetweenBreaks` to specify the time attributes. Remember that these options are mutually exclusive, meaning that if e.g. the `MaxCumuWorkTime` field has a value, then TimeWindowStart, TimeWindowEnd, MaxViolationTime, and MaxTravelTimeBetweenBreaks must be null for an analysis to solve successfully. For more information to these fields, please checkout the REST API Help doc ([5](#references)).\n",
     "\n",
@@ -3033,9 +3031,7 @@
   {
    "cell_type": "code",
    "execution_count": 38,
-   "metadata": {
-    "scrolled": false
-   },
+   "metadata": {},
    "outputs": [
     {
      "data": {
@@ -3801,7 +3797,7 @@
     "## Solution 3: Delineates work territories\n",
     "\n",
     "\n",
-    "The third example is to delineate work territories for given routes. This scenario is needed whenever -\n",
+    "The third example is to delineate work territories for given routes. This scenario is needed whenever:\n",
     " - Some of your employees don't have the required permits to perform work in certain states or communities. You can create a hard route zone so they only visit orders in areas where they meet the requirements.\n",
     " - One of your vehicles breaks down frequently so you want to minimize response time by having it only visit orders that are close to your maintenance garage. You can create a soft or hard route zone to keep the vehicle nearby ([6](#references)).\n",
     "\n",
@@ -4836,7 +4832,7 @@
    "source": [
     "## Conclusions\n",
     "\n",
-    "The network module of the ArcGIS API for Python allows you to solve a Vehicle Routing Problem and other network problems with necessary business constraints. In this part of guide, we have explored three different scenarios: (1) Basic scenario, given the stores to visit, the distribution center to load supplies, and the vehicle(s) to deliver goods; (2) Modified scenario, when one of the truck drivers go on vacation, and overtime is required; and (3) With work territories delineated, assuming that certain areas cannot be visited on the route (or under certain penalties if visited). These solutions tend to meet different requirements of the least total cost, the least travel time, and the least distance, respectively. To learn more about how to solve VRP with business constraints <a href=\"https://developers.arcgis.com/python/api-reference/arcgis.network.analysis.html#solve-vehicle-routing-problem\">here</a>."
+    "The network module of the ArcGIS API for Python allows you to solve a Vehicle Routing Problem and other network problems with necessary business constraints. In this part of guide, we have explored three different scenarios: (1) Basic scenario, given the stores to visit, the distribution center to load supplies, and the vehicle(s) to deliver goods; (2) Modified scenario, when one of the truck drivers go on vacation, and overtime is required; and (3) With work territories delineated, assuming that certain areas cannot be visited on the route (or under certain penalties if visited). These solutions are oriented to meet different requirements of the least total cost, the least travel time, and the least distance, respectively. To learn more about how to solve VRP with business constraints <a href=\"https://developers.arcgis.com/python/api-reference/arcgis.network.analysis.html#solve-vehicle-routing-problem\">here</a>."
    ]
   },
   {
@@ -4875,7 +4871,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.7.11"
+   "version": "3.10.14"
   },
   "toc": {
    "base_numbering": 1,
@@ -4921,5 +4917,5 @@
   }
  },
  "nbformat": 4,
- "nbformat_minor": 2
+ "nbformat_minor": 4
 }