JP2006338245A - Vehicle arrangement method and vehicle arrangement program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a vehicle arrangement method capable of optimizing a range in which one vehicle among a plurality of vehicles arranged in a prescribed section can arrive within a prescribed time. <P>SOLUTION: This vehicle arrangement method has processes for: deciding an arrival range in which each vehicle can arrive within the prescribed travel time from a standby candidate place allocated to each vehicle according to an allocation pattern sequentially generated based on permutation or a combination; deciding all arrival ranges at which all of the prescribed number of vehicles can arrive by adding the arrival range decided about each the vehicle; and specifying the allocation pattern achieving the quantitative optimization of an evaluation value related to the all arrival range, and allocating a standby place to each the vehicle according to the allocation pattern. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a vehicle placement method and a vehicle placement program for assigning standby locations for a predetermined number of vehicles from a predetermined number of standby candidate locations set on a map, and is particularly used in a predetermined area. The present invention relates to a vehicle arrangement method and a vehicle arrangement program for assigning a standby place for each vehicle so as to maximize the area of a range that can be reached as a whole within a specified time. Here, the vehicle is used as a term that broadly represents a vehicle that falls within the definition of a vehicle in a fire truck, an ambulance, a police vehicle, a repair vehicle related to gas, water, electricity, etc., a blood transport vehicle, and other road traffic laws. .

  Conventionally, when urgent events such as accidents, fires, crimes, power outages, gas leaks, etc. occur in a given area (hereinafter referred to as emergency events) A system has been developed that selects a vehicle that can reach the site where an emergency event has occurred most quickly from among a plurality of vehicles deployed in the country.

  Such a system has a map information database, and identifies an occurrence site on a map from information such as an address where an emergency event has occurred. Further, the position of each vehicle is measured using GPS or PHS, and the position of the vehicle is specified on the map. Next, a required distance between the generation site and the current position of each vehicle is calculated based on the road information, and a travel time required to move the distance is calculated based on the road traffic information.

  Refer to the calculation result, for example, select the vehicle with the shortest distance to the site of occurrence or the vehicle with the shortest travel time expected to reach the site of occurrence and instruct to rush to the site of occurrence put out. In addition, each vehicle is configured to be able to identify the current situation represented by “standby”, “moving”, “processing”, etc. Give instructions to do. In addition, rank the functions of each vehicle or the skills of staff on board the vehicle, and give instructions to preferentially rush to the occurrence site from vehicles that meet the prescribed requirements or vehicles with higher ranks. put out.

  The above system is not only constructed to respond in real time for the purpose of responding to real events, but also can simulate the operation of emergency vehicles by artificially generating emergency events. Is possible. Such an emergency vehicle operation simulation system is described in, for example, Japanese Patent Application Laid-Open No. 2002-117477.

JP 2002-117477 A

  In Japan, for example, each administrative area such as a municipality manages and operates an emergency vehicle that has jurisdiction over the area. In each area, it is desirable to efficiently handle emergency events that occur anywhere in the jurisdiction with a limited number of emergency vehicles. However, the emergency vehicle operation simulation system as described above can only calculate the time required for the emergency vehicle to reach any occurrence site in the jurisdiction, and any vehicle can be reached within the specified time. There is a problem that an overall reachable range cannot be specified, and how efficiently a plurality of vehicles are arranged cannot be evaluated.

  The present invention has been made in order to solve the above-mentioned problems, and for a plurality of vehicles deployed in a predetermined area, an overall reachable range that any vehicle can reach within a specified time is optimized. It is an object of the present invention to provide a vehicle arrangement method and a vehicle arrangement program that can be performed.

  In order to solve the above technical problem, a vehicle placement method or a vehicle placement program according to the present invention is a standby candidate assigned to each vehicle according to an assignment pattern that is sequentially generated based on a permutation or combination. A step of determining a reachable range that each vehicle can reach within a predetermined travel time from a place, a step of determining a total reachable range that can be reached by a predetermined number of vehicles by combining the reachable range determined for each vehicle, and an overall reachable range A step of identifying an allocation pattern that realizes the quantitative optimization of the evaluation value and assigning a standby place to each vehicle according to the allocation pattern.

  Further, the vehicle arrangement method or the vehicle arrangement program according to the present invention is provided with an area of the entire reachable area or a population within the reachable area as an evaluation value related to the entire reachable area, and according to an allocation pattern that maximizes these areas or population A standby place is assigned to each vehicle.

  Further, the vehicle placement method or the vehicle placement program according to the invention of the present application, in the step of assigning the standby candidate location to each vehicle, when the standby candidate location assigned to a certain vehicle is included in the reach range of another vehicle, The calculation related to the allocation pattern is stopped, and the process moves to the calculation related to the next allocation pattern.

  Further, the vehicle placement method or the vehicle placement program according to the present invention is configured such that attribute data relating to road travel is set for each vehicle, and calculation is performed for each vehicle based on the attribute data in the step of determining the reach of each vehicle. This is executed to determine the reach.

  The vehicle placement method or the vehicle placement program according to the present invention changes the standby candidate location to be set according to the date, day of the week, or time in the step of setting the standby candidate location on the map. It is.

  In addition, the vehicle placement method or the vehicle placement program according to the invention of the present application selects a desired candidate location from the database storing a plurality of data for specifying one or a plurality of standby candidate locations, so that a standby candidate location is displayed on the map. It is something that is set.

  Further, the vehicle arrangement method or the vehicle arrangement program according to the present invention executes the calculation of the area of the total reachable area or the population within the total reachable area, excluding the area that protrudes from the predetermined area partitioned on the map. It is what I did.

  Further, the vehicle placement method or the vehicle placement program according to the present invention provides a standby candidate place assigned to each vehicle according to a step of setting a travel time and an assignment pattern generated sequentially based on a permutation or combination. Determining the reach that each vehicle can reach within a predetermined travel time, determining the overall reach that can be reached for a predetermined number of vehicles by combining the reach defined for each vehicle, and Identifying an allocation pattern that maximizes the area, incrementing the travel time if the total reach area is less than a predetermined threshold, and specifying if the total reach area is greater than or equal to the predetermined threshold And a step of assigning a standby place to each vehicle according to the assigned pattern.

  According to the present invention, when determining the standby location of each of the predetermined number of vehicles from among the predetermined number of standby candidate locations, an allocation pattern for sequentially assigning the standby candidate locations to each vehicle based on a permutation or combination is sequentially generated. The overall reachable range that can be reached by the entire predetermined number of vehicles is determined for each allocation pattern, and the overall reachable range of each allocation pattern is evaluated based on the evaluation value. In particular, there is an effect that it is possible to obtain a vehicle arrangement mode capable of optimizing the entire reach area for a plurality of vehicles deployed in a predetermined area.

  According to the present invention, as the evaluation value serving as a reference for evaluating each allocation pattern generated sequentially, the area of the entire reach or the population within the reach of the entire reach is used. There is an effect that it is possible to obtain a vehicle arrangement mode capable of maximizing the area or a vehicle arrangement mode capable of maximizing the population within the entire reachable range.

  According to the present invention, when the standby candidate location assigned to a certain vehicle is included in the reach range of another vehicle, the calculation related to the allocation pattern is stopped, so unnecessary calculation processing is omitted. As a result, the time required to obtain the optimum solution can be shortened.

  According to the present invention, attribute data related to road driving is set for each vehicle and the calculation related to the reach is performed based on the attribute data. For example, the average traveling speed, the travelable route, Even if the speed limit etc. are different, it is possible to determine the reachable range that can be reached within the predetermined travel time based on these attribute data, and the reachable range according to the characteristics of each vehicle can be obtained individually. The calculation accuracy related to the reachable range is increased, and the reliability of the optimal placement system can be improved.

  According to the present invention, since the number and positions of the standby candidate places where the vehicle can be made to wait are changed according to the date, day of the week, or time, for example, the parking space of the lease contract is in a predetermined time zone. Then, there is an effect that an optimal vehicle arrangement can be realized for each time zone according to the use situation of the waiting candidate place as in the case of being open but closed at night.

  According to the present invention, since the standby candidate location is set on the map by selecting desired data from the database storing a plurality of data specifying one or a plurality of standby candidate locations, various viewpoints are provided. If a combination of a plurality of standby candidate locations is registered in the database in advance, it is possible to easily set the standby candidate locations on the map simply by selecting a combination of standby candidate locations that matches the desired arrangement mode. It becomes possible, and there exists an effect that a user's convenience can be improved.

  According to the invention of this application, it is configured to calculate the area of the entire reachable area or the population within the reachable area by excluding the area protruding from the predetermined area partitioned on the map. By specifying an area such as an area on the map, there is an effect that it is possible to realize an optimal vehicle arrangement only for the area.

  According to the present invention, if the total reach area is less than a predetermined threshold, the travel time is incremented and the total reach range is calculated again, so even if the number of vehicles is small relative to the area of the target area Since a sufficiently large overall reach can be obtained so as to ensure that the vehicle arrangement is optimal, the effect of realizing an optimal vehicle arrangement in consideration of a wider range in the target area can be realized. Play. In addition, since it is possible to grasp the entire reach range for each travel time, there is an effect that it is possible to roughly specify the travel time that any vehicle reaches for each region in the target area.

  Hereinafter, preferred embodiments of a vehicle placement method and a vehicle placement program according to the present invention will be described in detail with reference to the accompanying drawings.

  1 and 2 are flowcharts showing a vehicle arrangement method according to the first embodiment of the present invention. First, the area to be calculated is specified on the map (step S1). FIG. 3 is a diagram showing an example of map data used in the present invention. In the figure, an area R surrounded by a thick line is a target area for optimizing the vehicle arrangement. The setting of this area may be configured to be automatically set by inputting the name of a city, for example, a municipality, etc., and is arbitrarily set by a user using a pointing device such as a mouse. You may comprise as follows.

  If the area to be processed is specified, road traffic information relating to all sections along the road is set for each road in the area (step S2). Roads are demarcated by reference points such as intersections and buildings, and road traffic information related to speed limits, traffic jams, traffic regulations caused by accidents and construction, etc. is set for each section between the reference points and the reference points. To do. Such road traffic information is preferably set by sequentially reading out data for each section from the road traffic information database. Moreover, it is good also as a structure which changes in real time about information, such as a traffic jam condition, by connecting to a road traffic information communication system. Furthermore, it is good also as a structure which can input the attribute information which concerns on the said area by a user specifying arbitrary areas on a map. FIG. 4 is a diagram illustrating an example of a road traffic information display screen. In the figure, the numbers appended to each section indicate the average traveling speed of the vehicle. A section indicated by a bold line is a section designated by the user using a pointing device or the like, and the attribute information can be newly changed.

  If the road traffic information is set, information relating to the vehicle deployed in the target area is input (step S3). First, the number of vehicles is input, and if the number is specified, attribute information related to road driving such as the maximum speed, a travelable section (route), and a speed limit for each section is input for each vehicle. In addition, about the input of this attribute information, it is good also as a structure input individually for every vehicle, and it is good also as a structure which gives the same attribute information common to all the vehicles. Furthermore, it is good also as a structure which divides a vehicle into some groups and inputs attribute information for every group.

  If vehicle information is input, a standby candidate location that is a candidate for a location where the set vehicle is to be standby is set on the map (step S4). In FIG. 3, points C1 to C12 indicated by square marks indicate set standby candidate locations. The standby candidate location is set so that the user can arbitrarily set it using a pointing device such as a mouse. In addition, the standby candidate locations are listed and grouped according to the vehicle type, usage, etc. of the vehicle to be arranged, and data of a plurality of sets of standby candidate locations are registered in the database in advance, and the desired candidate locations are stored in the database. The standby candidate location may be set by reading data. In addition, a standby candidate location may be added to the standby candidate location set by reading data from the database using a pointing device. In addition to the normal vehicle deployment locations, the standby candidate locations include facilities managed by public institutions, parking spaces, bus garages, etc., and the available period or time zone is limited depending on the facility. Sometimes. Therefore, the setting of the standby candidate place may be changed according to the date, day of the week, or time. Also when registering in the database, it is preferable to classify the data for each month, day of the week, or time, so that the optimum data can be read using the time information as an index.

  When the standby candidate places are set and the total number M of standby candidate places and the total number N of vehicles are fixed, the total number of allocation patterns for assigning the standby candidate places to each vehicle is calculated (step S5). When the attribute data is different for each vehicle and the reachable range that can be reached within a predetermined travel time is different, standby candidate locations are sequentially assigned to each vehicle as a permutation. In this case, the total number of assigned patterns is M! / (MN)! It becomes. For example, as shown in FIG. 3, when the number of standby candidate places is 12 and the number of vehicles is 4, the total number of patterns by permutation is 12! / 8! = 11880. Further, for example, when all the vehicles are the same vehicle type and the reachable range that can be reached within a predetermined travel time is the same for any vehicle, standby candidate locations are sequentially assigned to each vehicle as a combination. In this case, the total number of allocation patterns is M! / {(MN)! * N! }. For example, if the number of standby candidate places is 12 and the number of vehicles is 4, the total number of patterns by combination is 12! / (8! * 4!) = 495.

  If the total number of patterns is calculated, 0 is set as the initial value of the pattern number, and 0 is set as the maximum value of the evaluation value related to the entire reachable range (step S6). As an evaluation value related to the entire reachable area, an area of the entire reachable area, a population within the entire reachable area, and the like can be considered. In this embodiment, the area of the entire reachable range is used as the evaluation value related to the entire reachable range.

  If the initial value of the pattern number and the maximum area value (evaluation maximum value) is set, the pattern number is incremented by 1 (step S7). If a new pattern number is set, a standby candidate location assigned to each vehicle is specified according to the pattern number (step S8). For example, when the number of standby candidate places is 12 and the number of vehicles is 4 as shown in FIG. 3, with pattern number 1, the standby candidate places for the first, second, third, and fourth vehicles. C1, C2, C3 and C4 are assigned, respectively. In the following, it is assumed that the candidate standby location allocation pattern for each vehicle is represented as (C1, C2, C3, C4).

  If a standby candidate location is assigned to each vehicle, a reachable range that can be reached from the standby candidate location within a predetermined travel time is determined for each vehicle based on the vehicle attribute data and road traffic information (step S9). . This reach includes, for example, every route on which a vehicle can travel along a road extending from a candidate waiting location assigned to the vehicle, and includes all points on the road that can be reached within a predetermined travel time. Given as a closed loop. In FIG. 3, A2 indicates the reachable range that can be reached within the predetermined travel time from the waiting candidate location C2, and A5 indicates the reachable range that can be reached within the predetermined travel time from the standby candidate location C5. As shown in the figure, the reach is not a simple circle, but takes a complicated form according to the state of the laid road and traffic conditions. The travel time, which is the standard for determining the reach, is set as appropriate based on the use of fire engines, ambulances, police vehicles, gas / water / electricity repair vehicles, blood transport vehicles, and other vehicles. Is done.

  If the reachable range for each vehicle is obtained, the overall reachable range that can be reached within a predetermined travel time is obtained for the entire plurality of vehicles deployed in the target area (step S10). FIG. 5 is a diagram for explaining the entire reachable range. In FIG. 5, R indicates a target area, and C1 to C38 indicate standby candidate locations. In this example, the number of vehicles is four, and the allocation pattern of standby candidate locations is (C12, C10, C32, C29). A1 indicates the reach range of the first vehicle assigned to the waiting candidate location C12. A2 indicates the reach range of the second vehicle assigned to the waiting candidate location C10. A3 indicates the reach range of the third vehicle assigned to the waiting candidate location C32. A4 indicates the reach range of the fourth vehicle assigned to the waiting candidate location C29. The total range including the ranges A1, A2, A3 and A4 including the overlapping portions between the different ranges is obtained as the total range. In FIG. 5, for the sake of convenience, the reach range is represented by a circle, but in reality, it takes a complicated form as shown in FIG. 3.

  If the overall reachable range is determined, the area of the overall reachable range is obtained (step S11). An overlapping area between the reaching range A1 and the reaching range A2 is P12, an overlapping area between the reaching range A1 and the reaching range A3 is P13, and an overlapping area between the reaching range A3 and the reaching range A4 is P34. In addition, a region that protrudes from the target area R in the reach range A1 is S1, a region that protrudes from the target area R in the reach range A2 is S2, and a region that protrudes from the target area R in the reach range A4 is S4. The area of the entire reach range is determined by calculating the area of the region P12, the area of the region P13, and the area of the region P34 from the sum of the area of the reach range A1, the area of the reach range A2, the area of the reach range A3, and the area of the reach range A4. It is obtained by subtracting the sum of the area of the area S1, the area of the area S2, and the area of the area S4.

  Here, the case where the evaluation value is an area has been described, but for example, when the evaluation value is a population within the entire reachable range, similarly, the total of the population within the reachable range and the total of the population in the overlapping area By subtracting the total of the population in the protruding area, the population within the entire reach can be obtained. In addition, when calculating | requiring the population within the whole reachable range, the population information database which accumulated the data concerning population distribution is normally used. In addition, when the vehicle standby candidate location can be changed by time zone, a more accurate population can be obtained by using a time zone population information database that can acquire population distribution data by time zone. It becomes possible.

  If the area of the entire reachable range is obtained, it is determined whether or not the area is larger than the maximum area value (step S12). When it is larger than the maximum area value, the area is set as the maximum area value and the optimum allocation information is updated (step S13). In the example of FIG. 5, if the area of the entire reachable range is larger than the maximum area value, a new allocation pattern (C12, C10, C32, C29) is registered as the optimal allocation information.

  Next, it is determined whether or not the pattern number is equal to the total number of patterns (step S14). If the pattern number is not equal to the total number of patterns, the process returns to step S7. Further, if the pattern number is equal to the total number of patterns, it means that the evaluation related to the entire reach for all the patterns has been completed, so that a standby place is allocated to each vehicle based on the optimal allocation information (step S15). . For example, when the example of FIG. 5 gives the maximum area value, the first vehicle is arranged in the standby place C12 based on the assignment pattern (C12, C10, C32, C29) given as the optimum assignment information, and the second The third vehicle is disposed at the standby location C10, the third vehicle is disposed at the standby location C32, and the fourth vehicle is disposed at the standby location C29.

  In step S9, if the standby candidate location assigned to one vehicle is included in the reach range of another vehicle in the process of obtaining the vehicle reach, the calculation related to the assignment pattern is stopped. The process may be shifted to step S7 and the process related to the next allocation pattern may be executed. With this configuration, for an assignment pattern that has a high probability that it is not an optimum assignment pattern, it is possible to shorten the overall computation time by appropriately omitting computation related to the assignment pattern.

  Since the vehicle arrangement method according to the first embodiment of the present invention is configured as described above, it is possible for a plurality of vehicles deployed in a predetermined area to reach the entire vehicle within a predetermined travel time. It is possible to obtain an optimal vehicle arrangement that can maximize the area of the entire reachable range given as a range or the population within the reachable range. Further, since the attribute information can be set individually for each vehicle, the reach according to the characteristics of each vehicle is individually obtained, and the reliability of the optimum placement system can be improved. In addition, since the setting of the standby candidate place is changed according to the date, day of the week, or time, it is possible to realize the optimal vehicle arrangement for each time zone according to the land use situation of the target area. In addition, by selecting desired data from a plurality of standby candidate location data registered in the database, it is possible to set the standby candidate location, thereby improving user convenience. In addition, since areas outside the target area in the reach are excluded from the calculation of evaluation values such as area and population, more optimal vehicle placement can be realized only for the target area such as administrative areas. it can.

  Next explained is the second embodiment of the invention. In this second embodiment, the area of the target area is large with respect to the number of vehicles to be deployed, so that there is no overlap between the reachable ranges, and the entire reachable range is a simple sum of the reachable ranges. Assume the case. In such a case, it is conceivable that the vehicle allocation that maximizes the area of the entire reach is not necessarily the optimal allocation pattern. Therefore, it was decided that the total reach should occupy an area of a predetermined ratio or more in the target area as a requirement for executing the optimal evaluation. 6 and 7 are flowcharts showing a vehicle arrangement method according to the second embodiment of the present invention. 6 and 7, the same reference numerals as those in FIGS. 1 and 2 indicate the same processing contents, and the description thereof is omitted.

  If the total number of patterns is calculated in step S5, T is set as the initial value of the travel time. Also, in order to ensure that the arrangement of vehicles is optimal, it is assumed that the area occupied by the entire reach in the target area needs to be a predetermined ratio or more with respect to the area of the target area. To do. Therefore, X is set as an area threshold value representing the lower limit value of the area that the entire reachable range should have (step S21). In step S9, the reachable range relating to each vehicle is obtained based on the travel time T.

  If the evaluation of the entire reachable range for all the allocation patterns is completed in step S14, it is determined whether or not the area maximum value is larger than the area threshold value X (step S22). If the area maximum value is larger than the area threshold value, it means that a sufficiently wide area in the target area has been evaluated, and a standby place is assigned to each vehicle based on the optimum assignment information. If the maximum area value is less than or equal to the area threshold, the travel time T is incremented by a predetermined time so that the area occupied by the entire reach is increased (step S23), and the process returns to step S6.

  Since the vehicle arrangement method according to the second embodiment of the present invention is configured as described above, even when the number of vehicles is small, the total reach can be sufficiently increased by appropriately increasing the travel time. From this, it is possible to realize an optimal vehicle arrangement in consideration of a wider area in the target area. In addition, since it is possible to grasp the entire reach range for each travel time, it is possible to roughly specify the travel time that any vehicle can reach for each region in the target area.

  FIG. 8 is a diagram showing an example of a system for realizing the vehicle placement method of the present invention. In FIG. 8, 1 is a CPU that executes arithmetic processing such as calculation of a reach based on vehicle attribute information and road traffic information, and 2 is used as a load area for a vehicle placement program and as a workspace for arithmetic processing. RAM, 3 is a mass storage device for storing a vehicle arrangement program and various data, 4 is a communication control unit connected to a communication network such as the Internet and transmits / receives various data, 5 is a keyboard for inputting attribute information, etc. Is a mouse for specifying the position on the map, and 7 is a data bus for electronically connecting the components.

  The system shown in FIG. 8 can be realized as a personal computer or a workstation, for example. A program for realizing the algorithm shown in the flowcharts shown in FIGS. 1 and 2 or the flowcharts shown in FIGS. 6 and 7 is stored in, for example, the mass storage device 3 and loaded into the RAM 2 at the time of execution. In the large-capacity storage device 3, a map information database, a road information database, a road traffic information database, a population information database, and the like are constructed. Moreover, it is good also as a structure which inputs traffic information etc. in real time via the communication control part 4 from the road traffic information communication system center connected to a communication network, and updates the data in a database at any time. As for the above-mentioned various databases, as an integrated management method at the management center, data is transmitted to and received from the management center via the communication control unit 4 to perform analysis related to the optimal arrangement of the vehicle. It is good also as composition to do.

  The vehicle placement method and the vehicle placement program described in the first and second embodiments are not intended to limit the present invention, but are disclosed with the intention of illustrating them. The technical scope of the present invention is defined by the description of the scope of claims, and various design changes can be made within the technical scope described in the scope of claims. For example, in a target area, by creating a number of new standby candidate locations for each predetermined section and executing a simulation, a building location guideline is obtained for the facility to be constructed next from the obtained optimum layout information. be able to.

  In addition, when an emergency event occurs and one or more vehicles are rushing to the site of occurrence, or when the working hours are over, the number of vehicles in the standby state changes, and the vehicle is in the standby state. A simulation related to a new optimal arrangement is executed for only the vehicle. As a result of the simulation, for a vehicle whose standby place changes from the conventional one, an instruction may be given to the vehicle so as to change the standby place. FIG. 9 is a diagram illustrating an example of a vehicle movement information display screen. As shown in the figure, when the vehicle standby location is changed, the vehicle to be changed and the new standby location are shown on the map. In addition, road traffic information related to traffic conditions and the like is input in real time, and a simulation related to optimal placement is executed at predetermined time intervals. As a result of the simulation, for a vehicle whose standby place changes from the conventional one, an instruction may be given to the vehicle so as to change the standby place.

  Application examples of the present invention are not limited to optimal arrangement of vehicles for emergency vehicles such as fire trucks, ambulances, police vehicles, gas / water / electricity repair vehicles, blood transport vehicles, etc. It can be widely applied to optimal arrangement of vehicles related to vehicles used in transportation related businesses. By using the present invention, it is possible to realize an optimal arrangement of vehicles in a system that controls a predetermined area with a plurality of vehicles.

It is a flowchart which shows the vehicle arrangement | positioning method of a 1st Example. It is a flowchart which shows the vehicle arrangement | positioning method of a 1st Example. It is a figure which shows the example of the map data used by this invention. It is a figure which shows the example of a road traffic information display screen. It is a figure explaining the whole reachable range. It is a flowchart which shows the vehicle arrangement | positioning method of 2nd Example. It is a flowchart which shows the vehicle arrangement | positioning method of 2nd Example. It is a figure which shows the example of the system which implement | achieves the vehicle arrangement | positioning method of this invention. It is a figure which shows the example of a vehicle movement information display screen.

Explanation of symbols

S1: Target area setting step, S2: Road traffic information setting step, S3: Vehicle information input step, S4: Standby candidate place setting step, S5: Pattern total number calculation step, S6: Initial value setting step, S7: Pattern number increment step , S8: Standby candidate place assignment step, S9: Reach range calculation step, S10: Overall reach range calculation step, S11: Evaluation value calculation step, S12: Evaluation value comparison step, S13: Optimal assignment information update step, S14: Pattern number Comparison process, S15: Waiting place allocation process

Claims (10)

In the vehicle arrangement method for assigning each waiting place for a predetermined number of vehicles from among a predetermined number of waiting candidate places set on the map,
A first step of inputting information of a vehicle to be placed and setting a waiting candidate place on a map;
A second step of assigning waiting candidate locations to each vehicle;
For each vehicle, a third step of defining a reachable range within a predetermined travel time from the assigned waiting candidate location;
A fourth step of determining an overall reachable range that can be reached by the entire predetermined number of vehicles by combining the reachable ranges determined for the respective vehicles in the third step;
The process from the second process to the fourth process is repeated by assigning the standby candidate places to the predetermined number of vehicles from the predetermined number of standby candidate places based on the permutation or combination. A vehicle placement method comprising: a fifth step of executing and identifying an assignment pattern that realizes the quantitative optimization of the evaluation value relating to the entire reachable range, and assigning a standby place to each vehicle according to the assignment pattern.   The total coverage area or population within the total coverage area is given as an evaluation value for the total coverage area, and each vehicle is parked according to an allocation pattern that maximizes the total coverage area or population within the total coverage area. The vehicle placement method according to claim 1, wherein:   In the second step, when the standby candidate location assigned to a certain vehicle is included in the reach of another vehicle, the calculation related to the allocation pattern is stopped and the calculation related to the next allocation pattern is started. The vehicle placement method according to claim 1, wherein:   2. The vehicle arrangement according to claim 1, wherein attribute data relating to road driving is set for each vehicle, and in the third step, calculation is performed based on the attribute data for each vehicle to determine a reachable range. Method.   The vehicle placement method according to claim 1, wherein in the first step, the set standby candidate place is changed according to the date, day of the week, or time.   The standby candidate location is set on a map by selecting desired data from a database storing a plurality of data for specifying one or a plurality of standby candidate locations in the first step. The vehicle arrangement method according to claim 1.   3. The vehicle arrangement method according to claim 2, wherein an area of the total reachable area or a population within the total reachable area is calculated by excluding an area protruding from a predetermined area partitioned on the map. In the vehicle arrangement method for assigning each waiting place for a predetermined number of vehicles from among a predetermined number of waiting candidate places set on the map,
A first step of inputting information of a vehicle to be placed and setting a waiting candidate place on a map;
A second step of setting travel time;
A third step of assigning waiting candidate locations to each vehicle;
For each vehicle, a fourth step of determining a reachable range within a predetermined travel time from the assigned waiting candidate location;
A fifth step of determining an overall reachable range that can be reached by a predetermined number of vehicles as a whole by combining the reachable ranges determined for the respective vehicles in the fourth step;
The processing from the third step to the fifth step is repeated by assigning standby candidate locations to a predetermined number of vehicles based on a permutation or combination from among the predetermined number of standby candidate locations. A sixth step of performing and identifying an allocation pattern that achieves maximization of the overall reach area;
A seventh step of incrementing travel time and returning to the third step if the area of the total reach is less than a predetermined threshold;
And an eighth step of assigning a standby place to each vehicle according to the assignment pattern specified in the sixth step when the area of the entire reach is equal to or greater than a predetermined threshold. In the vehicle placement program for allocating each standby location for a predetermined number of vehicles from a predetermined number of standby candidate locations set on the map,
A first step of inputting information on a vehicle to be placed and setting a waiting candidate location on the map;
A second step of assigning waiting candidate locations to each vehicle;
For each vehicle, a third step of defining a reachable range within a predetermined travel time from the assigned waiting candidate location;
A fourth step of determining an overall reachable range that can be reached by a predetermined number of vehicles as a whole by combining the reachable ranges determined for each vehicle in the third step;
Repeat the processing from the second step to the fourth step by assigning the standby candidate locations to the predetermined number of vehicles based on the permutation or combination from among the predetermined number of standby candidate locations. And a fifth step of specifying an allocation pattern that implements the quantitative optimization of the evaluation value relating to the entire reach and assigning a standby place to each vehicle according to the allocation pattern Placement program. In the vehicle placement program for allocating each standby location for a predetermined number of vehicles from a predetermined number of standby candidate locations set on the map,
A first step of inputting information on a vehicle to be placed and setting a waiting candidate location on the map;
A second step of setting travel time;
A third step of assigning waiting candidate locations to each vehicle;
For each vehicle, a fourth step of determining a reachable range within a predetermined travel time from the assigned waiting candidate location;
A fifth step of determining an overall reachable range that can be reached by the entire predetermined number of vehicles by combining the reachable ranges determined for the respective vehicles in the fourth step;
Repeat the processing from the third step to the fifth step by assigning the standby candidate locations to the predetermined number of vehicles based on the permutation or combination from among the predetermined number of standby candidate locations. A sixth step of performing and identifying an allocation pattern that achieves maximization of the overall reach area;
A seventh step of incrementing travel time and returning to the third step if the area of the total reach is less than a predetermined threshold;
A vehicle arrangement program configured to include an eighth step of assigning a standby place to each vehicle according to the assignment pattern specified in the sixth step if the area of the entire reach is equal to or greater than a predetermined threshold.

Images