%PDF-1.4 % 1 0 obj << /Type /Pages /Count 1 /Kids [ 2 0 R ] >> endobj 2 0 obj << /Type /Page /Parent 1 0 R /Resources << /ProcSet [ /PDF /Text /ImageB /ImageC /ImageI ] /Font << /QuickPDFF5b96ac7e 72 0 R /QuickPDFF671a4cc4 115 0 R >> >> /Contents [ 5 0 R ] /MediaBox [ 0 0 595.2756 841.8898 ] /CropBox [ 0 0 595.2756 841.8898 ] >> endobj 3 0 obj << /Type /Catalog /Pages 1 0 R /Metadata 116 0 R >> endobj 4 0 obj << /Producer (Debenu Quick PDF Library 11.15 \(www.debenu.com\)) /Creator (Debenu Quick PDF Library 11.15 \(www.debenu.com\)) /CreationDate (D:20230622210108+02'00') /ModDate (D:20230622210108+02'00') >> endobj 5 0 obj << /Length 3300 /LC /iSQP >> stream 0 Tr /QuickPDFF671a4cc4 14 Tf 0 0 0 rg 100 Tz 0 Tw 0 Tc 0 Ts BT 1 0 0 1 71.5168 770.8329 Tm (Spatial Clustering for Generation of Routes Adjusted to the Vehicle Fleet in)Tj 1 0 0 1 244.5498 752.1709 Tm (Spatial Databases)Tj ET /QuickPDFF671a4cc4 11 Tf 0 0 0 rg BT 1 0 0 1 184.5853 717.2179 Tm (Alvaro Ortiz and Luz Angela Rocha \(Colombia\))Tj ET /QuickPDFF671a4cc4 11 Tf 0 0 0 rg BT 1 0 0 1 56.6929 675.188 Tm 14.663 TL (Key words: )' ET /QuickPDFF5b96ac7e 11 Tf 0 0 0 rg BT 1 0 0 1 141.7323 675.188 Tm 14.454 TL (Cost management; Geoinformation/GI; GIM; Spatial planning; clustering algorithm;)' (route optimization; spatial databases processing; transportation logistics)' ET /QuickPDFF671a4cc4 11 Tf 0 0 0 rg BT 1 0 0 1 56.6929 632.6683 Tm 14.663 TL (SUMMARY)' ET /QuickPDFF5b96ac7e 11 Tf 0 0 0 rg BT 1 0 0 1 56.6929 604.3219 Tm 14.454 TL (A new clustering algorithm is proposed, this algorithm adjusts to logistical problems of optimal routes in)' (cases where there is an already established fleet of vehicles, joined with a cloud of points that must be visited)' (with the fleet of vehicles available over a road network in a spatial database. The algorithm developed was)' (implemented in a spatial database \(PostgreSQL-PostGIS\) and determines the groups that each vehicle must)' (go through, taking into account the particular capacity of each vehicle, as well as the order of the places the)' (route should have. It makes use of Dijkstra's algorithm to determine the optimal route between every two)' (consecutive places on the tracks registered in the database. The number of groups generated corresponds to)' (the number of vehicles available, or until the company no longer has more places to visit, whichever comes)' (first.)' ()' (The algorithm is tested with a practical case on the roads of the city of Bogot \(Colombia\) to determine the)' (routes that the buses of a school must travel to pick up and drop off students on their journey from home to)' (school and vice versa. It should be noted that all vehicle information, including student capacity, student)' (information, which includes their residence address, is stored in the spatial database. The database is)' (complemented with information on roads \(polylines\), home plates \(points\) and blocks \(polygons\). The)' (school case demonstrates that the algorithm is functional and is adjustable to the number of groups and)' (quantity of capacity measurement for each vehicle, in addition to the order of travel for each route, which)' (allows us to conclude that it is a very practical algorithm, adjustable and applicable in many environments of)' (logistics solutions with only the use of spatial databases and a geographic information system that serves as a)' (graphic viewer of the routes established on the roads of the spatial work environment.)' ET /QuickPDFF5b96ac7e 10 Tf 0 0 0 rg BT 1 0 0 1 56.6929 150.7097 Tm 13.14 TL (__________________________________________________________________________________________)' ()' (Spatial Clustering for Generation of Routes Adjusted to the Vehicle Fleet in Spatial Databases \(11992\))' (Alvaro Ortiz and Luz Angela Rocha \(Colombia\))' ()' (FIG Working Week 2023)' (Protecting Our World, Conquering New Frontiers )' (Orlando, Florida, USA, 28 May1 June 2023)' ET endstream endobj 6 0 obj << /Length 316 /Filter /FlateDecode >> stream xMRKnCAۿSpk`y^Uu[jIɒT%C/:b}Rx\%=
c%d:WMQ&1֎PP/3k v'[-A:;NcC瑊Sd3G.#Oss
endstream
endobj
7 0 obj
<<
/Length 24
/Filter /FlateDecode
>>
stream
x325P0P040 b 4
endstream
endobj
8 0 obj
<<
/Length 492
/Filter /FlateDecode
>>
stream
x=S˱9w?x:(~ t.]_Zٶ~c+z^G&wM3(9qlW>+&%:]wLD-&8bx!7=Y?O,S[_4.;*d0I``gzDcJi$0Lh.̫-mrB˒{ ESvq=Rhcb-|f