텍스트 검색 (신규) 및 주변 지역 검색 (신규): 지정된 라우팅 출발지 위치에서 검색 결과의 각 장소까지의 라우팅 요약을 계산합니다.
텍스트 검색 (신규)만 해당: 사전 정의된 여행 경로를 따라 각 장소의 경로 요약을 계산합니다.
경로를 따라 검색
Routes API를 사용하여 두 위치 간의 이동 경로를 계산합니다. Routes API는 자동차, 자전거, 이륜차, 대중교통 시스템 또는 도보 경로를 계산할 수 있습니다.
텍스트 검색 (신규)을 사용하면 이 계산된 경로를 사용하여 경로를 따라 검색할 수 있습니다. 이 옵션을 사용하면 Routes API에서 미리 계산된 경로를 텍스트 검색 (신규) 요청에 전달합니다. 그러면 응답에 검색 기준과 일치하고 지정된 경로 근처에 있는 장소가 포함됩니다.
경로를 따라 검색하는 것은 locationRestriction 또는 locationBias 요청 옵션을 사용하여 검색 결과에 편향을 주는 것과 유사합니다. locationRestriction는 표시 영역 경계 내에 있는 검색 결과를 반환하는 반면 locationBias는 표시 영역 외부에 있는 검색 결과를 반환할 수 있습니다. 하지만 locationBias 및 locationRestriction 옵션을 사용하면 검색 결과에 편향을 줄 지역을 지정할 수 있는 반면, 텍스트 검색의 경로를 따라 검색 기능은 경로 출발지에서 경로 목적지까지의 우회 시간이 최소인 항목을 포함하도록 검색 결과에 편향을 줄 수도 있습니다. 폴리라인과 함께 locationBias 또는 locationRestriction을 사용하여 검색 결과를 편향시킬 수 있습니다.
예를 들어 Routes API에서 경유지라고 하는 출발지에서 Routes API에서 계산한 목적지까지의 경로를 생각해 보겠습니다.
경로를 따라 검색하면 출발지에서 목적지까지 우회 시간이 최소인 경로 근처의 장소가 검색 결과에 표시됩니다. 이 예에서 A, B, C는 검색에서 반환된 장소입니다.
라우팅 요약 계산
텍스트 검색(신규) 및 주변 검색(신규)은 요청에 지정된 경로 출발지 위치를 기반으로 응답의 각 장소까지의 경로 요약(기간 및 거리)을 계산할 수 있습니다. 라우팅 출발지를 지정하면 응답에 검색과 일치하는 장소 목록뿐만 아니라 라우팅 출발지에서 각 장소까지의 이동 시간과 거리도 포함됩니다.
다음 이미지에서 A, B, C는 검색 응답에 반환된 장소입니다.
결과의 각 장소에 대해 응답에는 경로 출발지에서 장소까지의 이동 시간과 거리가 포함됩니다(해당하는 경우).
경로 요약 계산을 경로를 따라 검색과 결합할 수 있습니다.
이 경우 텍스트 검색 (신규)은 응답에서 각 장소까지의 이동 시간과 거리를 반환한 다음 각 장소에서 경로의 최종 목적지까지의 이동 시간과 거리를 반환합니다. 이 계산은 지정된 경로에서 벗어나 검색 결과에 있는 장소로 이동한 후 최종 목적지로 계속 이동하는 경우 이동 시간과 거리를 제공하는 것으로 생각하면 됩니다.
예를 들어 Routes API에서 계산한 출발지에서 목적지까지의 다음 경로를 고려해 보세요. 검색 기준과 함께 이 경로를 Text Search (New) API에 전달합니다.
이 예에서 위치 A는 텍스트 검색 (신규)의 검색 결과에서 반환된 장소입니다. 대답의 각 장소에 대해 검색에는 해당 장소로 우회하는 데 필요한 시간과 거리가 2구간 여행으로 포함됩니다.
첫 번째 구간에는 경로 출발지에서 장소까지의 이동 시간과 거리가 포함됩니다. 이 예시에서는 원점에서 장소 A까지입니다.
두 번째 구간에는 장소에서 경로 목적지까지의 이동 시간과 거리가 포함됩니다. 이 예시에서는 A에서 목적지까지입니다.
그런 다음 대답의 정보를 바탕으로 우회 시간과 거리를 계산할 수 있습니다.
\(t_{OD}\) 는 출발지에서 목적지까지의 이동 시간이고,
\(s_{OD}\) 는 출발지에서 목적지까지의 이동 거리입니다.
\(t_{OA}\) 는 출발지에서 A까지의 이동 시간이고 \(s_{OA}\) 는 출발지에서 A까지의 이동 거리입니다.
\(t_{AD}\) 는 A에서 목적지까지의 여행 시간입니다.
\(s_{AD}\) 는 A에서 목적지까지의 여행 거리입니다.
우회 시간은 원래 여정(출발지에서 목적지까지)과 새 여정 (출발지에서 목적지까지 A를 통해) 간의 시간 차이입니다.
$$
t_{detour} = t_{OA} + t_{AD} - t_{OD}
$$
우회 거리는 원래 여정(출발지에서 목적지까지)과 새 여정 (출발지에서 목적지까지 A를 통해) 간의 거리 차이입니다.
[[["이해하기 쉬움","easyToUnderstand","thumb-up"],["문제가 해결됨","solvedMyProblem","thumb-up"],["기타","otherUp","thumb-up"]],[["필요한 정보가 없음","missingTheInformationINeed","thumb-down"],["너무 복잡함/단계 수가 너무 많음","tooComplicatedTooManySteps","thumb-down"],["오래됨","outOfDate","thumb-down"],["번역 문제","translationIssue","thumb-down"],["샘플/코드 문제","samplesCodeIssue","thumb-down"],["기타","otherDown","thumb-down"]],["최종 업데이트: 2025-08-29(UTC)"],[[["\u003cp\u003eThe Places API's Search along route feature lets you find places near a predefined route calculated using the Routes API, prioritizing places with minimal detour times.\u003c/p\u003e\n"],["\u003cp\u003eYou can calculate the routing summary (duration and distance) from a specified origin to each place in the search results using Text Search (New) and Nearby Search (New).\u003c/p\u003e\n"],["\u003cp\u003eText Search (New) allows combining search along a route with routing summary calculations, providing detour duration and distance for each place found.\u003c/p\u003e\n"],["\u003cp\u003eA route comprises waypoints (origin, destination, and optional intermediate points), legs (paths between waypoints), and steps (discrete segments within legs).\u003c/p\u003e\n"],["\u003cp\u003eWhile \u003ccode\u003elocationBias\u003c/code\u003e and \u003ccode\u003elocationRestriction\u003c/code\u003e bias search results to a region, search along route in Text Search (New) biases results to places near a route with minimal detour times.\u003c/p\u003e\n"]]],[],null,["Overview of search along route\n==============================\n\nSearch along route features are available in the following Places (New) APIs:\n\n- **Text Search (New) only:** Search for places along a predefined trip route.\n- **Text Search (New) and Nearby Search (New):** Calculate the routing summary from a specified routing origin location to each place in the search results.\n- **Text Search (New) only:** Calculate the routing summary for each place along a predefined trip route.\n\nSearch along a route\n--------------------\n\nYou use the [Routes API](/maps/documentation/routes) to calculate the trip route\nbetween two locations. The Routes API can calculate a route for a car, bicycle,\ntwo-wheel vehicle, transit system, or for walking.\n| **Note:** Transit system routes are not supported by the Places API.\n\n[Text Search (New)](/maps/documentation/places/web-service/text-search) lets you use this calculated route to perform a\n**search along a route**. With this option, you pass the precalculated route\nfrom the Routes API to the Text Search (New) request. The response then contains\nplaces that match the search criteria and are also located near the specified\nroute.\n\nSearching along a route is similar to using the `locationRestriction` or\n`locationBias` request options to bias the search results. `locationRestriction`\nreturns search results that fall within the viewport bounds, while\n`locationBias` may return search results outside of the viewport. However, while\nthe `locationBias` and `locationRestriction` options let you specify a region to\nbias the search results, the search along route feature in Text Search also lets\nyou bias the search results to include those with minimal detour times from the\nroute origin to the route destination. You can bias search results using either\n`locationBias` or `locationRestriction` in combination with the polyline.\n\nFor example, consider the route from the origin, referred to as a\n**waypoint** in the Routes API, to the destination as calculated by the Routes\nAPI:\n\nWhen you search along the route, the search is biased to return places near the\nroute with minimal detour times from the origin to the destination. In this\nexample, points A, B, and C are places returned by the search.\n\nCalculate routing summary\n-------------------------\n\n[Text Search (New)](/maps/documentation/places/web-service/text-search) and [Nearby Search (New)](/maps/documentation/places/web-service/nearby-search) can\ncalculate the **routing summary** , meaning the duration and distance, to each\nplace in the response based on the specified **routing origin location** in the\nrequest. When you specify the routing origin, the response not only contains a\nlist of places that match the search, but also the travel duration and distance\nfrom the routing origin to each place.\n\nIn the following image, points A, B, and C are places returned in the search\nresponse:\n\nFor each place in the results, the response contains the travel duration and\ndistance from the routing origin to the place, if available.\n| **Note:** This is only an estimate of the routing information. To get the actual route details, including step-by-step directions, use the [Routes\n| API](/maps/documentation/routes/compute_route_directions).\n\nBy default, the travel duration and distance is calculated using the [`TRAFFIC_UNAWARE`](/maps/documentation/routes/config_trade_offs#traffic_unaware)\noption in the Routes API. You can optionally set routing preferences to take\nlive traffic conditions [`TRAFFIC_AWARE_OPTIMAL`](/maps/documentation/routes/config_trade_offs#traffic_aware_optimal)\nor latency-reduced live traffic conditions [`TRAFFIC_AWARE`](/maps/documentation/routes/config_trade_offs#traffic_aware)\ninto consideration during calculations.\n| **Note:** `TRAFFIC_AWARE` and `TRAFFIC_OPTIMAL` only apply to the `DRIVE` and `TWO_WHEELER` travel modes. If either routing preference is specified with an unsupported travel mode, the routing summary calculation defaults to using the `TRAFFIC_UNAWARE` option. If `TWO_WHEELER` is specified in an [unsupported region](/maps/documentation/routes/coverage-two-wheeled), the API returns an empty routing summary.\n| When you set the [`TRAFFIC_AWARE`](/maps/documentation/routes/config_trade_offs#traffic_aware) routing preference, routes are calculated accounting for traffic conditions. As a result, the route and route details more accurately reflect real-world conditions. Since this increase in data quality comes at the expense of response latency, performance optimizations are applied to reduce much of the latency. When you set the [`TRAFFIC_AWARE_OPTIMAL`](/maps/documentation/routes/config_trade_offs#traffic_aware_optimal) routing preference, routes are calculated accounting for traffic conditions, but no performance optimizations are applied. In this mode, the server performs a more exhaustive search of the road network to find the optimal route.\n\n### About routes, legs, and waypoints\n\nSeveral components make up a route, as calculated by the Routes API:\n\nA route consists of the following components:\n\n- **Waypoint** : To calculate a route, you specify at a minimum the locations of the origin and destination. You define these locations as *waypoints* on the route. *Intermediate waypoints* are locations in between the origin and destination that you want the route to go through.\n- **Route** : The entire trip from the origin waypoint, through any\n intermediate waypoints, to the destination waypoint. A route consists of one\n or more **legs**.\n\n When passing a route to Text Search, you pass the [route's encoded\n polyline](/maps/documentation/routes/traffic_on_polylines) as returned by the [Routes API](/maps/documentation/routes). An encoded\n polyline is an encoded list of latitude and longitude points that lets you represent the\n route's polyline as a string.\n- **Leg** : The path from one waypoint in a route to the next waypoint in the\n route. Each leg consists of one or more discrete **steps**.\n\n A route contains a separate leg for the path from each waypoint to the next.\n For example, if the route contains a single origin waypoint and a single\n destination waypoint, then the route contains a single leg.\n\n For each additional waypoint you add to the route after the origin and\n destination, called an *intermediate* waypoint, the API adds a separate leg.\n\nFor more information on routes and calculating routes, see the [Routes\nAPI](/maps/documentation/routes).\n\nCalculate the routing summary with a search along route\n-------------------------------------------------------\n\nYou can combine **routing summary** calculations with **search along a route** .\nIn this case, [Text Search (New)](/maps/documentation/places/web-service/text-search) returns the travel duration and\ndistance to each place in the response, and then from each place to the final\ndestination of the route. Think of this calculation as providing a travel\nduration and distance if you detour from the specified route to travel to a\nplace in the search results, and then continue on to the final destination.\n\nFor example, consider the following route from the origin to the destination as\ncalculated by the Routes API. Pass this route to the Text Search (New) API along\nwith your search criteria.\n\nIn this example, location A is a place returned in the search results from\nText Search (New). For each place in the response, the search includes the duration\nand distance required to detour to that place as a **two-leg trip**:\n\n- The first leg contains the travel duration and distance from the route **origin** to the **place**. In this example, from the origin to place A.\n- The second leg contains the travel duration and distance from the **place** to the route **destination**. In this example, from A to the destination.\n\nFrom the information in the response, you can then calculate the **detour\nduration and distance**, where:\n\n- \\\\(t_{OD}\\\\) is the **trip duration** from the origin to the destination, \\\\(s_{OD}\\\\) is the **trip distance** from the origin to the destination\n- \\\\(t_{OA}\\\\) is the **trip duration** from the origin to A; \\\\(s_{OA}\\\\) is the **trip distance** from the origin to A\n- \\\\(t_{AD}\\\\) is the **trip duration** from A to the destination; \\\\(s_{AD}\\\\) is the **trip distance** from A to the destination\n\n**Detour duration** is the **duration difference** between the **original trip**\n(from the origin to the destination) and the **new trip** (from the origin to\nthe destination **through** A): \n$$ t_{detour} = t_{OA} + t_{AD} - t_{OD} $$\n\n**Detour distance** is the **distance difference** between the **original trip**\n(from the origin to the destination) and the **new trip** (from the origin to\nthe destination **through** A): \n$$ s_{detour} = s_{OA} + s_{AD} - s_{OD} $$"]]
