DelivAssignmentt.ipynb

{
 "cells": [
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "# DELIV VR ASSIGNMENT\n",
    "## Süleyman Topdemir"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 94,
   "metadata": {},
   "outputs": [],
   "source": [
    "import pandas as pd\n",
    "import numpy as np\n",
    "from haversine import haversine\n",
    "import copy as copy\n",
    "import sys\n",
    "import random\n",
    "import time"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "# WARNING!!!!\n",
    "Since I used the jupyter, the order and route objects must be created every time when we used them in the algorithms."
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "### reading the data to manipulate\n",
    "\n",
    "to find better inital solutions, the sequence of the input data has been changed. If we use the raw order data, number of requests assigned one of the routes is less than the case sorted by the pickup window start."
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 95,
   "metadata": {},
   "outputs": [],
   "source": [
    "#orderData = pd.read_excel (r'D:\\\\Users\\\\suuser\\\\Desktop\\\\Project Benjamin\\\\Take_home_deliveries_data.xlsx') # may need to be modified \n",
    "orderData = pd.read_excel (r'D:\\\\Users\\\\suuser\\\\Desktop\\\\Project Benjamin\\\\Take_home_deliveries_data_sortedByPickStart.xlsx')\n",
    "orderDataFrame = pd.DataFrame(orderData, columns= ['Order_Id','Pickup_Window_Start','Pickup_Window_End',\n",
    "                                  'Dropoff_Window_Start','Dropoff_Window_End','Pickup_Latitude','Pickup_Longitude'\n",
    "                                  ,'Dropoff_Latitude','Dropoff_Longitude'])\n",
    "driversData = pd.read_excel (r'D:\\\\Users\\\\suuser\\\\Desktop\\\\Project Benjamin\\\\Take_home_drivers_data.xlsx') # may need to be modified\n",
    "driversDataFrame = pd.DataFrame(driversData, columns= ['Route_id','Route_Start_Time','Route_End_Time'])\n",
    "\n",
    "a=orderDataFrame[['Pickup_Latitude','Pickup_Longitude','Dropoff_Latitude','Dropoff_Longitude']]"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "### Order Class"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 96,
   "metadata": {},
   "outputs": [],
   "source": [
    "class Order(object):\n",
    "    def __init__(self,orderId,ordertype,o_pick_start,o_pick_end,o_drop_start,o_drop_end,o_pickup_lat,o_pickup_long,o_drop_lat,o_drop_long,):\n",
    "        self.orderId=orderId\n",
    "        self.ordertype=ordertype\n",
    "        self.o_pick_start=o_pick_start\n",
    "        self.o_pick_end=o_pick_end\n",
    "        self.o_drop_start=o_drop_start\n",
    "        self.o_drop_end=o_drop_end\n",
    "        self.o_pickup_lat=o_pickup_lat\n",
    "        self.o_pickup_long=o_pickup_long\n",
    "        self.o_drop_lat=o_drop_lat\n",
    "        self.o_drop_long=o_drop_long\n",
    "    # no need \n",
    "    def __eq__(self,other):\n",
    "        return(self.__dict__==other.__dict__)\n",
    "        "
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "### Route Class"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 97,
   "metadata": {},
   "outputs": [],
   "source": [
    "class Route(object):\n",
    "    route_end_time=0\n",
    "    pickupTime=10/60\n",
    "    dropoffTime=5/60\n",
    "    timePerDistance=5/60 #minutes\n",
    "    # you need to think on these two. However, currently they are working well\n",
    "    distanceBetweenTwoConsecutiveOrders=[]\n",
    "    ArrivalTimesofTheOrdersIncludedWaste=[]\n",
    "    # if a driver come to pickup an order early, needs to wait until the Pickup Window Start; waste time\n",
    "    def __init__(self,route_id,route_start_time,route_end_time):\n",
    "        self.route_id=route_id\n",
    "        self.route_start_time=route_start_time\n",
    "        self.route_end_time=route_end_time\n",
    "        self.route_distance=0\n",
    "        self.totalWasteWaiting=0\n",
    "        self.orderSequence=[]\n",
    "        \n",
    "    def addOrdertoSequence(self,order):\n",
    "        self.orderSequence.append(order)\n",
    "    def removeOrderfromSequence(self,order):\n",
    "        self.orderSequence.remove(order)\n",
    "    # to calculate the total route distance by using a function which is outside of the class ..distanceFunction(o1,o2)\n",
    "    def calculateDistancesAndTotalRouteDistance(self):\n",
    "        self.route_distance=0\n",
    "        self.distanceBetweenTwoConsecutiveOrders=[]\n",
    "        if len(self.orderSequence)==0:\n",
    "            print('this route has 0 element')\n",
    "        else:\n",
    "            for i in range(len(self.orderSequence)-1):\n",
    "                self.distanceBetweenTwoConsecutiveOrders.append(distanceFunction(self.orderSequence[i],self.orderSequence[i+1]))\n",
    "                self.route_distance=self.route_distance+distanceFunction(self.orderSequence[i],self.orderSequence[i+1])\n",
    "    # we need the method below to calculate the arrival time of the orders in the route. Notice that, if the driver go to \n",
    "    # order point earlier than the start time of the time window, the truck must wait until the start time of the time window\n",
    "    # this additional waiting time is expressed as 'totalWasteWaiting' below. \n",
    "    \n",
    "    def DetermineArrivalTimesOfRequests(self):\n",
    "        self.ArrivalTimesofTheOrdersIncludedWaste=[]\n",
    "        self.totalWasteWaiting=0\n",
    "        if len(self.orderSequence)==0:\n",
    "            print('this route has 0 element')\n",
    "        else:\n",
    "            if self.route_start_time < self.orderSequence[0].o_pick_start:\n",
    "                self.ArrivalTimesofTheOrdersIncludedWaste.append(self.orderSequence[0].o_pick_start)\n",
    "                self.totalWasteWaiting=self.totalWasteWaiting+ (self.orderSequence[0].o_pick_start-self.route_start_time)\n",
    "            else:\n",
    "                self.ArrivalTimesofTheOrdersIncludedWaste.append(self.route_start_time)\n",
    "            for i in range(len(self.orderSequence)-1):\n",
    "                if self.orderSequence[i].ordertype=='p':\n",
    "                    optionTravelPlusActTime=self.ArrivalTimesofTheOrdersIncludedWaste[-1]+self.pickupTime+self.distanceBetweenTwoConsecutiveOrders[i]*self.timePerDistance\n",
    "                else:\n",
    "                    optionTravelPlusActTime=self.ArrivalTimesofTheOrdersIncludedWaste[-1]+self.dropoffTime+self.distanceBetweenTwoConsecutiveOrders[i]*self.timePerDistance\n",
    "                if optionTravelPlusActTime < ((self.orderSequence[i+1].o_pick_start)*(self.orderSequence[i+1].ordertype=='p'))+ ((self.orderSequence[i+1].o_drop_start)*(self.orderSequence[i+1].ordertype=='d')):\n",
    "                    self.ArrivalTimesofTheOrdersIncludedWaste.append(((self.orderSequence[i+1].o_pick_start)*(self.orderSequence[i+1].ordertype=='p'))+((self.orderSequence[i+1].o_drop_start)*(self.orderSequence[i+1].ordertype=='d')))\n",
    "                    self.totalWasteWaiting=self.totalWasteWaiting+(((self.orderSequence[i+1].o_pick_start)*(self.orderSequence[i+1].ordertype=='p'))+ ((self.orderSequence[i+1].o_drop_start)*(self.orderSequence[i+1].ordertype=='d'))-optionTravelPlusActTime)\n",
    "                else:\n",
    "                    self.ArrivalTimesofTheOrdersIncludedWaste.append(optionTravelPlusActTime) \n",
    "    # this method is defined not to use deepcopy() which takes relatively long time, really time-consuming\n",
    "    def copyObject(self):\n",
    "        w=Route(self.route_id,self.route_start_time,self.route_end_time)\n",
    "        w.route_distance=self.route_distance\n",
    "        w.totalWasteWaiting=self.totalWasteWaiting\n",
    "        w.orderSequence=self.orderSequence[:]\n",
    "        return(w) \n",
    "            "
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 98,
   "metadata": {},
   "outputs": [
    {
     "data": {
      "text/html": [
       "<div>\n",
       "<style scoped>\n",
       "    .dataframe tbody tr th:only-of-type {\n",
       "        vertical-align: middle;\n",
       "    }\n",
       "\n",
       "    .dataframe tbody tr th {\n",
       "        vertical-align: top;\n",
       "    }\n",
       "\n",
       "    .dataframe thead th {\n",
       "        text-align: right;\n",
       "    }\n",
       "</style>\n",
       "<table border=\"1\" class=\"dataframe\">\n",
       "  <thead>\n",
       "    <tr style=\"text-align: right;\">\n",
       "      <th></th>\n",
       "      <th>Order_Id</th>\n",
       "      <th>Pickup_Window_Start</th>\n",
       "      <th>Pickup_Window_End</th>\n",
       "      <th>Dropoff_Window_Start</th>\n",
       "      <th>Dropoff_Window_End</th>\n",
       "      <th>Pickup_Latitude</th>\n",
       "      <th>Pickup_Longitude</th>\n",
       "      <th>Dropoff_Latitude</th>\n",
       "      <th>Dropoff_Longitude</th>\n",
       "    </tr>\n",
       "  </thead>\n",
       "  <tbody>\n",
       "    <tr>\n",
       "      <th>0</th>\n",
       "      <td>1</td>\n",
       "      <td>10</td>\n",
       "      <td>11</td>\n",
       "      <td>11</td>\n",
       "      <td>13</td>\n",
       "      <td>39.176461</td>\n",
       "      <td>-94.488092</td>\n",
       "      <td>39.167085</td>\n",
       "      <td>-94.501372</td>\n",
       "    </tr>\n",
       "    <tr>\n",
       "      <th>1</th>\n",
       "      <td>8</td>\n",
       "      <td>10</td>\n",
       "      <td>11</td>\n",
       "      <td>11</td>\n",
       "      <td>13</td>\n",
       "      <td>39.176461</td>\n",
       "      <td>-94.488092</td>\n",
       "      <td>39.318614</td>\n",
       "      <td>-94.503761</td>\n",
       "    </tr>\n",
       "    <tr>\n",
       "      <th>2</th>\n",
       "      <td>15</td>\n",
       "      <td>10</td>\n",
       "      <td>11</td>\n",
       "      <td>11</td>\n",
       "      <td>13</td>\n",
       "      <td>39.168461</td>\n",
       "      <td>-94.470092</td>\n",
       "      <td>39.197058</td>\n",
       "      <td>-94.470769</td>\n",
       "    </tr>\n",
       "    <tr>\n",
       "      <th>3</th>\n",
       "      <td>22</td>\n",
       "      <td>10</td>\n",
       "      <td>11</td>\n",
       "      <td>11</td>\n",
       "      <td>14</td>\n",
       "      <td>39.168461</td>\n",
       "      <td>-94.470092</td>\n",
       "      <td>39.162388</td>\n",
       "      <td>-94.546795</td>\n",
       "    </tr>\n",
       "    <tr>\n",
       "      <th>4</th>\n",
       "      <td>29</td>\n",
       "      <td>10</td>\n",
       "      <td>11</td>\n",
       "      <td>11</td>\n",
       "      <td>14</td>\n",
       "      <td>39.168461</td>\n",
       "      <td>-94.470092</td>\n",
       "      <td>39.280901</td>\n",
       "      <td>-94.365953</td>\n",
       "    </tr>\n",
       "  </tbody>\n",
       "</table>\n",
       "</div>"
      ],
      "text/plain": [
       "   Order_Id  Pickup_Window_Start  Pickup_Window_End  Dropoff_Window_Start  \\\n",
       "0         1                   10                 11                    11   \n",
       "1         8                   10                 11                    11   \n",
       "2        15                   10                 11                    11   \n",
       "3        22                   10                 11                    11   \n",
       "4        29                   10                 11                    11   \n",
       "\n",
       "   Dropoff_Window_End  Pickup_Latitude  Pickup_Longitude  Dropoff_Latitude  \\\n",
       "0                  13        39.176461        -94.488092         39.167085   \n",
       "1                  13        39.176461        -94.488092         39.318614   \n",
       "2                  13        39.168461        -94.470092         39.197058   \n",
       "3                  14        39.168461        -94.470092         39.162388   \n",
       "4                  14        39.168461        -94.470092         39.280901   \n",
       "\n",
       "   Dropoff_Longitude  \n",
       "0         -94.501372  \n",
       "1         -94.503761  \n",
       "2         -94.470769  \n",
       "3         -94.546795  \n",
       "4         -94.365953  "
      ]
     },
     "execution_count": 98,
     "metadata": {},
     "output_type": "execute_result"
    }
   ],
   "source": [
    "orderDataFrame.head()\n",
    "#driversDataFrame.head()"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "### to constitute the order objects"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 99,
   "metadata": {},
   "outputs": [],
   "source": [
    "orderObjectList=[]\n",
    "for index, row in orderDataFrame.iterrows():\n",
    "    orderObjectList.append(Order(row['Order_Id'],'p',row['Pickup_Window_Start'],row['Pickup_Window_End'],\n",
    "                           row['Dropoff_Window_Start'],row['Dropoff_Window_End'],row['Pickup_Latitude'],row['Pickup_Longitude'],\n",
    "                           row['Dropoff_Latitude'],row['Dropoff_Longitude']))\n",
    "    orderObjectList.append(Order(row['Order_Id'],'d',row['Pickup_Window_Start'],row['Pickup_Window_End'],\n",
    "                           row['Dropoff_Window_Start'],row['Dropoff_Window_End'],row['Pickup_Latitude'],row['Pickup_Longitude'],\n",
    "                           row['Dropoff_Latitude'],row['Dropoff_Longitude']))\n",
    "\n",
    "#this part is for route objects\n",
    "\n",
    "routeObjectList=[]\n",
    "for index,row in driversDataFrame.iterrows():\n",
    "    routeObjectList.append(Route(row['Route_id'],row['Route_Start_Time'],row['Route_End_Time']))\n",
    "    \n"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 91,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "{'orderId': 8.0, 'ordertype': 'd', 'o_pick_start': 10.0, 'o_pick_end': 11.0, 'o_drop_start': 11.0, 'o_drop_end': 13.0, 'o_pickup_lat': 39.176461, 'o_pickup_long': -94.488092, 'o_drop_lat': 39.3186136452268, 'o_drop_long': -94.5037607791607}\n",
      "<__main__.Order object at 0x0000014EB2119BA8>\n",
      "<__main__.Order object at 0x0000014EB5A34D30>\n",
      "{'orderId': 8.0, 'ordertype': 'd', 'o_pick_start': 10.0, 'o_pick_end': 11.0, 'o_drop_start': 11.0, 'o_drop_end': 13.0, 'o_pickup_lat': 39.176461, 'o_pickup_long': -94.488092, 'o_drop_lat': 39.3186136452268, 'o_drop_long': -94.5037607791607}\n"
     ]
    }
   ],
   "source": [
    "# to check \n",
    "a=orderObjectList[3]\n",
    "print(a.__dict__)\n",
    "print(a)\n",
    "myNewObject=Order(a.orderId,a.ordertype,a.o_pick_start,a.o_pick_end,a.o_drop_start,a.o_drop_end,a.o_pickup_lat,a.o_pickup_long,\n",
    "                 a.o_drop_lat,a.o_drop_long)\n",
    "print(myNewObject)\n",
    "print(myNewObject.__dict__)\n"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "### Function for Haversine Distance between two points\n",
    "\n",
    "used a library called Haversine to calculate the distance between two coordinates"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 100,
   "metadata": {},
   "outputs": [],
   "source": [
    "def distanceFunction(order1,order2):\n",
    "    if order1.ordertype=='p' and order2.ordertype=='p':\n",
    "        coordOrder1=(order1.o_pickup_lat,order1.o_pickup_long)\n",
    "        coordOrder2=(order2.o_pickup_lat,order2.o_pickup_long)\n",
    "        distance=haversine(coordOrder1,coordOrder2)\n",
    "    elif order1.ordertype=='p' and order2.ordertype=='d':\n",
    "        coordOrder1=(order1.o_pickup_lat,order1.o_pickup_long)\n",
    "        coordOrder2=(order2.o_drop_lat,order2.o_drop_long)\n",
    "        distance=haversine(coordOrder1,coordOrder2)\n",
    "    elif order1.ordertype=='d' and order2.ordertype=='p':\n",
    "        coordOrder1=(order1.o_drop_lat,order1.o_drop_long)\n",
    "        coordOrder2=(order2.o_pickup_lat,order2.o_pickup_long)\n",
    "        distance=haversine(coordOrder1,coordOrder2)\n",
    "    else:\n",
    "        coordOrder1=(order1.o_drop_lat,order1.o_drop_long)\n",
    "        coordOrder2=(order2.o_drop_lat,order2.o_drop_long)\n",
    "        distance=haversine(coordOrder1,coordOrder2)\n",
    "    return distance"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "## Initial Routes\n",
    "\n",
    "I have checked the literature for the construction heuristics and found some alternatives which are sequential and parallel construction heuristics. I chose the sequential one since this methods provides better results comparing with the parallel one.\n",
    "\n",
    "the next 5 functions have been used for attaining the initials routes. In the given problem, the time window costraints can be classified as hard constraints. By using the sequential construction heuristics, I assign ~90/103 orders to the routes (all available ones). This process can be improved by using the \"basicGreedyInsertion2\" function which can be seen below. The input of the algorithm is the left orders (normally we use the orders achieved from randomRemovalHeuristic) and the routes achieved from the sequential construction heuristic.\n",
    "\n",
    "\n",
    "the reason to use while(numberOfIterationsWithSameResult<len(routeObjList): is that I could not achieve zero left order while achieving the routes. The parallel cons approach can be tried, or existing approach can be enhanced"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 101,
   "metadata": {},
   "outputs": [],
   "source": [
    "def SequentialConstructionHeuristic(orderObjList,routeObjList):\n",
    "    filledRouteList=[]\n",
    "    for item in routeObjList:\n",
    "        filledRouteList.append(item)\n",
    "    chosenRoute=-1\n",
    "    numberOfIterationsWithSameResult=0\n",
    "    while(numberOfIterationsWithSameResult<len(routeObjList)):\n",
    "        firstLengthOftheOrderObjects=len(orderObjList)\n",
    "        if chosenRoute==len(routeObjList)-1:\n",
    "            chosenRoute=0\n",
    "        else:\n",
    "            chosenRoute=chosenRoute+1\n",
    "        willRemoveList=[]\n",
    "        for i in range(0,len(orderObjList),2):\n",
    "            #filledRouteList[chosenRoute].addOrdertoSequence(orderObjList[i])\n",
    "            #filledRouteList[chosenRoute].addOrdertoSequence(orderObjList[i+1])\n",
    "            #if len(filledRouteList[chosenRoute].orderSequence)==0:\n",
    "            #    print('chosen Route ', chosenRoute+1, 'has O elements ', 'i value is ',i  )\n",
    "            filledRouteList[chosenRoute].orderSequence.append(orderObjList[i])\n",
    "            filledRouteList[chosenRoute].orderSequence.append(orderObjList[i+1])\n",
    "            #for item in filledRouteList[chosenRoute].orderSequence:\n",
    "            #    print(item.orderId, item.ordertype, end=\"--\")\n",
    "            #print()\n",
    "            #candidateRoute=copy.deepcopy(filledRouteList[chosenRoute])\n",
    "            candidateRoute=filledRouteList[chosenRoute].copyObject()\n",
    "            improvedCandidateRoute=HillClimbingRoutingAlgorithm(candidateRoute)\n",
    "            if feasibilityControl(improvedCandidateRoute)==True:\n",
    "                #filledRouteList[chosenRoute]=copy.deepcopy(improvedCandidateRoute)\n",
    "                filledRouteList[chosenRoute]=improvedCandidateRoute.copyObject()\n",
    "                willRemoveList.append(orderObjList[i+1])\n",
    "                willRemoveList.append(orderObjList[i])\n",
    "            else:\n",
    "                #filledRouteList[chosenRoute].removeOrderfromSequence(orderObjList[i])\n",
    "                #filledRouteList[chosenRoute].removeOrderfromSequence(orderObjList[i+1])\n",
    "                del filledRouteList[chosenRoute].orderSequence[-1]\n",
    "                del filledRouteList[chosenRoute].orderSequence[-1]\n",
    "                #print()\n",
    "                #for item in filledRouteList[chosenRoute].orderSequence:\n",
    "                #    print(item.orderId, item.ordertype, end=\"--\")\n",
    "                #print(\"new order option\")\n",
    "        orderObjList=[x for x in orderObjList if x not in willRemoveList]\n",
    "        secondLengthOftheOrderObjects=len(orderObjList)\n",
    "        #for item in willRemoveList:\n",
    "        #    print(item.orderId,item.ordertype,end=\"--\")\n",
    "        if firstLengthOftheOrderObjects==secondLengthOftheOrderObjects:\n",
    "            numberOfIterationsWithSameResult=numberOfIterationsWithSameResult+1\n",
    "        print(len(orderObjList))\n",
    "    return(filledRouteList)\n",
    "                \n",
    "# this function is also used in our main algorithm\n",
    "def feasibilityControl(can1Route):\n",
    "    #canRoute=copy.deepcopy(can1Route)\n",
    "    canRoute=can1Route.copyObject()\n",
    "    feasibilityKey=True\n",
    "    canRoute.calculateDistancesAndTotalRouteDistance()\n",
    "    canRoute.DetermineArrivalTimesOfRequests()\n",
    "    if canRoute.ArrivalTimesofTheOrdersIncludedWaste[-1]+(canRoute.orderSequence[-1].ordertype=='p')*(10/60)+(canRoute.orderSequence[-1].ordertype=='d')*(5/60) > canRoute.route_end_time:\n",
    "        return(False)\n",
    "    for i in range(len(canRoute.orderSequence)):\n",
    "        if canRoute.orderSequence[i].ordertype=='p':\n",
    "            if (canRoute.orderSequence[i].o_pick_start > canRoute.ArrivalTimesofTheOrdersIncludedWaste[i]) or (canRoute.orderSequence[i].o_pick_end < canRoute.ArrivalTimesofTheOrdersIncludedWaste[i]):\n",
    "                feasibilityKey=False\n",
    "                break\n",
    "        else:\n",
    "            if (canRoute.orderSequence[i].o_drop_start > canRoute.ArrivalTimesofTheOrdersIncludedWaste[i]) or (canRoute.orderSequence[i].o_drop_end < canRoute.ArrivalTimesofTheOrdersIncludedWaste[i]):\n",
    "                feasibilityKey=False\n",
    "                break\n",
    "    return(feasibilityKey)  \n",
    "\n"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 102,
   "metadata": {},
   "outputs": [],
   "source": [
    "def HillClimbingRoutingAlgorithm(aRoute):\n",
    "    improvement=0\n",
    "    key=True\n",
    "    #bestRoute=copy.deepcopy(aRoute)\n",
    "    bestRoute=aRoute.copyObject()\n",
    "    #candidateRoute=copy.deepcopy(bestRoute)\n",
    "    candidateRoute=bestRoute.copyObject()\n",
    "    while improvement>0 or key==True:\n",
    "        key=False\n",
    "        #bestRoute=copy.deepcopy(candidateRoute)\n",
    "        bestRoute=candidateRoute.copyObject()\n",
    "        for i in range(len(bestRoute.orderSequence)):\n",
    "            for j in range(i+1,len(bestRoute.orderSequence)):\n",
    "                #candidateOfCandidateRoute=copy.deepcopy(bestRoute)\n",
    "                candidateOfCandidateRoute=bestRoute.copyObject()\n",
    "                # to check the deadline of the orders. \n",
    "                if ((bestRoute.orderSequence[j].o_pick_end*(bestRoute.orderSequence[j].ordertype=='p'))+\n",
    "                (bestRoute.orderSequence[j].o_drop_end*(bestRoute.orderSequence[j].ordertype=='d')))<((bestRoute.orderSequence[i].o_pick_end*(bestRoute.orderSequence[i].ordertype=='p'))+\n",
    "                (bestRoute.orderSequence[i].o_drop_end*(bestRoute.orderSequence[i].ordertype=='d'))) and typeFeasibilityControl(i,j,bestRoute):\n",
    "                    x=candidateOfCandidateRoute.orderSequence[i]\n",
    "                    candidateOfCandidateRoute.orderSequence[i]=candidateOfCandidateRoute.orderSequence[j]\n",
    "                    candidateOfCandidateRoute.orderSequence[j]=x\n",
    "                if costFunctionforHG(candidateOfCandidateRoute)<costFunctionforHG(candidateRoute):\n",
    "                    #candidateRoute=copy.deepcopy(candidateOfCandidateRoute)\n",
    "                    candidateRoute=candidateOfCandidateRoute.copyObject()\n",
    "        improvement=costFunctionforHG(bestRoute)-costFunctionforHG(candidateRoute)\n",
    "    return(bestRoute)           \n",
    "# (total route duration*weight1) + (total number of time window violations in the route*weight2)\n",
    "def costFunctionforHG(aRoute):\n",
    "    # these values can be tuned\n",
    "    weight1=0.9\n",
    "    weight2=0.1\n",
    "    aRoute.calculateDistancesAndTotalRouteDistance()\n",
    "    aRoute.DetermineArrivalTimesOfRequests()\n",
    "    totalDuration=aRoute.ArrivalTimesofTheOrdersIncludedWaste[-1]+ ((aRoute.orderSequence[-1].ordertype=='p')*aRoute.pickupTime)+((aRoute.orderSequence[-1].ordertype=='d')*aRoute.dropoffTime) - (aRoute.route_start_time)\n",
    "    totalNumberofTWViolations=0\n",
    "    for i in range(len(aRoute.orderSequence)):\n",
    "        if aRoute.ArrivalTimesofTheOrdersIncludedWaste[i] > (aRoute.orderSequence[i].ordertype=='p')*aRoute.orderSequence[i].o_pick_start+(aRoute.orderSequence[i].ordertype=='d')*aRoute.orderSequence[i].o_drop_start:\n",
    "            totalNumberofTWViolations=totalNumberofTWViolations+1\n",
    "    totalCost=(weight1*totalDuration) + (weight2*totalNumberofTWViolations)\n",
    "    #totalWasteWaiting\n",
    "    return(totalCost)\n",
    "\n",
    "def typeFeasibilityControl(firstIn,secondIn,route):\n",
    "    feasKey=True\n",
    "    #copyOftheRoute=copy.deepcopy(route)\n",
    "    copyOftheRoute=route.copyObject()\n",
    "    a=copyOftheRoute.orderSequence[firstIn]\n",
    "    copyOftheRoute.orderSequence[firstIn]=copyOftheRoute.orderSequence[secondIn]\n",
    "    copyOftheRoute.orderSequence[secondIn]=a\n",
    "    for i in range(len(copyOftheRoute.orderSequence)):\n",
    "        for j in range(i+1,len(copyOftheRoute.orderSequence)):\n",
    "            if(copyOftheRoute.orderSequence[i].orderId==copyOftheRoute.orderSequence[j].orderId) and (copyOftheRoute.orderSequence[i].ordertype=='d'):\n",
    "                feasKey=False\n",
    "    return(feasKey)\n",
    "            \n",
    "    \n"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "The numbers you will see after executing the next cell are the number of left orders. It's decreasing at least 30. After that no order can be assigned to any route. To detect the orders which were not assigned to any route, I used the next function: findNonExistingOrders"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 103,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "194\n",
      "178\n",
      "164\n",
      "152\n",
      "136\n",
      "120\n",
      "110\n",
      "94\n",
      "78\n",
      "68\n",
      "58\n",
      "52\n",
      "46\n",
      "30\n",
      "30\n",
      "30\n",
      "30\n",
      "30\n",
      "30\n",
      "30\n",
      "30\n",
      "30\n",
      "30\n",
      "30\n",
      "30\n",
      "30\n",
      "30\n",
      "30\n",
      "\n",
      "\n",
      "1.0 p8.0 p29.0 p1.0 d8.0 d29.0 d12.0 p6.0 p27.0 p6.0 d12.0 d27.0 d\n",
      "15.0 p22.0 p36.0 p50.0 p15.0 d22.0 d50.0 d36.0 d75.0 p13.0 p20.0 p34.0 p75.0 d13.0 d20.0 d34.0 d\n",
      "43.0 p57.0 p64.0 p57.0 d43.0 d2.0 p64.0 d2.0 d5.0 p19.0 p26.0 p19.0 d5.0 d26.0 d\n",
      "71.0 p30.0 p37.0 p94.0 p71.0 d30.0 d37.0 d94.0 d7.0 p28.0 p7.0 d28.0 d\n",
      "78.0 p78.0 d9.0 p23.0 p3.0 p23.0 d9.0 d3.0 d41.0 p48.0 p62.0 p48.0 d14.0 p62.0 d41.0 d14.0 d\n",
      "85.0 p58.0 p72.0 p24.0 p31.0 p58.0 d85.0 d24.0 d72.0 d31.0 d55.0 p21.0 p49.0 p55.0 d21.0 d49.0 d\n",
      "16.0 p10.0 p101.0 p16.0 d10.0 d101.0 d35.0 p56.0 p56.0 d35.0 d\n",
      "44.0 p17.0 p38.0 p11.0 p18.0 p25.0 p44.0 d17.0 d96.0 p18.0 d38.0 d11.0 d25.0 d63.0 p96.0 d63.0 d\n",
      "51.0 p45.0 p52.0 p59.0 p52.0 d45.0 d51.0 d59.0 d69.0 p76.0 p83.0 p77.0 p69.0 d83.0 d76.0 d77.0 d\n",
      "66.0 p39.0 p46.0 p66.0 d39.0 d46.0 d42.0 p70.0 p42.0 d70.0 d\n",
      "73.0 p74.0 p4.0 p33.0 p73.0 d74.0 d82.0 p4.0 d33.0 d82.0 d\n",
      "32.0 p61.0 p103.0 p61.0 d32.0 d103.0 d\n",
      "40.0 p90.0 p97.0 p90.0 d40.0 d97.0 d\n",
      "92.0 p99.0 p92.0 d79.0 p86.0 p100.0 p79.0 d99.0 d86.0 d100.0 d84.0 p91.0 p98.0 p91.0 d84.0 d98.0 d"
     ]
    }
   ],
   "source": [
    "fRouL=SequentialConstructionHeuristic(orderObjectList,routeObjectList)\n",
    "print()\n",
    "for objects2 in fRouL:\n",
    "    print()\n",
    "    for item in objects2.orderSequence:\n",
    "        print(item.orderId, item.ordertype,end=\"\")"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 105,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "[47.0, 53.0, 54.0, 60.0, 65.0, 67.0, 68.0, 80.0, 81.0, 87.0, 88.0, 89.0, 93.0, 95.0, 102.0]\n"
     ]
    }
   ],
   "source": [
    "def findNonExistingOrders(routeList,orderObjects):\n",
    "    myList=[]\n",
    "    newList=[]\n",
    "    key=False\n",
    "    for orderIds in orderObjects:\n",
    "        key=False\n",
    "        for item in routeList:\n",
    "            for order in item.orderSequence:\n",
    "                if orderIds.orderId == order.orderId:\n",
    "                    key=True\n",
    "        if key==False:\n",
    "            myList.append(orderIds.orderId)\n",
    "    newList=list(np.unique(myList))\n",
    "    return(newList)\n",
    "\n",
    "\n",
    "unusedOrderList=findNonExistingOrders(fRouL,orderObjectList)\n",
    "print(unusedOrderList,sep=\"/n\")\n",
    "    "
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 106,
   "metadata": {},
   "outputs": [],
   "source": [
    "orderObjectList=[]\n",
    "for index, row in orderDataFrame.iterrows():\n",
    "    orderObjectList.append(Order(row['Order_Id'],'p',row['Pickup_Window_Start'],row['Pickup_Window_End'],\n",
    "                           row['Dropoff_Window_Start'],row['Dropoff_Window_End'],row['Pickup_Latitude'],row['Pickup_Longitude'],\n",
    "                           row['Dropoff_Latitude'],row['Dropoff_Longitude']))\n",
    "    orderObjectList.append(Order(row['Order_Id'],'d',row['Pickup_Window_Start'],row['Pickup_Window_End'],\n",
    "                           row['Dropoff_Window_Start'],row['Dropoff_Window_End'],row['Pickup_Latitude'],row['Pickup_Longitude'],\n",
    "                           row['Dropoff_Latitude'],row['Dropoff_Longitude']))\n",
    "\n",
    "#this part is for route objects\n",
    "\n",
    "routeObjectList=[]\n",
    "for index,row in driversDataFrame.iterrows():\n",
    "    routeObjectList.append(Route(row['Route_id'],row['Route_Start_Time'],row['Route_End_Time']))\n",
    "    \n"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "## LARGE NEIGH. SEARCH ALG\n",
    "\n",
    "Random removal and basic greddy algorithms have been used for removal and insertion methods.\n",
    "\n",
    "Some solutions with less requests than the previous one have been accepted by assigning a cost weight to the number of orders/requests which are not assigned. Total distance is another part of the total cost. The parameters are chosen roughly, so needs to be tuned. "
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 111,
   "metadata": {},
   "outputs": [],
   "source": [
    "def LargeNeighborhoodSearch(iterNumber,initialRoute,percentageOfDestroy, orderObjects):\n",
    "    \n",
    "    currentRoute=copyListOfOrders(initialRoute)\n",
    "    #currentRoute=initialRoute.copyObject()\n",
    "    bestRoute=copyListOfOrders(currentRoute)\n",
    "    iteration=0\n",
    "    #timeout=time.time()+30 #the alg gonna end after 2 hours\n",
    "    while iteration < iterNumber:\n",
    "        print('iteration: ', iteration, 'best route objective: ', objectiveCostMethod(bestRoute),' length: ',len(findNonExistingOrders(bestRoute,orderObjects)))\n",
    "        destroyedRoutes, destroyedOrders=randomRemovalMethod(currentRoute,percentageOfDestroy)\n",
    "        unusedOrderList=findNonExistingOrders(currentRoute,orderObjects)\n",
    "        destroyedAndUnusedOrders=list(set(destroyedOrders + unusedOrderList))\n",
    "        leftOrders, temproraryRoute, feasibility= basicGreedyInsertion2(destroyedRoutes, destroyedAndUnusedOrders, orderObjects)\n",
    "        print('number of left orders',len(leftOrders))\n",
    "        #if feasibility==True and lengthControl(initialRoute)==lengthControl(temproraryRoute):\n",
    "        currentRoute=copyListOfOrders(temproraryRoute)\n",
    "        leftOrdersForBest=findNonExistingOrders(bestRoute,orderObjects)\n",
    "        if objectiveCostMethod2(temproraryRoute,leftOrders)<= objectiveCostMethod2(bestRoute,leftOrdersForBest):\n",
    "            bestRoute=copyListOfOrders(temproraryRoute)        \n",
    "        iteration=iteration+1\n",
    "    return(bestRoute)\n",
    "    \n",
    "# worst removal can be added\n",
    "def randomRemovalMethod(currentRoute,percentageOfDestroy):\n",
    "    curRoute=copyListOfOrders(currentRoute)\n",
    "    print('removal')\n",
    "    #curRoute=currentRoute.copyObject()\n",
    "    numberofTotalOrders=0\n",
    "    allOrderIdsInRoute=[]\n",
    "    for item in curRoute:\n",
    "        numberofTotalOrders=numberofTotalOrders+len(item.orderSequence)\n",
    "        for orderx in item.orderSequence:\n",
    "            allOrderIdsInRoute.append(orderx.orderId)\n",
    "            #allOrderIdsInRoute.append(orderx)\n",
    "    #print(*allOrderIdsInRoute, sep='\\n')\n",
    "    allOrderIdsInRouteNoRepeat=list(np.unique(allOrderIdsInRoute))  \n",
    "    #print(*allOrderIdsInRouteNoRepeat, sep='\\n')\n",
    "    numberOfOrdersGonnaDestroy=round(numberofTotalOrders*percentageOfDestroy)\n",
    "    destroyedOrders=random.sample(allOrderIdsInRouteNoRepeat,numberOfOrdersGonnaDestroy)\n",
    "    #destroyedOrders=random.sample(allOrderIdsInRoute,numberOfOrdersGonnaDestroy)\n",
    "    for destOrderx in destroyedOrders:\n",
    "        for item in curRoute:\n",
    "            for orderx in reversed(item.orderSequence):\n",
    "                if orderx.orderId==destOrderx:\n",
    "                    item.orderSequence.remove(orderx)\n",
    "    # can be used for speeding up the alg\n",
    "    if 1==2:      \n",
    "        for item in curRoute:\n",
    "            for orderx in item.orderSequence:\n",
    "                for destOrderx in destroyedOrders:\n",
    "                   #if orderx==destOrderx:\n",
    "                    if orderx.orderId==destOrderx:\n",
    "                        destroyedOrders.remove(destOrderx)\n",
    "                        item.orderSequence.remove(orderx)\n",
    "    return(curRoute,destroyedOrders)\n",
    "\n",
    "# this is a simpler approach. we used the basicGreedyInsertion2 function. The only difference is that, we choose a removed order\n",
    "# to insert a route respectively in basic greedy insertion. In 2, we check all the options, anf after that we choose the one\n",
    "# with minimum cost. Third apprach can be regreting insertion which considers the difference best and second best options\n",
    "\n",
    "def basicGreedyInsertion(destRoute, destOrdersIds, orderObjects): # simple one, by one order by at each iteration\n",
    "    print('Basic greedy')\n",
    "    noMoreRequestInserted=True\n",
    "    feasibleRoutesFound=False\n",
    "    #print('at first', len(destOrdersIds))\n",
    "    while len(destOrdersIds)>0 and noMoreRequestInserted==True:\n",
    "        print('length of left orders', len(destOrdersIds))\n",
    "        for orderItem in reversed(destOrdersIds):\n",
    "            firstLength=len(destOrdersIds)\n",
    "            routeAndCosts=[]\n",
    "            for routeItem in destRoute:\n",
    "                feasibleSolutionAchieved,minimumCostValue,newCanRoute=findBestPositionandItsCostValue(orderItem,routeItem,orderObjects)\n",
    "                costAndRoute={\n",
    "                    'cost':minimumCostValue,\n",
    "                    ########################################!!!!!!!!!!!!!!!!bak##########o kadar da önemli değil\n",
    "                    #'canRoute':copy.deepcopy(newCanRoute),\n",
    "                    'canRoute':newCanRoute.copyObject(),\n",
    "                    'correspondingRouteIndex':destRoute.index(routeItem),\n",
    "                    'feasible':feasibleSolutionAchieved,\n",
    "                }\n",
    "                routeAndCosts.append(costAndRoute)\n",
    "            minCostValue=99999999999 \n",
    "            feasibleOrNot=False\n",
    "            for itemCostRouteAndIndex in routeAndCosts:\n",
    "                if itemCostRouteAndIndex['cost']<minCostValue:\n",
    "                    minCostValue=itemCostRouteAndIndex['cost']\n",
    "                    candidate=itemCostRouteAndIndex['canRoute']\n",
    "                    index=itemCostRouteAndIndex['correspondingRouteIndex']\n",
    "                    feasibleOrNot=itemCostRouteAndIndex['feasible']\n",
    "            if feasibleOrNot==True:\n",
    "                #destRoute[index]=copy.deepcopy(candidate)\n",
    "                destRoute[index]=candidate.copyObject()\n",
    "                destOrdersIds.remove(orderItem)\n",
    "        secondLenght=len(destOrdersIds)    \n",
    "        if firstLength==secondLenght:\n",
    "            noMoreRequestInserted=False\n",
    "    if len(destOrdersIds)==0:\n",
    "        feasibleRoutesFound=True       \n",
    "    return(destRoute, feasibleRoutesFound)\n",
    "\n",
    "# this function is used in greedy insertion\n",
    "def findBestPositionandItsCostValue(orderNumber,route,orderObjects):\n",
    "    #print('Basic greedy sub alg')\n",
    "    ordersToInsert=[]\n",
    "    canRouteAndCostValueList=[]\n",
    "    feasibleSolutionAchieved=True\n",
    "    for orderItem in orderObjects:\n",
    "        if orderItem.orderId==orderNumber:\n",
    "            ordersToInsert.append(orderItem)\n",
    "    for i in range(len(route.orderSequence)+1):\n",
    "        #print('i: ',i)\n",
    "        for j in range(i+1,len(route.orderSequence)+2):\n",
    "            #print('j: ',j)\n",
    "            #candidateRoute=copy.deepcopy(route)\n",
    "            candidateRoute=route.copyObject()\n",
    "            #print(\"before\")\n",
    "            #print(candidateRoute.__dict__)\n",
    "            candidateRoute.orderSequence.insert(i,ordersToInsert[0])\n",
    "            candidateRoute.orderSequence.insert(j,ordersToInsert[1])\n",
    "            #print('after modifying')\n",
    "            #for orders in candidateRoute.orderSequence:\n",
    "            #    print(orders.orderId, orders.ordertype,end=\"\")\n",
    "            #print()\n",
    "            #candidateRoute.calculateDistancesAndTotalRouteDistance()\n",
    "            #candidateRoute.DetermineArrivalTimesOfRequests()\n",
    "            \n",
    "            #print(candidateRoute.__dict__)\n",
    "            candidateRoute.calculateDistancesAndTotalRouteDistance()\n",
    "            candidateRoute.DetermineArrivalTimesOfRequests()\n",
    "            if(feasibilityControl(candidateRoute)==True):\n",
    "                \n",
    "                candidateRouteAndCostValue={\n",
    "                    'canRoute':candidateRoute,\n",
    "                    'cost':candidateRoute.route_distance,\n",
    "                }\n",
    "                canRouteAndCostValueList.append(candidateRouteAndCostValue)\n",
    "            else:\n",
    "                candidateRouteAndCostValue={\n",
    "                    'canRoute':candidateRoute,\n",
    "                    'cost':99999999999,\n",
    "                }\n",
    "                canRouteAndCostValueList.append(candidateRouteAndCostValue)\n",
    "    minCostValue=99999999999\n",
    "    candRoute=route.copyObject()\n",
    "    #candRoute=copy.deepcopy(route)\n",
    "    for item in canRouteAndCostValueList:\n",
    "        if item['cost']<=minCostValue:\n",
    "            minCostValue=item['cost']\n",
    "            candRoute=item['canRoute']\n",
    "    if minCostValue == 99999999999:\n",
    "        feasibleSolutionAchieved=False\n",
    "    return(feasibleSolutionAchieved,minCostValue,candRoute)\n",
    "             \n",
    "# total objective cost values of all routes\n",
    "def objectiveCostMethod(route):\n",
    "    objectiveCost=0\n",
    "    for item in route:\n",
    "        objectiveCost=objectiveCost+item.route_distance\n",
    "    return(objectiveCost) \n",
    "\n",
    "def objectiveCostMethod2(route,leftOrdersList):\n",
    "    weightForTotalDistance=0.1\n",
    "    weightForNumberOfUnusedOrders=0.5\n",
    "    totalDistance=0\n",
    "    for item in route:\n",
    "        totalDistance=totalDistance+item.route_distance\n",
    "    ObjectiveCost=weightForTotalDistance*totalDistance+weightForNumberOfUnusedOrders*len(leftOrdersList)\n",
    "    return(ObjectiveCost)\n",
    "\n",
    "def lengthControl(rou):\n",
    "    totalLengthRou=0\n",
    "    for item in rou:\n",
    "        totalLengthRou=totalLengthRou+len(item.orderSequence)\n",
    "    return(totalLengthRou)\n",
    "\n",
    "def copyListOfOrders(routeList):\n",
    "    copiedRouteList=[]\n",
    "    for routeElement in routeList:\n",
    "        copiedRouteList.append(routeElement.copyObject())\n",
    "    return copiedRouteList\n",
    "    "
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "### Basic Greedy Insertion"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 109,
   "metadata": {},
   "outputs": [],
   "source": [
    "def basicGreedyInsertion2(destRoute, destOrdersIds, orderObjects): \n",
    "    print('Basic greedy')\n",
    "    noMoreRequestInserted=True\n",
    "    feasibleRoutesFound=False\n",
    "    #print('at first', len(destOrdersIds))\n",
    "    while len(destOrdersIds)>0 and noMoreRequestInserted==True:\n",
    "        itemRouteAndCostX=[]\n",
    "        print('length of left orders', len(destOrdersIds))\n",
    "        for orderItem in reversed(destOrdersIds):\n",
    "            firstLength=len(destOrdersIds)\n",
    "            routeAndCosts=[]\n",
    "            for routeItem in destRoute:\n",
    "                feasibleSolutionAchieved,minimumCostValue,newCanRoute=findBestPositionandItsCostValue(orderItem,routeItem,orderObjects)\n",
    "                costAndRoute={\n",
    "                    'cost':minimumCostValue,\n",
    "                    ########################################!!!!!!!!!!!!!!!!bak##########o kadar da önemli değil\n",
    "                    #'canRoute':copy.deepcopy(newCanRoute),\n",
    "                    'canRoute':newCanRoute.copyObject(),\n",
    "                    'correspondingRouteIndex':destRoute.index(routeItem),\n",
    "                    'feasible':feasibleSolutionAchieved,\n",
    "                }\n",
    "                routeAndCosts.append(costAndRoute)\n",
    "            minCostValue=99999999999 \n",
    "            feasibleOrNot=False\n",
    "            candidate=newCanRoute.copyObject()\n",
    "            index=0\n",
    "            for itemCostRouteAndIndex in routeAndCosts:\n",
    "                if itemCostRouteAndIndex['cost']<minCostValue:\n",
    "                    minCostValue=itemCostRouteAndIndex['cost']\n",
    "                    candidate=itemCostRouteAndIndex['canRoute']\n",
    "                    index=itemCostRouteAndIndex['correspondingRouteIndex']\n",
    "                    feasibleOrNot=itemCostRouteAndIndex['feasible']\n",
    "            orderIndexesRoutesCosts={\n",
    "                'relatedOrderId':orderItem,\n",
    "                'cost':minCostValue,\n",
    "                'route':candidate.copyObject(),\n",
    "                'routeIndex':index,\n",
    "                'feasibility':feasibleOrNot\n",
    "            }\n",
    "            itemRouteAndCostX.append(orderIndexesRoutesCosts)\n",
    "        costMin=99999999999\n",
    "        feasC=False\n",
    "        for element in itemRouteAndCostX:\n",
    "            if element['cost']< costMin:\n",
    "                orderIdXX=element['relatedOrderId']\n",
    "                costMin=element['cost']\n",
    "                chosenRoute=element['route']\n",
    "                routeSIndex=element['routeIndex']\n",
    "                feasC=element['feasibility']\n",
    "        if feasC==True:\n",
    "            destRoute[routeSIndex]=chosenRoute.copyObject()\n",
    "            destOrdersIds.remove(orderIdXX)\n",
    "        secondLenght=len(destOrdersIds)   \n",
    "        if firstLength==secondLenght:\n",
    "            noMoreRequestInserted=False\n",
    "    if len(destOrdersIds)==0:\n",
    "        feasibleRoutesFound=True       \n",
    "    return(destOrdersIds, destRoute, feasibleRoutesFound)"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 112,
   "metadata": {},
   "outputs": [],
   "source": [
    "orderObjectList=[]\n",
    "for index, row in orderDataFrame.iterrows():\n",
    "    orderObjectList.append(Order(row['Order_Id'],'p',row['Pickup_Window_Start'],row['Pickup_Window_End'],\n",
    "                           row['Dropoff_Window_Start'],row['Dropoff_Window_End'],row['Pickup_Latitude'],row['Pickup_Longitude'],\n",
    "                           row['Dropoff_Latitude'],row['Dropoff_Longitude']))\n",
    "    orderObjectList.append(Order(row['Order_Id'],'d',row['Pickup_Window_Start'],row['Pickup_Window_End'],\n",
    "                           row['Dropoff_Window_Start'],row['Dropoff_Window_End'],row['Pickup_Latitude'],row['Pickup_Longitude'],\n",
    "                           row['Dropoff_Latitude'],row['Dropoff_Longitude']))\n",
    "\n",
    "\n",
    "routeObjectList=[]\n",
    "for index,row in driversDataFrame.iterrows():\n",
    "    routeObjectList.append(Route(row['Route_id'],row['Route_Start_Time'],row['Route_End_Time']))\n",
    "    \n"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "Execution"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 87,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "iteration:  0 best route objective:  823.9593011036338  length:  15\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 33\n",
      "length of left orders 32\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "number of left orders 16\n",
      "iteration:  1 best route objective:  801.3734879804665  length:  16\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 33\n",
      "length of left orders 32\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "number of left orders 14\n",
      "iteration:  2 best route objective:  785.9339347248822  length:  14\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 32\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  3 best route objective:  734.5973393149231  length:  13\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  4 best route objective:  724.9352161948885  length:  13\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  5 best route objective:  708.9437064123002  length:  13\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  6 best route objective:  678.6636647989596  length:  13\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "number of left orders 12\n",
      "iteration:  7 best route objective:  682.631520951451  length:  12\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "number of left orders 15\n",
      "iteration:  8 best route objective:  682.631520951451  length:  12\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 33\n",
      "length of left orders 32\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  9 best route objective:  662.9565226250376  length:  13\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "number of left orders 14\n",
      "iteration:  10 best route objective:  604.1342330023531  length:  14\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 32\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  11 best route objective:  604.1342330023531  length:  14\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  12 best route objective:  604.1342330023531  length:  14\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  13 best route objective:  604.3927766144506  length:  13\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n"
     ]
    },
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  14 best route objective:  604.3927766144506  length:  13\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "number of left orders 14\n",
      "iteration:  15 best route objective:  575.8923379814453  length:  14\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 32\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  16 best route objective:  575.8923379814453  length:  14\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "number of left orders 15\n",
      "iteration:  17 best route objective:  555.710290602618  length:  15\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 33\n",
      "length of left orders 32\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  18 best route objective:  555.710290602618  length:  15\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  19 best route objective:  555.710290602618  length:  15\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  20 best route objective:  555.710290602618  length:  15\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "number of left orders 13\n",
      "iteration:  21 best route objective:  555.710290602618  length:  15\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 31\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "number of left orders 12\n",
      "iteration:  22 best route objective:  555.710290602618  length:  15\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "number of left orders 10\n",
      "iteration:  23 best route objective:  555.710290602618  length:  15\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "number of left orders 10\n",
      "iteration:  24 best route objective:  555.710290602618  length:  15\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "length of left orders 8\n",
      "number of left orders 8\n",
      "iteration:  25 best route objective:  568.1163842717929  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "length of left orders 8\n",
      "number of left orders 8\n",
      "iteration:  26 best route objective:  568.1163842717929  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "length of left orders 8\n",
      "number of left orders 8\n",
      "iteration:  27 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n"
     ]
    },
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "length of left orders 8\n",
      "number of left orders 8\n",
      "iteration:  28 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "length of left orders 8\n",
      "number of left orders 8\n",
      "iteration:  29 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "length of left orders 8\n",
      "number of left orders 8\n",
      "iteration:  30 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "length of left orders 8\n",
      "number of left orders 8\n",
      "iteration:  31 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "number of left orders 9\n",
      "iteration:  32 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "number of left orders 9\n",
      "iteration:  33 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "length of left orders 8\n",
      "number of left orders 8\n",
      "iteration:  34 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "number of left orders 9\n",
      "iteration:  35 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "length of left orders 8\n",
      "number of left orders 8\n",
      "iteration:  36 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "length of left orders 9\n",
      "number of left orders 9\n",
      "iteration:  37 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "number of left orders 10\n",
      "iteration:  38 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "number of left orders 11\n",
      "iteration:  39 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "number of left orders 12\n",
      "iteration:  40 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "number of left orders 10\n",
      "iteration:  41 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 29\n"
     ]
    },
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "number of left orders 12\n",
      "iteration:  42 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "number of left orders 11\n",
      "iteration:  43 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "number of left orders 11\n",
      "iteration:  44 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "number of left orders 10\n",
      "iteration:  45 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "number of left orders 10\n",
      "iteration:  46 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "number of left orders 11\n",
      "iteration:  47 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "length of left orders 11\n",
      "length of left orders 10\n",
      "number of left orders 10\n",
      "iteration:  48 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "number of left orders 12\n",
      "iteration:  49 best route objective:  559.6409629973518  length:  8\n",
      "removal\n",
      "Basic greedy\n",
      "length of left orders 30\n",
      "length of left orders 29\n",
      "length of left orders 28\n",
      "length of left orders 27\n",
      "length of left orders 26\n",
      "length of left orders 25\n",
      "length of left orders 24\n",
      "length of left orders 23\n",
      "length of left orders 22\n",
      "length of left orders 21\n",
      "length of left orders 20\n",
      "length of left orders 19\n",
      "length of left orders 18\n",
      "length of left orders 17\n",
      "length of left orders 16\n",
      "length of left orders 15\n",
      "length of left orders 14\n",
      "length of left orders 13\n",
      "length of left orders 12\n",
      "number of left orders 12\n"
     ]
    }
   ],
   "source": [
    "#def LargeNeighborhoodSearch(iterNumber,initialRoute,percentageOfDestroy, orderObjects):\n",
    "\n",
    "LNOutput=LargeNeighborhoodSearch(10,fRouL,0.10, orderObjectList)"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 89,
   "metadata": {},
   "outputs": [],
   "source": [
    "def writeTheResults(RouteObjectsList,orderObjects):\n",
    "    \n",
    "    routeIds=[]\n",
    "    routeStartTimes=[]\n",
    "    routeEndTimes=[]\n",
    "    routeDistances=[]\n",
    "    orderIds=[] \n",
    "    orderTypes=[] \n",
    "    orderPickupStartTime=[] \n",
    "    orderPickupEndTime=[]\n",
    "    orderDropoffStartTime=[]\n",
    "    orderDropoffEndTime=[]\n",
    "    orderPickupLatitude=[]\n",
    "    orderPickupLongitude=[]\n",
    "    orderDropoffLatitude=[]\n",
    "    orderDropoffLongitude=[]\n",
    "    \n",
    "    for element in RouteObjectsList:\n",
    "        routeIds.append(element.route_id)\n",
    "        routeStartTimes.append(element.route_start_time)\n",
    "        routeEndTimes.append(element.route_end_time)\n",
    "        routeDistances.append(element.route_distance)\n",
    "        element.calculateDistancesAndTotalRouteDistance()\n",
    "        element.DetermineArrivalTimesOfRequests()\n",
    "        oID=[]\n",
    "        oTy=[]\n",
    "        oPST=[]\n",
    "        oPET=[]\n",
    "        oDST=[]\n",
    "        oDET=[]\n",
    "        oPLa=[]\n",
    "        oPLo=[]\n",
    "        oDLa=[]\n",
    "        oDLo=[]\n",
    "        for item in element.orderSequence:\n",
    "            oID.append(item.orderId)\n",
    "            oTy.append(item.ordertype)\n",
    "            s=[i for i, n in enumerate(orderObjects) if n.orderId==item.orderId and n.ordertype=='p']\n",
    "            oPST.append(orderObjects[s[0]].o_pick_start)\n",
    "            oPET.append(orderObjects[s[0]].o_pick_end)\n",
    "            oDST.append(orderObjects[s[0]].o_drop_start)\n",
    "            oDET.append(orderObjects[s[0]].o_drop_end)\n",
    "            oPLa.append(orderObjects[s[0]].o_pickup_lat)\n",
    "            oPLo.append(orderObjects[s[0]].o_pickup_long)\n",
    "            oDLa.append(orderObjects[s[0]].o_drop_lat)\n",
    "            oDLo.append(orderObjects[s[0]].o_drop_long)        \n",
    "        orderIds.append(oID)\n",
    "        orderTypes.append(oTy)  \n",
    "        orderPickupStartTime.append(oPST)\n",
    "        orderPickupEndTime.append(oPET)\n",
    "        orderDropoffStartTime.append(oDST)\n",
    "        orderDropoffEndTime.append(oDET)\n",
    "        orderPickupLatitude.append(oPLa)\n",
    "        orderPickupLongitude.append(oPLo)\n",
    "        orderDropoffLatitude.append(oDLa)\n",
    "        orderDropoffLongitude.append(oDLo)\n",
    "    \n",
    "    with open(\"outPut.txt\",\"w\") as output:\n",
    "        output.write(\"Route Ids-Route Start Times-Route End Times-Total Route Distances\")\n",
    "        output.write(\"\\n\")\n",
    "        for i in range(len(routeIds)):\n",
    "            output.write(str(routeIds[i])+\"   \"+str(routeStartTimes[i])+\"   \"+str(routeEndTimes[i])+\"   \"+str(routeDistances[i])+\"\\n\")\n",
    " \n",
    "        output.write(\"Order Ids\")\n",
    "        output.write(\"\\n\")\n",
    "        for element in orderIds:\n",
    "            output.write(str(element)+\"\\n\")\n",
    "            \n",
    "        output.write(\"\\n\")\n",
    "        output.write(\"Order Types\")\n",
    "        output.write(\"\\n\")\n",
    "        for element in orderTypes:\n",
    "            output.write(str(element)+\"\\n\")\n",
    "            \n",
    "        output.write(\"\\n\")\n",
    "        output.write(\"orderPickupStartTime\")\n",
    "        output.write(\"\\n\")\n",
    "        for element in orderPickupStartTime:\n",
    "            output.write(str(element)+\"\\n\")\n",
    "            \n",
    "        output.write(\"\\n\")\n",
    "        output.write(\"orderPickupEndTime\")\n",
    "        output.write(\"\\n\")\n",
    "        for element in orderPickupEndTime:\n",
    "            output.write(str(element)+\"\\n\")\n",
    "            \n",
    "        output.write(\"\\n\")\n",
    "        output.write(\"Arrival Times to pick and dropoff coordinates\")\n",
    "        output.write(\"\\n\")        \n",
    "        for item in RouteObjectsList:\n",
    "            output.write(str(item.ArrivalTimesofTheOrdersIncludedWaste)+\"\\n\")\n",
    "        \n",
    "        output.write(\"\\n\")\n",
    "        output.write(\"orderDropoffStartTime\")\n",
    "        output.write(\"\\n\")\n",
    "        for element in orderDropoffStartTime:\n",
    "            output.write(str(element)+\"\\n\")\n",
    "            \n",
    "        output.write(\"\\n\")\n",
    "        output.write(\"orderDropoffEndTime\")\n",
    "        output.write(\"\\n\")\n",
    "        for element in orderDropoffEndTime:\n",
    "            output.write(str(element)+\"\\n\")  \n",
    "            \n",
    "        output.write(\"\\n\")\n",
    "        output.write(\"orderPickupLatitude\")\n",
    "        output.write(\"\\n\")\n",
    "        for element in orderPickupLatitude:\n",
    "            output.write(str(element)+\"\\n\") \n",
    "            orderPickupLongitude\n",
    "        \n",
    "        output.write(\"\\n\")\n",
    "        output.write(\"orderPickupLongitude\")\n",
    "        output.write(\"\\n\")\n",
    "        for element in orderPickupLongitude:\n",
    "            output.write(str(element)+\"\\n\")         \n",
    "        \n",
    "        output.write(\"\\n\")\n",
    "        output.write(\"orderDropoffLatitude\")\n",
    "        output.write(\"\\n\")\n",
    "        for element in orderDropoffLatitude:\n",
    "            output.write(str(element)+\"\\n\")\n",
    "            \n",
    "        output.write(\"\\n\")\n",
    "        output.write(\"orderDropoffLongitude\")\n",
    "        output.write(\"\\n\")\n",
    "        for element in orderDropoffLongitude:\n",
    "            output.write(str(element)+\"\\n\")            \n",
    "        \n",
    "\n",
    "\n"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 91,
   "metadata": {},
   "outputs": [],
   "source": [
    "writeTheResults(LNOutput,orderObjectList)"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 88,
   "metadata": {
    "scrolled": true
   },
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "\n",
      "22.0 p64.0 p51.0 p51.0 d64.0 d22.0 d4.0 p5.0 p33.0 p61.0 p4.0 d61.0 d5.0 d33.0 d\n",
      "99.0 p43.0 p43.0 d37.0 p94.0 p101.0 p37.0 d99.0 d94.0 d101.0 d\n",
      "15.0 p93.0 p23.0 p16.0 p9.0 p10.0 p15.0 d16.0 d9.0 d93.0 d23.0 d10.0 d\n",
      "85.0 p86.0 p58.0 p58.0 d85.0 d86.0 d95.0 p102.0 p103.0 p95.0 d103.0 d102.0 d\n",
      "57.0 p57.0 d38.0 p52.0 p45.0 p45.0 d52.0 d18.0 p11.0 p18.0 d40.0 p38.0 d40.0 d11.0 d63.0 p63.0 d\n",
      "1.0 p2.0 p1.0 d2.0 d17.0 p31.0 p87.0 p17.0 d53.0 p54.0 p68.0 p87.0 d53.0 d54.0 d31.0 d68.0 d\n",
      "24.0 p3.0 p3.0 d24.0 d69.0 p35.0 p35.0 d69.0 d\n",
      "44.0 p80.0 p73.0 p81.0 p44.0 d46.0 p47.0 p73.0 d19.0 p26.0 p46.0 d47.0 d26.0 d80.0 d81.0 d7.0 p19.0 d7.0 d\n",
      "25.0 p25.0 d6.0 p27.0 p62.0 p6.0 d27.0 d62.0 d\n",
      "39.0 p88.0 p89.0 p82.0 p90.0 p39.0 d41.0 p56.0 p88.0 d89.0 d82.0 d90.0 d41.0 d56.0 d\n",
      "59.0 p60.0 p74.0 p96.0 p60.0 d59.0 d97.0 p55.0 p48.0 p70.0 p77.0 p74.0 d48.0 d77.0 d55.0 d96.0 d97.0 d70.0 d\n",
      "12.0 p34.0 p20.0 p12.0 d28.0 p84.0 p91.0 p98.0 p84.0 d20.0 d91.0 d28.0 d34.0 d98.0 d\n",
      "75.0 p83.0 p76.0 p13.0 p21.0 p14.0 p49.0 p42.0 p42.0 d14.0 d75.0 d13.0 d21.0 d76.0 d49.0 d83.0 d\n",
      "78.0 p71.0 p50.0 p36.0 p30.0 p78.0 d79.0 p100.0 p79.0 d50.0 d30.0 d36.0 d71.0 d100.0 dtotal 190\n"
     ]
    }
   ],
   "source": [
    "for objects2 in LNOutput:\n",
    "    print()\n",
    "    for item in objects2.orderSequence:\n",
    "        print(item.orderId, item.ordertype,end=\"\")\n",
    "total=0\n",
    "for j in LNOutput:\n",
    "    total=total+len(j.orderSequence)\n",
    "print('total',total)\n"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": null,
   "metadata": {},
   "outputs": [],
   "source": [
    "for objects2 in LNOutput:\n",
    "    objects2.calculateDistancesAndTotalRouteDistance()\n",
    "    objects2.DetermineArrivalTimesOfRequests()\n",
    "print()\n",
    "\n",
    "for objects2 in LNOutput:\n",
    "    print()\n",
    "    for item in objects2.orderSequence:\n",
    "        print(item.orderId, item.ordertype,end=\"\")\n",
    "print()\n",
    "print()\n",
    "\n",
    "\n",
    "for objects2 in LNOutput:\n",
    "    print(objects2.ArrivalTimesofTheOrdersIncludedWaste,sep=\"/n\")\n",
    "print()\n",
    "\n",
    "for objects2 in LNOutput:\n",
    "        print(objects2.distanceBetweenTwoConsecutiveOrders,sep=\"/n\")\n",
    "print()"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "the below part is for enhancing the initial solution quality"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 25,
   "metadata": {},
   "outputs": [],
   "source": [
    "orderObjectList=[]\n",
    "for index, row in orderDataFrame.iterrows():\n",
    "    orderObjectList.append(Order(row['Order_Id'],'p',row['Pickup_Window_Start'],row['Pickup_Window_End'],\n",
    "                           row['Dropoff_Window_Start'],row['Dropoff_Window_End'],row['Pickup_Latitude'],row['Pickup_Longitude'],\n",
    "                           row['Dropoff_Latitude'],row['Dropoff_Longitude']))\n",
    "    orderObjectList.append(Order(row['Order_Id'],'d',row['Pickup_Window_Start'],row['Pickup_Window_End'],\n",
    "                           row['Dropoff_Window_Start'],row['Dropoff_Window_End'],row['Pickup_Latitude'],row['Pickup_Longitude'],\n",
    "                           row['Dropoff_Latitude'],row['Dropoff_Longitude']))\n",
    "\n",
    "\n",
    "routeObjectList=[]\n",
    "for index,row in driversDataFrame.iterrows():\n",
    "    routeObjectList.append(Route(row['Route_id'],row['Route_Start_Time'],row['Route_End_Time']))\n",
    "    \n"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 59,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "\n",
      "\n",
      "1.0 p8.0 p29.0 p1.0 d8.0 d29.0 d12.0 p6.0 p27.0 p6.0 d12.0 d27.0 d\n",
      "15.0 p22.0 p36.0 p50.0 p15.0 d22.0 d50.0 d36.0 d75.0 p13.0 p20.0 p34.0 p75.0 d13.0 d20.0 d34.0 d\n",
      "43.0 p57.0 p64.0 p57.0 d43.0 d2.0 p64.0 d2.0 d5.0 p19.0 p26.0 p19.0 d5.0 d26.0 d\n",
      "71.0 p30.0 p37.0 p94.0 p71.0 d30.0 d37.0 d94.0 d7.0 p28.0 p7.0 d28.0 d\n",
      "78.0 p78.0 d9.0 p23.0 p3.0 p23.0 d9.0 d3.0 d41.0 p48.0 p62.0 p48.0 d14.0 p62.0 d41.0 d14.0 d\n",
      "85.0 p58.0 p72.0 p24.0 p31.0 p58.0 d85.0 d24.0 d72.0 d31.0 d55.0 p21.0 p49.0 p55.0 d21.0 d49.0 d\n",
      "16.0 p10.0 p101.0 p16.0 d10.0 d101.0 d35.0 p56.0 p56.0 d35.0 d\n",
      "44.0 p17.0 p38.0 p11.0 p18.0 p25.0 p44.0 d17.0 d96.0 p18.0 d38.0 d11.0 d25.0 d63.0 p96.0 d63.0 d\n",
      "51.0 p45.0 p52.0 p59.0 p52.0 d45.0 d51.0 d59.0 d69.0 p76.0 p83.0 p77.0 p69.0 d83.0 d76.0 d77.0 d\n",
      "66.0 p39.0 p46.0 p66.0 d39.0 d46.0 d42.0 p70.0 p42.0 d70.0 d\n",
      "73.0 p74.0 p4.0 p33.0 p73.0 d74.0 d82.0 p4.0 d33.0 d82.0 d\n",
      "32.0 p61.0 p103.0 p61.0 d32.0 d103.0 d\n",
      "40.0 p90.0 p97.0 p90.0 d40.0 d97.0 d\n",
      "92.0 p99.0 p92.0 d79.0 p86.0 p100.0 p79.0 d99.0 d86.0 d100.0 d84.0 p91.0 p98.0 p91.0 d84.0 d98.0 d\n",
      "\n",
      "[10.0, 10.166666666666666, 10.482381052026952, 11.0, 12.487544580635323, 13.619017191754494, 14.984682520021295, 15.30039690538158, 15.616111290741866, 16.068977715966096, 16.472662105243423, 17.219468544125416]\n",
      "[10, 10.166666666666666, 10.333333333333332, 10.734511292582333, 11.375353597361896, 12.09225863681406, 12.809852142856975, 13.769763733757575, 14.995182554315333, 15.445718299530688, 15.612384966197354, 15.77905163286402, 16.169191314797644, 16.39177910597395, 17.028005629368597, 17.889989879601696]\n",
      "[10, 10.166666666666666, 10.333333333333332, 11.0, 11.374209541360468, 11.960077193812461, 12.947413502011585, 13.877005997174116, 14.102315311705366, 14.418029697065652, 14.584696363732318, 15.022065046476936, 15.90971625743657, 17.347566323630588]\n",
      "[11, 11.401177959249, 11.567844625915667, 12.018380371131022, 13.432477584268172, 13.943718374173594, 14.885994128372591, 15.372888982434, 16.53613957104035, 16.85185395640064, 17.84891152414861, 18.231441970519345]\n",
      "[11, 11.233449010690054, 11.650410863749775, 11.96612524911006, 12.281839634470346, 13.088607360576642, 13.712181298812222, 14.722689948596493, 15.30865082172944, 15.475317488396106, 15.641984155062772, 16.13350230879973, 16.742012215590492, 17.70543863721819, 18.510309257588073, 18.728438736599756]\n",
      "[11, 11.293250915481742, 11.459917582148408, 12.0, 12.166666666666666, 12.987739235042769, 13.323148372219702, 13.89957681493705, 14.730847433904874, 14.939816982778805, 15.928993007193643, 16.330170966442648, 16.731348925691652, 17.696832812334797, 18.371805701330295, 18.79063699618081]\n",
      "[12, 12.315714385360286, 12.88098692314918, 13.654052688411472, 14.632330530458685, 15.415411388857637, 16.5643140794512, 16.965492038700205, 17.712344311926216, 18.597262627782847]\n",
      "[12, 12.401177959249, 12.802355918498002, 13.345659710368084, 13.66137409572837, 13.828040762395036, 14.082374162675118, 14.400754090272898, 14.517470062504499, 14.857951584621155, 15.298590159407903, 15.735267410701232, 15.9643526341873, 16.781057589353754, 17.977259842669156, 18.707333676537484]\n",
      "[12, 12.166666666666666, 12.333333333333332, 12.499999999999998, 13.074806603564614, 13.180701741164665, 13.78069027422488, 14.75947382181515, 15.382532701056812, 15.675783616538554, 15.84245028320522, 16.00911694987189, 17.274736570493694, 18.051731098349585, 18.348841739595862, 18.71722873539663]\n",
      "[13, 13.166666666666666, 13.333333333333332, 14.829518025030698, 15.915181759550698, 16.276438769946708, 16.45498847665272, 16.621655143319387, 17.0, 18.128947658813225]\n",
      "[13, 13.166666666666666, 13.73193920445556, 14.047653589815846, 14.294736927669216, 14.731140910201354, 14.968473891329861, 15.847789461865093, 16.64087393148017, 17.521171251372778]\n",
      "[14, 14.401177959249, 14.694428874730743, 15.889009000280375, 16.661774121394398, 17.38584070821321]\n",
      "[15, 15.293250915481742, 15.459917582148408, 16.320212600909862, 17.265144351964615, 18.272344797289033]\n",
      "[10.0, 10.166666666666666, 11.0, 11.659455524229626, 11.826122190896292, 11.992788857562958, 12.360643333759558, 13.329974275661932, 14.358408185776845, 14.829585732418641, 16.08619178634507, 16.252858453011736, 16.419525119678404, 17.203874913603862, 17.60026194363232, 18.49779473091824]\n",
      "\n",
      "[0.0, 1.7885726243234283, 2.7009760613615765, 16.85053496762386, 12.577671333430056, 15.387983939201607, 1.7885726243234283, 1.7885726243234283, 3.4343971026907743, 3.844212671327933, 7.961677266583917]\n",
      "[0.0, 0.0, 2.8141355109880264, 5.690107657354749, 7.602860473425963, 7.6111220725149655, 10.518939090807189, 13.705025846693086, 3.4064289425842587, 0.0, 0.0, 2.681676183203489, 1.6710534941156743, 6.634718280735799, 9.343811002797192]\n",
      "[0.0, 0.0, 5.336981597773753, 3.4905144963256056, 6.03041182942392, 9.848035698389499, 10.155109941950368, 1.7037117743749917, 1.7885726243234283, 0.0, 3.2484241929354187, 9.651814531515607, 16.254200794328202]\n",
      "[2.8141355109880264, 0.0, 3.4064289425842587, 14.969166557645817, 5.134889478865063, 10.307309050387957, 4.842738248736911, 12.9590070632762, 1.7885726243234283, 9.964690812975626, 3.590365356448839]\n",
      "[0.801388128280646, 4.003542236716647, 1.7885726243234283, 1.7885726243234283, 7.6812127132755625, 6.4828872588269615, 11.12610379741125, 6.0315304775953535, 0.0, 0.0, 3.8982178448434905, 6.302118881489133, 9.561117059532362, 8.658447444438623, 1.6175537481402091]\n",
      "[1.5190109857809178, 0.0, 2.8141355109880264, 0.0, 7.85287082051324, 3.0249096461231897, 5.917141312608179, 8.97524742761387, 1.5076345864871659, 10.870112292978066, 2.8141355109880264, 2.8141355109880264, 9.58580663971773, 7.099674667946011, 4.025975538206219]\n",
      "[1.7885726243234283, 4.783270453466744, 7.2767891831475024, 10.73933410456654, 8.396970300787425, 12.786832287122786, 2.8141355109880264, 6.9622272787121116, 9.619019790279594]\n",
      "[2.8141355109880264, 2.8141355109880264, 4.519645502440991, 1.7885726243234283, 0.0, 1.0520008033609811, 2.8205591311733587, 0.40059166677921615, 2.085778265399884, 4.287662897440965, 4.240127015519936, 1.749022681832804, 8.800459461997466, 12.354427039784815, 7.760886006419955]\n",
      "[0.0, 0.0, 0.0, 4.897679242775403, 0.2707416512006075, 6.199862396722557, 10.745402571083254, 6.476706550899928, 1.5190109857809178, 0.0, 0.0, 13.187435447461665, 8.323934334270682, 2.5653276949553367, 3.4206439496092607]\n",
      "[0.0, 0.0, 15.954216300368397, 12.027964814240004, 3.335084124752106, 1.142596480472144, 0.0, 1.0006966690449866, 12.547371905758693]\n",
      "[0.0, 4.783270453466744, 1.7885726243234283, 0.9650000542404543, 4.236847790385647, 1.8479957735420725, 8.55178684642279, 8.517013635380918, 9.56356783871132]\n",
      "[2.8141355109880264, 1.5190109857809178, 12.334961506595594, 8.27318145336828, 7.688799041825733]\n",
      "[1.5190109857809178, 0.0, 8.323540225137467, 10.339181012657045, 11.086405343893022]\n",
      "[0.0, 6.913466290755506, 6.913466290755506, 0.0, 0.0, 2.4142537143592118, 10.631971302828484, 11.34120692137895, 4.65413055970154, 14.079272647117143, 0.0, 0.0, 7.412197527105465, 3.756644360341488, 9.770393447431092]\n",
      "\n"
     ]
    }
   ],
   "source": [
    "for objects2 in fRouL:\n",
    "    objects2.calculateDistancesAndTotalRouteDistance()\n",
    "    objects2.DetermineArrivalTimesOfRequests()\n",
    "print()\n",
    "\n",
    "for objects2 in fRouL:\n",
    "    print()\n",
    "    for item in objects2.orderSequence:\n",
    "        print(item.orderId, item.ordertype,end=\"\")\n",
    "print()\n",
    "print()\n",
    "\n",
    "\n",
    "for objects2 in fRouL:\n",
    "    print(objects2.ArrivalTimesofTheOrdersIncludedWaste,sep=\"/n\")\n",
    "print()\n",
    "\n",
    "for objects2 in fRouL:\n",
    "        print(objects2.distanceBetweenTwoConsecutiveOrders,sep=\"/n\")\n",
    "print()\n"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 29,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "\n",
      "1.0 p8.0 p29.0 p1.0 d8.0 d29.0 d12.0 p6.0 p27.0 p6.0 d12.0 d27.0 d\n",
      "15.0 p22.0 p36.0 p50.0 p15.0 d22.0 d50.0 d36.0 d75.0 p13.0 p20.0 p34.0 p75.0 d13.0 d20.0 d34.0 d\n",
      "43.0 p57.0 p64.0 p57.0 d43.0 d2.0 p64.0 d2.0 d5.0 p19.0 p26.0 p19.0 d5.0 d26.0 d\n",
      "71.0 p30.0 p37.0 p94.0 p71.0 d30.0 d37.0 d94.0 d7.0 p28.0 p7.0 d28.0 d\n",
      "78.0 p78.0 d9.0 p23.0 p3.0 p23.0 d9.0 d3.0 d41.0 p48.0 p55.0 p90.0 p48.0 d55.0 d41.0 d90.0 d\n",
      "85.0 p58.0 p72.0 p24.0 p31.0 p58.0 d85.0 d24.0 d72.0 d31.0 d62.0 p14.0 p62.0 d14.0 d\n",
      "16.0 p10.0 p101.0 p16.0 d10.0 d101.0 d21.0 p35.0 p21.0 d35.0 d\n",
      "44.0 p17.0 p38.0 p11.0 p18.0 p25.0 p44.0 d17.0 d96.0 p18.0 d38.0 d11.0 d25.0 d63.0 p96.0 d63.0 d\n",
      "51.0 p45.0 p52.0 p59.0 p52.0 d45.0 d51.0 d59.0 d69.0 p76.0 p83.0 p49.0 p77.0 p83.0 d69.0 d49.0 d76.0 d77.0 d\n",
      "66.0 p39.0 p74.0 p66.0 d39.0 d74.0 d42.0 p56.0 p42.0 d56.0 d\n",
      "73.0 p81.0 p4.0 p33.0 p73.0 d81.0 d47.0 p4.0 d33.0 d47.0 d\n",
      "32.0 p61.0 p103.0 p61.0 d32.0 d103.0 d\n",
      "40.0 p97.0 p70.0 p40.0 d97.0 d70.0 d\n",
      "92.0 p99.0 p92.0 d79.0 p86.0 p100.0 p79.0 d99.0 d86.0 d100.0 d84.0 p91.0 p98.0 p91.0 d84.0 d98.0 d\n",
      "\n",
      "1.0 p8.0 p29.0 p1.0 d8.0 d29.0 d12.0 p6.0 p27.0 p6.0 d12.0 d27.0 d\n",
      "15.0 p22.0 p36.0 p50.0 p15.0 d22.0 d50.0 d36.0 d75.0 p13.0 p20.0 p34.0 p75.0 d13.0 d20.0 d34.0 d\n",
      "43.0 p57.0 p64.0 p57.0 d43.0 d2.0 p64.0 d2.0 d5.0 p19.0 p26.0 p19.0 d5.0 d26.0 d\n",
      "71.0 p30.0 p37.0 p94.0 p71.0 d30.0 d37.0 d94.0 d7.0 p28.0 p7.0 d28.0 d\n",
      "78.0 p78.0 d9.0 p23.0 p3.0 p23.0 d9.0 d3.0 d41.0 p48.0 p55.0 p90.0 p48.0 d55.0 d41.0 d90.0 d\n",
      "85.0 p58.0 p72.0 p24.0 p31.0 p58.0 d85.0 d24.0 d72.0 d31.0 d62.0 p14.0 p62.0 d14.0 d\n",
      "16.0 p10.0 p101.0 p16.0 d10.0 d101.0 d21.0 p35.0 p21.0 d35.0 d\n",
      "44.0 p17.0 p38.0 p11.0 p18.0 p25.0 p44.0 d17.0 d96.0 p18.0 d38.0 d11.0 d25.0 d63.0 p96.0 d63.0 d\n",
      "51.0 p45.0 p52.0 p59.0 p52.0 d45.0 d51.0 d59.0 d69.0 p76.0 p83.0 p49.0 p77.0 p83.0 d69.0 d49.0 d76.0 d77.0 d\n",
      "66.0 p39.0 p74.0 p66.0 d39.0 d74.0 d42.0 p56.0 p42.0 d56.0 d\n",
      "73.0 p81.0 p4.0 p33.0 p73.0 d81.0 d47.0 p4.0 d33.0 d47.0 d\n",
      "32.0 p61.0 p103.0 p61.0 d32.0 d103.0 d\n",
      "40.0 p97.0 p70.0 p40.0 d97.0 d70.0 d\n",
      "92.0 p99.0 p92.0 d79.0 p86.0 p100.0 p79.0 d99.0 d86.0 d100.0 d84.0 p91.0 p98.0 p91.0 d84.0 d98.0 d"
     ]
    }
   ],
   "source": [
    "for objects2 in fRouL:\n",
    "    print()\n",
    "    for item in objects2.orderSequence:\n",
    "        print(item.orderId, item.ordertype,end=\"\")\n",
    "print()\n",
    "for objects2 in maybeInitialFull:\n",
    "    print()\n",
    "    for item in objects2.orderSequence:\n",
    "        print(item.orderId, item.ordertype,end=\"\")        \n"
   ]
  }
 ],
 "metadata": {
  "kernelspec": {
   "display_name": "Python 3",
   "language": "python",
   "name": "python3"
  },
  "language_info": {
   "codemirror_mode": {
    "name": "ipython",
    "version": 3
   },
   "file_extension": ".py",
   "mimetype": "text/x-python",
   "name": "python",
   "nbconvert_exporter": "python",
   "pygments_lexer": "ipython3",
   "version": "3.7.1"
  }
 },
 "nbformat": 4,
 "nbformat_minor": 2
}