<> "The repository administrator has not yet configured an RDF license."^^ . <> . . . "Optimasi Vehicle Routing Problem With Multiple Trips and\r\nIntermediate Facility (VRPMTIF) Menggunakan Metode Nearest\r\nNeighbour (NN) dan A*"^^ . "Vehicle routing problem (VRP) is a matter of determining vehicle routes that\r\nplay an important role in the industrial world, namely the problem of logistics and\r\ntransportation management. There are various VRP models that are developing,\r\none of which is the Vehicle Routing Problem with Multiple Trips and\r\nIntermediate Facility (VRPMTIF) which is discussed in this study by taking the\r\nproblem of optimization of waste transport routes in the Jatinom Sector in Klaten\r\nCity. This study compares the Nearest Neighbor Method and Method A * in the\r\nprocess of forming a route. Based on the number of routes, both methods produce\r\nthree trips in one route and carry 18 m3 of 14 polling stations. Based on the\r\neffectiveness of distance and time taken, the route in the Nearest Neighbor\r\nMethod produces the least total distance and visit time compared to Method A *.\r\nWhere the route with Nearest Neighboring method traveled 111.84 km, with a\r\ntravel time of 275.76 minutes, while the route on Method A * traveled as far as\r\n123.65 km and travel time was 293.475 minutes. These results prove that, the\r\nroute formed using the Nearest Neighbor Method is more effective 11.81 km and\r\nthe time needed is also more effective 17.715 minutes."^^ . "2018-09-03" . . . . "UIN SUNAN KALIJAGA YOGYAKARTA"^^ . . . "FAKULTAS SAINS DAN TEKNOLOGI, UIN SUNAN KALIJAGA YOGYAKARTA"^^ . . . . . . . . . "NIM. 13610008"^^ . "ADE NOVIANTI HIDAYAH"^^ . "NIM. 13610008 ADE NOVIANTI HIDAYAH"^^ . . . . . . "Optimasi Vehicle Routing Problem With Multiple Trips and\r\nIntermediate Facility (VRPMTIF) Menggunakan Metode Nearest\r\nNeighbour (NN) dan A* (Text)"^^ . . . . . "13610008_BAB-I_BAB-VI_DAFTAR-PUSTAKA.pdf"^^ . . . "Optimasi Vehicle Routing Problem With Multiple Trips and\r\nIntermediate Facility (VRPMTIF) Menggunakan Metode Nearest\r\nNeighbour (NN) dan A* (Text)"^^ . . . . . "Optimasi Vehicle Routing Problem With Multiple Trips and\r\nIntermediate Facility (VRPMTIF) Menggunakan Metode Nearest\r\nNeighbour (NN) dan A* (Other)"^^ . . . . . . "lightbox.jpg"^^ . . . "Optimasi Vehicle Routing Problem With Multiple Trips and\r\nIntermediate Facility (VRPMTIF) Menggunakan Metode Nearest\r\nNeighbour (NN) dan A* (Other)"^^ . . . . . . "preview.jpg"^^ . . . "Optimasi Vehicle Routing Problem With Multiple Trips and\r\nIntermediate Facility (VRPMTIF) Menggunakan Metode Nearest\r\nNeighbour (NN) dan A* (Other)"^^ . . . . . . "medium.jpg"^^ . . . "Optimasi Vehicle Routing Problem With Multiple Trips and\r\nIntermediate Facility (VRPMTIF) Menggunakan Metode Nearest\r\nNeighbour (NN) dan A* (Other)"^^ . . . . . . "small.jpg"^^ . . . "Optimasi Vehicle Routing Problem With Multiple Trips and\r\nIntermediate Facility (VRPMTIF) Menggunakan Metode Nearest\r\nNeighbour (NN) dan A* (Other)"^^ . . . . . . "Optimasi Vehicle Routing Problem With Multiple Trips and\r\nIntermediate Facility (VRPMTIF) Menggunakan Metode Nearest\r\nNeighbour (NN) dan A* (Other)"^^ . . . . . . "Optimasi Vehicle Routing Problem With Multiple Trips and\r\nIntermediate Facility (VRPMTIF) Menggunakan Metode Nearest\r\nNeighbour (NN) dan A* (Other)"^^ . . . . . . "Optimasi Vehicle Routing Problem With Multiple Trips and\r\nIntermediate Facility (VRPMTIF) Menggunakan Metode Nearest\r\nNeighbour (NN) dan A* (Other)"^^ . . . . . "HTML Summary of #33655 \n\nOptimasi Vehicle Routing Problem With Multiple Trips and \nIntermediate Facility (VRPMTIF) Menggunakan Metode Nearest \nNeighbour (NN) dan A*\n\n" . "text/html" . . . "Matematika"@id . .