JPH064516A - Assignment decision support system - Google Patents
Assignment decision support systemInfo
- Publication number
- JPH064516A JPH064516A JP15801092A JP15801092A JPH064516A JP H064516 A JPH064516 A JP H064516A JP 15801092 A JP15801092 A JP 15801092A JP 15801092 A JP15801092 A JP 15801092A JP H064516 A JPH064516 A JP H064516A
- Authority
- JP
- Japan
- Prior art keywords
- parking
- evaluation value
- areas
- cars
- allocation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Abstract
Description
【０００１】[0001]
【産業上の利用分野】本発明は、エキスパートシステム
におけるレイアウト問題において、時系列的に発生する
物を、予めいくつかに区切られた領域に効率的に割当て
る割当て決定支援方式に関する。BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an allocation decision support system for efficiently allocating time-sequentially generated objects to a region divided in advance in a layout problem in an expert system.
【０００２】[0002]
【従来の技術】従来より、複数の物Ｘi(i=0,…,n) を複
数の区切られた領域ｙj(j=0,…,m) に対して割当て配置
することが、あらゆる分野で多々行なわれている。2. Description of the Related Art Conventionally, allocation of a plurality of objects Xi (i = 0, ..., n) to a plurality of divided areas yj (j = 0, ..., m) is performed in all fields. It is often done.
【０００３】図５は車を駐車場に割当てる際の割当て状
況を示すもので、例えば駐車場で次々に到着する車ｘi
(i=0,…,n) を区切られた駐車領域ｙj(j=0,…,m) に配
置することがある。この場合、車には、小型、中型、大
型等の大きさがある。まず、１つの割当て方法として、
駐車場を大きめの駐車領域に均等に区切り、車をランダ
ムに割当てる方法がある。FIG. 5 shows the allocation situation when allocating a car to a parking lot. For example, cars xi arriving one after another at the parking lot.
(i = 0, ..., n) may be arranged in the divided parking area yj (j = 0, ..., m). In this case, the vehicle has sizes such as small size, medium size, and large size. First, as one allocation method,
There is a method of evenly dividing the parking lot into large parking areas and randomly assigning cars.
【０００４】しかし、この割当て方法では、小型の車で
も中型や大型の車と同じ区画を占領してしまい、領域の
無駄が発生する。また、上記予め区切られた領域よりも
大きい車は該領域内に駐車することができず、この場
合、続いて２箇所の領域が空いている場所を探して駐車
する等の特別な割当て処置を採らなければならない。However, according to this allocation method, a small car occupies the same section as a medium-sized car or a large car, resulting in waste of area. Further, a vehicle larger than the pre-separated area cannot be parked in the area, and in this case, special allocation measures such as searching for a place where two areas are vacant and parking the car are subsequently taken. Must be taken.
【０００５】また、他の割当て方法として、大型、中
型、小型と、予め駐車領域を分けて区切り、それぞれの
大きさの車と対応付ける方法がある。この場合、様々な
大きさの車に対応でき、ある程度の領域の無駄は省ける
が、この場合でも、予め領域を分割するにあたり、車の
大きさより小さい領域に駐車することは不可能であるた
め、１つの領域をある程度大きめに取る必要がある。As another allocation method, there is a method of dividing a parking area into large, medium, and small parking areas in advance and associating them with vehicles of different sizes. In this case, it is possible to accommodate cars of various sizes, and it is possible to save a certain amount of area waste, but even in this case, it is impossible to park in an area smaller than the size of the car when dividing the area in advance. It is necessary to make one region a little larger.
【０００６】そして、上記駐車領域の区切り方によって
は、大型の領域に小型が多く駐車されたり、大型の領域
が不足して、前記１つ目の割当て方法と同様、特別な割
当て処置を採らねばならないことになる。これら２つの
割当て方法では、時系列的に発生する車ｘを物理的に並
んだ領域ｙj(j=0,…,m) に割当てるにあたり、 Ｆ（ｘ，ｙj ） を評価関数としてｘとｙj の関係を評価し、その評価値
の最も良いｙj に割当てを行なっている。[0006] Depending on how to divide the parking area, many small areas are parked in a large area, or the large area is insufficient. Therefore, as in the first allocation method, a special allocation procedure must be taken. It will not happen. In these two allocation methods, when allocating vehicles x generated in time series to physically arranged regions yj (j = 0, ..., m), F (x, yj) is used as an evaluation function of x and yj. The relationship is evaluated, and yj having the best evaluation value is assigned.
【０００７】すなわち、この場合、全てのｙj を固定領
域としているため、物ｘに対して、領域ｙj の属性、つ
まり、ｙj は空いているか、広さが充分あるか等、ｙj
に関する情報のみでｘ，ｙj の関係を評価している。こ
のように、ｘを領域ｙj に割当てる場合に、ｙj のみの
情報で割当てる方法を採ると、上記のように領域ｙj を
予め大きく取る必要がある。That is, in this case, since all yj are fixed areas, the attribute of the area yj with respect to the object x, that is, whether yj is empty or has a sufficient area, yj
The relationship between x and yj is evaluated only by the information about. Thus, when x is assigned to the area yj, if the method of assigning only the information of yj is adopted, it is necessary to make the area yj large in advance as described above.
【０００８】一方、駐車場に拘らず、荷物を倉庫内の領
域に配置する場合等では、周辺に似た種類の荷物を配置
することにより、出入れが容易になることがあり、ｘと
ｙjの関係を個々のｙj のみでなく、 Ｆ（ｘ，ｙ1 ，…，ｙm ） とし、ｙj 全体を考慮する方法が採られることがある。
しかしこの方法では、評価の基になる要素が多過ぎるた
め、その計算に時間が掛かる問題がある。On the other hand, when arranging luggage in the area of the warehouse regardless of the parking lot, locating luggage of a similar type in the surrounding area may facilitate access, and x and yj In some cases, not only the individual yj but also F (x, y1, ...
However, this method has a problem that the calculation takes time because there are too many elements to be the basis of evaluation.
【０００９】すなわち、時系列的に発生するｘi(i=0,
…,n) が予め判っている場合、つまり、予めｘi の到着
スケジュールが判っている場合や、ｘi の到着以前に到
着予告がされる場合、また、複数のｘi が同時に到着し
た場合を考える。この場合、ｘ1 ，…，ｘn とｙ1 ，
…，ｙm の全ての組合せの評価値を計算し、ｘi の順番
に拘らず最も良いと思われるｘi とｙj の組合せから割
当てることになる。That is, xi (i = 0,
, N) is known in advance, that is, the arrival schedule of xi is known in advance, an arrival notice is given before the arrival of xi, and a plurality of xi arrives at the same time. In this case, x1, ..., xn and y1,
The evaluation values of all combinations of ym and so on are calculated, and allocation is performed from the combination of xi and yj which seems to be the best regardless of the order of xi.
【００１０】しかしながら、１つのｘi をあるｙj に割
当てた後、該割当てられたｙj の情報が変化するため、
次のｘi+1 の割当てを決めるのにあたり、再び全ての組
合せについて評価値を計算し直す必要があり、非常に時
間が掛かる問題がある。However, after allocating one xi to a certain yj, the information of the allocated yj changes.
In determining the next allocation of xi + 1, it is necessary to recalculate the evaluation values for all combinations, which is a very time-consuming problem.
【００１１】[0011]
【発明が解決しようとする課題】すなわち、ｘi とｙj
との関係の評価を、ｘi と個々のｙj のみから計算する
従来の方法では、該ｙj の周辺の領域の状態を考慮しな
いため、ｙj の物理的なスペースを予め決定する必要が
ある。この場合、ｙj のスペースをｘi の標準より予め
大きく取る必要があり、空間の無駄があると共に、予め
決められたｙj よりも大きなｘi は割当て困難になる問
題ある。That is, xi and yj
In the conventional method of calculating the evaluation of the relationship between yj and only individual yj, the physical space of yj needs to be determined in advance because the state of the area around yj is not considered. In this case, it is necessary to make the space of yj larger than the standard of xi, and there is a waste of space, and it is difficult to allocate xi larger than the predetermined yj.
【００１２】また、ｙj を予めいくつかの段階に分けて
設定する場合でも、ｘi のばらつきによってｙj の分割
を正しく考慮しないと、実際のｘi の割当てが困難にな
る場合があり、結果的に空間の無駄が発生する。Even when yj is divided into several steps and set in advance, the actual allocation of xi may be difficult unless the division of yj is properly taken into consideration due to the variation of xi, resulting in space. Is wasted.
【００１３】一方、ｘi とｙj との関係の評価を、ｘi
とｙ1 ，…，ｙm から計算する従来の方法では、ｙj 全
体を考慮することで効率的な割当て配置が行なえるが、
評価値の計算に長い時間を要する問題がある。On the other hand, the evaluation of the relationship between xi and yj is
In the conventional method of calculating from y1, ..., Ym, efficient allocation arrangement can be performed by considering the entire yj.
There is a problem that it takes a long time to calculate the evaluation value.
【００１４】本発明は上記課題に鑑みなされたもので、
物ｘi を領域ｙj に割当てる際に、予め領域の分割を決
定することなく、空間的な無駄の発生を防止し、しか
も、長時間の評価値計算を要することなく、ｙj 周辺の
領域も考慮した効率的な割当てが可能になる割当て決定
支援方式を提供することを目的とする。The present invention has been made in view of the above problems.
When allocating the object xi to the area yj, it is possible to prevent the generation of spatial waste without deciding the area division in advance, and to consider the area around yj without requiring a long-time evaluation value calculation. An object is to provide an allocation decision support method that enables efficient allocation.
【００１５】[0015]
【課題を解決するための手段】すなわち、本発明に係わ
る割当て決定支援方式は、時系列的に発生する物Ｘi(i=
0,…,n) を物理的な基準により番号付けられた領域ｙj
(j=0,…,m) に割当てるに際し、上記ｘi とｙj との関
係を評価するにあたり、ｘi とｙj 及び該ｙj に隣接す
るｙj-1 及びｙj+1 のみの情報からなる評価関数 Ｆ（ｘi ，ｙj-1 ，ｙj ，ｙj+1 ） を作成し、この評価値計算を各ｙj に対して繰返し行な
い、最も評価値の良いｘi とｙj の組合せから割当てを
決定するものである。That is, the allocation decision support method according to the present invention is a time-sequentially generated object Xi (i =
0, ..., n) areas yj numbered according to physical criteria
When allocating (j = 0, ..., m), in evaluating the relationship between xi and yj, an evaluation function F (only consisting of information of xi and yj and yj-1 and yj + 1 adjacent to yj) xi, yj-1, yj, yj + 1) are created, the evaluation value calculation is repeated for each yj, and the allocation is determined from the combination of xi and yj having the best evaluation value.
【００１６】[0016]
【作用】つまり、ｘi をｙj に割当てるに際し、隣接す
るｙj の情報を考慮するため、例えば隣接する領域に小
さめの物がある場合、ｙj には領域以上の大きさの物を
置くことができるという判断や、隣接する領域に領域以
上の物がある場合、ｙjには小さい物のみ置けるという
判断が行なえ、ｙj の大きさを標準に近い大きさとして
分割しても、全ての型のｘi が効率的に割当てられる。In other words, when xi is assigned to yj, information of adjacent yj is taken into consideration. For example, when there is a small object in the adjacent area, an object having a size larger than the area can be placed in yj. It can be judged that only small objects can be placed in yj if there are more objects than adjacent areas in the adjacent area. Even if yj is divided to a size close to the standard, xi of all types is efficient. Be allocated to each other.
【００１７】また、ｙj 以外の情報をｙj に隣接するｙ
j-1 ，ｙj+1 に限定することにより、個々のｙj 以外の
情報をも含んで適切な割当てが行なえるにも拘らず、評
価値計算に要する時間が削減されるようになる。Information other than yj is adjacent to yj.
By limiting the number to j-1 and yj + 1, it is possible to reduce the time required to calculate the evaluation value although the appropriate allocation can be performed by including the information other than the individual yj.
【００１８】[0018]
【実施例】以下図面により本発明の一実施例について説
明する。DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings.
【００１９】図１は割当て決定支援方式を適用した情報
処理システムの構成を示すブロック図であり、この情報
処理システムは、予めある一定の大きさの駐車領域に区
切られている駐車場に、順次到着する車の駐車領域を決
定する場合の、割当て決定支援システムである。FIG. 1 is a block diagram showing the configuration of an information processing system to which the allocation decision support method is applied. This information processing system is arranged in a parking lot which is divided into parking areas of a certain size in advance. It is an allocation decision support system for deciding a parking area for a arriving vehicle.
【００２０】この情報処理システムは、ｘデータ保持部
１１と、ｙデータ記憶部１２と、候補作成部１３と、条
件検査部１４と、評価値計算部１５と、評価値記憶部１
６と、候補決定部１７と、割当部１８とから構成され
る。This information processing system includes an x data holding unit 11, ay data storage unit 12, a candidate creation unit 13, a condition checking unit 14, an evaluation value calculation unit 15, and an evaluation value storage unit 1.
6, a candidate determination unit 17, and an allocation unit 18.
【００２１】ｘデータ保持部１１は、ランダムに発生す
る駐車場に到着する車ｘi に関する情報、すなわち、到
着した車ｘi の大きさ情報を割当て終了まで保持するも
ので、このｘデータ保持部１１に保持された車ｘi の大
きさ情報は、候補作成部１３に与えられる。The x data holding unit 11 holds information about cars xi arriving at randomly generated parking lots, that is, size information of the arriving cars xi until the end of the allocation. The stored size information of the car xi is given to the candidate creating unit 13.
【００２２】ｙデータ記憶部１２は、車ｘi が割当てら
れる場所ｙj についての情報、すなわち、ｙj の物理的
な位置情報や現在割当てられている車ｘi の大きさ情報
が記憶されるもので、このｙデータ記憶部１２に記憶さ
れた駐車場所ｙj に関する情報は、候補作成部１３に与
えられる。The y data storage unit 12 stores information about a place yj to which the vehicle xi is assigned, that is, physical position information of yj and size information of the currently assigned vehicle xi. The information about the parking place yj stored in the y data storage unit 12 is given to the candidate creation unit 13.
【００２３】候補作成部１３は、上記ｘデータ保持部１
１に対し到着した車ｘi の情報が保持されると、ｘi と
ｙj の組合せを順次作成するもので、このｘi ，ｙj の
組合せデータは条件検査部１４に送られる。The candidate creation unit 13 is the x data holding unit 1
When the information of the vehicle xi arriving for 1 is held, the combination of xi and yj is sequentially created, and the combination data of xi and yj is sent to the condition inspection unit 14.
【００２４】条件検査部１４は、候補作成部１３で作成
されたｘi とｙj の組合せについて、後述する予め指定
された条件に合致している否かを検査するもので、この
条件検査部１４における検査結果は候補作成部１３に送
られ、条件が合致している組合せ候補ｘi ，ｙj は評価
値計算部１５に送られる。The condition checking unit 14 checks whether or not the combination of xi and yj created by the candidate creating unit 13 meets a prespecified condition described later. The inspection result is sent to the candidate creation unit 13, and the combination candidates xi and yj that meet the conditions are sent to the evaluation value calculation unit 15.
【００２５】評価値計算部１５は、上記条件検査後に候
補作成部１３から送られたｘi とｙj の組合せに対し、
予め定義されたｘi とｙj 及びｙj に隣接するｙj-1 と
ｙj+1 に関する情報のみからなる評価関数Ｆを用いて評
価関数を計算するもので、この評価値計算部１５にて、
上記条件合致したそれぞれのｙj について計算された評
価値データは、評価値記憶部１６に送られて保存され
る。The evaluation value calculation unit 15 calculates the combination of xi and yj sent from the candidate creation unit 13 after the above condition inspection,
The evaluation function is calculated by using the evaluation function F consisting only of information on yj-1 and yj + 1 adjacent to xi and yj and yj which are defined in advance.
The evaluation value data calculated for each yj satisfying the above conditions is sent to and stored in the evaluation value storage unit 16.
【００２６】候補決定部１７は、評価値記憶部１６に保
持されたそれぞれのｙj における評価値データに基づ
き、到着した車ｘi に対する最良の駐車場所ｙj を決定
するもので、この候補決定部１７により決定された駐車
場所ｙj は割当部１８に送られ、到着した車ｘi に対し
最適な駐車場所ｙj が割当られる。The candidate determining section 17 determines the best parking place yj for the arrived vehicle xi based on the evaluation value data in each yj held in the evaluation value storage section 16. The determined parking place yj is sent to the allocating unit 18, and the optimal parking place yj is allocated to the arriving vehicle xi.
【００２７】図２は上記情報処理システムが割当て決定
支援システムとして運用される駐車場を示すもので、こ
の駐車場は例えば中型の車ｘi に対応させて区画されて
おり、駐車場所ｙ0 には大型車ｘ0 が、駐車場所ｙ3 に
は中型車ｘ1 が、駐車場所ｙ6 には小型車ｘ2 がそれぞ
れ既に駐車されている。FIG. 2 shows a parking lot in which the above-mentioned information processing system is operated as an allocation decision support system. This parking lot is divided corresponding to, for example, a medium-sized car xi, and a large-sized parking place y0 is provided. A vehicle x0, a medium-sized vehicle x1 is already parked at the parking place y3, and a small vehicle x2 is already parked at the parking place y6.
【００２８】ここで、上記駐車場には、大型，中型，小
型の車を駐車できるが、隣接する駐車領域間にはいくつ
かの条件が与えられ、上記条件検査部１４では、次の４
つの条件が検査される。 （条件０）既にｙj に車が駐車してある場合、ｘi は駐
車できない。 （条件１）ｙj の隣に大型の車が駐車されている場合、
小型以下の車ｘi のみ駐車できる。 （条件２）ｙj の隣に中型の車が駐車されている場合、
中型以下の車ｘi のみ駐車できる。 （条件３）ｙj の隣に小型の車が駐車されている場合、
及び何も駐車されていない場合、全ての車ｘi を駐車で
きる。 また、上記評価値計算部１５にて、上記条件検査後にお
けるそれぞれのｙj に対する評価計算式となる評価関数
Ｆは、次の式で定義される。 Ｆ（ｘi ，ｙj-1 ，ｙj ，ｙj+1 ） ＝適合度（ｘi ，car-of（ｙj-1 ）） ＋適合度（ｘi ，car-of（ｙj+1 ）） ＋便利度（ｙj ） ここで、ｘi は到着した車のサイズ、car-of（ｙk ）は
ｙk に現在駐車されている車のサイズを示し、その値si
ze（ｘk ）は次のように設定される。 size（ｘk ）：ｘk が大型の時 ３ ｘk が中型の時 ２ ｘk が小型の時 １ ｘk が存在しない時 ０Here, large, medium and small vehicles can be parked in the parking lot, but some conditions are given between the adjacent parking areas.
Two conditions are checked. (Condition 0) If a car is already parked at yj, xi cannot be parked. (Condition 1) When a large car is parked next to yj,
Only small cars xi or smaller can be parked. (Condition 2) When a medium-sized car is parked next to yj,
Only medium-sized vehicles xi can park. (Condition 3) If a small car is parked next to yj,
And all cars xi can be parked if nothing is parked. Further, in the evaluation value calculation unit 15, an evaluation function F which is an evaluation calculation formula for each yj after the condition inspection is defined by the following formula. F (xi, yj-1, yj, yj + 1) = goodness of fit (xi, car-of (yj-1)) + goodness of fit (xi, car-of (yj + 1)) + convenience (yj) Where xi is the size of the arriving car, car-of (yk) is the size of the car currently parked at yk, and its value si
ze (xk) is set as follows. size (xk): When xk is large 3 When xk is medium 2 When xk is small 1 When xk does not exist 0
【００２９】つまり、上記評価関数Ｆにおける第１項及
び第２項それぞれの適合度は、隣接する場所の車の適合
の良さを示し、２つの車のサイズ値を加算したものにな
るので、大型と小型、中型と中型といった上記（条件
０）〜（条件３）を最も満たす場合に最高値“４”にな
る。そして、上記評価関数Ｆにおける第１項乃至第２項
を展開すると、 size（car-of（ｙj-1 ））＋２size（ｘi ）＋size（ca
r-of（ｙj+1 ）） となり、これにより得られる値の大小が適合度の高低と
なる。一方、上記評価関数Ｆにおける第３項の便利度は
次の式で与えられる。 便利度（ｙk ）＝−０．１＊k ここで、k は駐車場における駐車場所ｙk の入口からの
距離に比例し、その値は次のように設定される。 ｙ0 ＝０、ｙ1 ＝１、ｙ2 ＝２、ｙ3 ＝３、…、ｙ6 ＝
６ つまり、駐車場所ｙk の便利度は、入口から離れる程
“−”値が大きくなり低くなる。したがって、上記適合
度と便利度を加算した評価関数Ｆは、隣接する車同士の
適合が良く、入口に近い駐車場所ほど高い評価値とな
る。次に、上記構成による情報処理システムの動作につ
いて説明する。図３は上記情報処理システムにおける割
当て決定支援処理を示すフローチャートである。図４は
上記情報処理システムにおける割当て決定支援処理に伴
う評価値算出状況を示す図である。That is, the goodness of fit of each of the first and second terms in the evaluation function F indicates the goodness of fit of the cars at the adjacent places, and is the sum of the size values of the two cars, so that the size is large. When the above (Condition 0) to (Condition 3) such as small size, medium size and medium size are most satisfied, the maximum value is "4". When the first and second terms in the evaluation function F are expanded, size (car-of (yj-1)) + 2size (xi) + size (ca
r-of (yj + 1)), and the magnitude of the value obtained by this becomes the degree of conformity. On the other hand, the degree of convenience of the third term in the evaluation function F is given by the following equation. Convenience (yk) =-0.1 * k Here, k is proportional to the distance from the entrance of the parking place yk in the parking lot, and its value is set as follows. y0 = 0, y1 = 1, y2 = 2, y3 = 3, ..., y6 =
6 That is, the degree of convenience of the parking place yk decreases as the distance from the entrance increases and the "-" value increases. Therefore, the evaluation function F, which is obtained by adding the degree of conformity and the degree of convenience, is good for the adjoining cars, and the evaluation value becomes higher as the parking place is closer to the entrance. Next, the operation of the information processing system having the above configuration will be described. FIG. 3 is a flowchart showing an allocation decision support process in the above information processing system. FIG. 4 is a diagram showing a situation of evaluation value calculation accompanying the allocation decision support processing in the information processing system.
【００３０】ここで、ｙデータ記憶部１２には、予め車
ｘ0 ，ｘ1 ，ｘ2 が駐車されているそれぞれの駐車場所
ｙ0 ，ｙ3 ，ｙ6 に対応して、その大きさ情報“３”
“２”“１”が記憶されていると共に、各駐車場所ｙ0
〜ｙ6 それぞれの入口からの距離に比例する位置情報
“０〜６”が記憶されている。すなわち、例えば図２に
示す駐車場に小型車ｘ3 が到着した場合、該小型車ｘ3
の大きさ情報“１”がｘデータ保持部１１に保持される
（ステップＳ１）。Here, the size information "3" is stored in the y-data storage unit 12 in correspondence with the respective parking locations y0, y3, y6 in which the vehicles x0, x1, x2 are parked in advance.
"2" and "1" are stored and each parking place y0
~ Y6 Position information "0-6" proportional to the distance from each entrance is stored. That is, for example, when a small car x3 arrives at the parking lot shown in FIG. 2, the small car x3
The size information "1" of x is held in the x data holding unit 11 (step S1).
【００３１】すると、候補作成部１３では、まず、小型
車ｘ3 と駐車場所ｙ0 の組合せが検索されるもので、こ
の組合せ（ｘ3 ，ｙ0 ）について条件検査部１４による
前記４つの条件（０〜３）に基づく条件検査が実行され
る（ステップＳ２〜Ｓ４）。Then, the candidate creating unit 13 first searches for a combination of the small car x3 and the parking place y0. For this combination (x3, y0), the four conditions (0-3) by the condition checking unit 14 are searched. The condition inspection based on is executed (steps S2 to S4).
【００３２】この場合、駐車場所ｙ0 には既に車ｘ0 が
駐車してあるので、該駐車場所ｙ0は（条件０）により
除外され、再び候補検索部１３にて次の駐車場所ｙ1 と
の組合せが検索されると共に、この組合せ（ｘ3 ，ｙ1
）についての条件検査が実行される（ステップＳ５→
Ｓ２〜Ｓ４）。In this case, since the car x0 is already parked at the parking place y0, the parking place y0 is excluded by (condition 0), and the candidate search unit 13 again sets the combination with the next parking place y1. This combination (x3, y1
) Is executed (step S5 →
S2-S4).
【００３３】この場合、駐車場所ｙ1 の隣には大型車ｘ
0 が駐車されており、到着車ｘ3 は小型車なので、（条
件１）により条件検査ＯＫとなり、組合せ（ｘ3 ，ｙ1
）についての評価値が評価値計算部１５にて計算され
る（ステップＳ５→Ｓ６）。In this case, a large vehicle x is next to the parking place y1.
Since 0 is parked and the arriving vehicle x3 is a small car, the condition inspection is OK due to (condition 1), and the combination (x3, y1
Is evaluated by the evaluation value calculation unit 15 (steps S5 → S6).
【００３４】つまり、小型車ｘ3 に対する駐車場所ｙ1
の評価値は、ｘデータ記憶部１１に記憶された到着車ｘ
3 の大きさ情報“１”とｙデータ記憶部１２に記憶され
た隣接駐車場所ｙ0 ，ｙ2 それぞれの車両大きさ情報
“３”“０”及び駐車場所ｙ1の位置情報“１”を用
い、前記評価関数Ｆにより計算されるもので、すなわ
ち、 Ｆ（ｘ3 ，ｙ0 ，ｙ1 ，ｙ2 ） ＝適合度（ｘ3 ，car-of（ｙ0 ）） ＋適合度（ｘ3 ，car-of（ｙ2 ）） ＋便利度（ｙ1 ） ＝size（car-of（ｙ0 ））＋２size（ｘ3 ）＋size（ca
r-of（ｙ2 ））＋（−０．１＊ｙ1 ） ＝３＋２＋０＋（−０．１）＝４．９ となり、図４（ａ）の小型車ｘ3 の段に示すように、駐
車場所ｙ1 の評価値４．９が評価値記憶部１６に記憶さ
れる（ステップＳ７）。That is, the parking place y1 for the small car x3
The evaluation value of x is the arrival vehicle x stored in the x data storage unit 11.
Using the size information “1” of 3 and the vehicle size information “3” “0” of the adjacent parking places y0 and y2 and the position information “1” of the parking place y1 stored in the y data storage unit 12, It is calculated by the evaluation function F, that is, F (x3, y0, y1, y2) = goodness of fit (x3, car-of (y0)) + goodness of fit (x3, car-of (y2)) + convenient Degree (y1) = size (car-of (y0)) + 2size (x3) + size (ca
r-of (y2)) + (-0.1 * y1) = 3 + 2 + 0 + (-0.1) = 4.9, which is the evaluation of the parking place y1 as shown in the row of the small car x3 in FIG. 4 (a). The value 4.9 is stored in the evaluation value storage unit 16 (step S7).
【００３５】この後、上記ステップＳ２〜Ｓ７を繰返し
実行することで、各駐車場所ｙ2 〜ｙ6 が条件検査され
ると共に、その評価値が計算され、上記評価値記憶部１
６に順次記憶される。After that, by repeatedly executing the above steps S2 to S7, each parking place y2 to y6 is conditionally inspected, and its evaluation value is calculated.
6 are sequentially stored.
【００３６】そして、上記ステップＳ３において、到着
車ｘi に対する駐車場所ｙj の組合せ候補なしと判断さ
れると、上記評価値記憶部１６に記憶された各駐車場所
ｙ0〜ｙ6 の評価値（図４（ａ）小型車段参照）に基づ
き最も高い評価値４．９に対応する組合せ（ｘ3 ，ｙ1
）が候補決定部１７にて検索され、これが割当部１８
に送られて到着車ｘ3 に対する最良駐車場所ｙ1 として
割当てられる（ステップＳ８，Ｓ９）。If it is determined in step S3 that there is no combination candidate for the parking location yj for the arriving vehicle xi, the evaluation values of the parking locations y0 to y6 stored in the evaluation value storage unit 16 (see FIG. a) The combination (x3, y1) corresponding to the highest evaluation value of 4.9 based on the small vehicle position)
) Is searched by the candidate determination unit 17, and this is assigned by the allocation unit 18
And is assigned as the best parking location y1 for the arriving vehicle x3 (steps S8, S9).
【００３７】ここで、他の到着車ｘi が存在する場合に
は、上記ステップＳ９による駐車場所ｙ3 の割当てに応
じて不要になった駐車場候補ｙj が条件検査により除外
され、この除外駐車場に関連する駐車場候補についての
評価値が再計算される（ステップＳ１０〜Ｓ１２）。If there is another arriving vehicle xi, the parking lot candidate yj which becomes unnecessary according to the allocation of the parking place y3 in the above step S9 is excluded by the condition inspection, and is left in this exclusion parking lot. The evaluation value for the relevant parking lot candidate is recalculated (steps S10 to S12).
【００３８】一方、例えば図２に示す駐車場に中型車ｘ
3 が到着した場合、該中型車ｘ3 の大きさ情報“２”が
ｘデータ保持部１１に保持される（ステップＳ１）。そ
して、上記ステップＳ２〜Ｓ７の処理が繰返し実行され
ることで、駐車場所候補ｙ0，ｙ1 ，ｙ3 ，ｙ6 は条件
検査により除外され、ｙ2 ，ｙ4 ，ｙ5 に対するそれぞ
れの評価値が計算され評価値記憶部１６に記憶される
（図４（ａ）中型車段参照）。On the other hand, for example, a medium-sized car x is placed in the parking lot shown in FIG.
When 3 arrives, the size information "2" of the medium-sized car x3 is held in the x-data holding unit 11 (step S1). Then, by repeatedly executing the processes of steps S2 to S7, the parking place candidates y0, y1, y3, y6 are excluded by the condition inspection, and the respective evaluation values for y2, y4, y5 are calculated and the evaluation value storage is performed. It is stored in the section 16 (see the medium-sized vehicle stage in FIG. 4A).
【００３９】すると、上記評価値記憶部１６に記憶され
た最も高い評価値５．８に対応する駐車場所候補ｙ2 が
候補決定部１７にて検索され、これが割当部１８に送ら
れて中型車ｘ3 に対する最良駐車場所ｙ2 として割当て
られる（ステップＳ８，Ｓ９）。Then, the parking lot candidate y2 corresponding to the highest evaluation value 5.8 stored in the evaluation value storage unit 16 is searched by the candidate determination unit 17, and this is sent to the allocation unit 18 and the medium-sized vehicle x3. Is assigned as the best parking place y2 for (steps S8, S9).
【００４０】一方、例えば図２に示す駐車場に大型車ｘ
3 が到着した場合、該大型車ｘ3 の大きさ情報“３”が
ｘデータ保持部１１に保持される（ステップＳ１）。そ
して、上記ステップＳ２〜Ｓ７の処理が繰返し実行され
ることで、駐車場所候補ｙ0，ｙ1 ，ｙ2 ，ｙ3 ，ｙ4
，ｙ6 は条件検査により除外され、ｙ5 のみに対する
評価値が計算され評価値記憶部１６に記憶される（図４
（ａ）大型車段参照）。On the other hand, for example, in a parking lot shown in FIG.
When 3 arrives, the size information "3" of the large vehicle x3 is held in the x data holding unit 11 (step S1). Then, the processing of steps S2 to S7 described above is repeatedly executed, so that parking place candidates y0, y1, y2, y3, y4 are obtained.
, Y6 are excluded by the conditional inspection, and the evaluation value for only y5 is calculated and stored in the evaluation value storage unit 16 (FIG. 4).
(A) Refer to the large vehicle tier.
【００４１】すると、上記評価値記憶部１６に記憶され
た最も高い評価値６．５に対応する駐車場所候補ｙ5 が
候補決定部１７にて検索され、これが割当部１８に送ら
れて大型車ｘ3 に対する最良駐車場所ｙ5 として割当て
られる（ステップＳ８，Ｓ９）。Then, the candidate determining section 17 searches for a parking location candidate y5 corresponding to the highest evaluation value 6.5 stored in the evaluation value storage section 16 and sends it to the allocating section 18 for a large vehicle x3. Is assigned as the best parking place y5 for (steps S8, S9).
【００４２】したがって、中型車を駐車するに適した駐
車領域の区画であるにも拘らず、小型、中型、大型の車
ｘi 何れに対しても、適切な駐車場所ｙj を割当てるこ
とができ、しかも、割当て評価値の計算処理を、割当て
候補に隣接する駐車場所の情報のみ利用して行なうの
で、複雑な計算を必要とせず、高速な割当て処理が実現
できる。Therefore, it is possible to assign an appropriate parking place yj to any of the small, medium and large vehicles xi, although the parking area is suitable for parking a medium-sized vehicle. Since the calculation process of the allocation evaluation value is performed only by using the information on the parking places adjacent to the allocation candidate, a high-speed allocation process can be realized without requiring complicated calculation.
【００４３】次に、例えば図２に示す駐車場に小型車ｘ
3 ，中型車ｘ4 ，大型車ｘ5 が同時に到着した場合、各
到着車ｘ3 ，ｘ4 ，ｘ5 の大きさ情報“１”“２”
“３”がそれぞれｘデータ保持部１１に保持される（ス
テップＳ１）。そして、上記ステップＳ２〜Ｓ７の処理
が繰返し実行されることで、到着車ｘ3 ，ｘ4 ，ｘ5 そ
れぞれの駐車場候補ｙ0 〜ｙ6 の全てに対し条件検査が
行なわれ、条件合致したそれぞれの駐車場候補に対する
評価値が計算され、図４（ａ）で示すように、評価値記
憶部１６に記憶される。Next, for example, in the parking lot shown in FIG.
3, when medium-sized vehicle x4 and large-sized vehicle x5 arrive at the same time, size information of each arriving vehicle x3, x4, x5 "1""2"
"3" is held in the x data holding unit 11 (step S1). Then, by repeatedly executing the processes of steps S2 to S7, the condition inspection is performed on all the parking lot candidates y0 to y6 of the arriving vehicles x3, x4, and x5, respectively, and the respective parking lot candidates that meet the conditions are checked. Is calculated, and is stored in the evaluation value storage unit 16 as shown in FIG.
【００４４】この場合、大型車ｘ5 と駐車場所ｙ5 にお
ける評価値が６．５と最も高いため、まず、大型車ｘ5
に対して駐車場所ｙ5 が割当てられる（ステップＳ８，
Ｓ９）。In this case, since the evaluation value in the large vehicle x5 and the parking place y5 is 6.5, which is the highest, first, the large vehicle x5
Parking place y5 is assigned to (step S8,
S9).
【００４５】この後、到着車は小型車ｘ3 と中型車ｘ4
の２台存在するので、この２台ｘ3，ｘ4 について、上
記大型車ｘ5 に対する駐車場所ｙ5 の割当てにより不要
となる駐車場所候補が除外され、この除外された駐車場
候補に隣接して残る駐車場所候補のみに対する評価値の
再計算が行なわれる（ステップＳ１０〜Ｓ１２）。After this, the arriving vehicle is a small vehicle x3 and a medium vehicle x4.
Since there are two parking lots, the unnecessary parking lot candidates are excluded by allocating the parking lot y5 to the large vehicle x5, and the parking lots remaining adjacent to the excluded parking lot candidates for these two cars x3, x4. The evaluation value for only the candidates is recalculated (steps S10 to S12).
【００４６】すなわち、評価関数Ｆにより得られる評価
値は、割当て候補としての駐車領域と隣接する駐車領域
にのみ依存するので、上記大型車ｘ5 を駐車場所ｙ5 に
割当てたことにより評価値を再計算する必要のある駐車
場所は、この場合、ｙ4 に関する組合せだけであり、小
型車ｘ3 及び中型車ｘ4 についての再計算後の各駐車場
所候補に対する評価値は、図４（ｂ）で示すようにな
る。この場合、小型車ｘ3 と駐車場所ｙ4 における評価
値が６．４と最も高いため、小型車ｘ3 に対して駐車場
所ｙ4 が割当てられる（ステップＳ８，Ｓ９）。That is, since the evaluation value obtained by the evaluation function F depends only on the parking area as the allocation candidate and the adjacent parking area, the evaluation value is recalculated by allocating the large vehicle x5 to the parking place y5. In this case, the parking place that needs to be set is only the combination relating to y4, and the evaluation values for the respective parking place candidates after the recalculation for the small vehicle x3 and the medium vehicle x4 are as shown in FIG. 4 (b). In this case, since the evaluation value in the small car x3 and the parking place y4 is the highest at 6.4, the parking place y4 is assigned to the small car x3 (steps S8 and S9).
【００４７】この後、到着車は中型車ｘ4 が存在するの
で、上記同様にして小型車ｘ3 に対する駐車場所ｙ4 の
割当てにより不要となる駐車場所候補が除外され、この
除外された駐車場候補に隣接して残る駐車場所候補のみ
に対する評価値の再計算が行なわれる（ステップＳ１０
〜Ｓ１２）。After that, since the medium-sized car x4 exists in the arriving vehicle, the unnecessary parking place candidate is excluded by allocating the parking place y4 to the small car x3 in the same manner as described above, and the unnecessary parking place candidate is adjacent to the candidate. The evaluation value is recalculated only for the remaining parking place candidates (step S10).
~ S12).
【００４８】そして、中型車ｘ4 についての再計算後の
各駐車場所候補に対する評価値は、図４（ｃ）で示すよ
うになり、中型車ｘ4 に対しては駐車場所ｙ2 が割当て
られる（ステップＳ８，Ｓ９）。The evaluation value for each parking place candidate after recalculation for the medium-sized car x4 is as shown in FIG. 4C, and the parking place y2 is allocated to the medium-sized car x4 (step S8). , S9).
【００４９】したがって、同時に到着した複数の車を対
象とする場合でも、そのそれぞれに対して適切な駐車場
所を割当てることができ、また、１つの駐車場所割当て
毎に残る駐車場所候補の割当て評価値を計算し直すに
も、全ての駐車場所候補に対する評価値を計算し直す必
要はなく、割当てられた駐車場所と隣接する駐車場所候
補にのみ評価値再計算を行なうだけなので、計算時間を
節約して高速な割当て処理が実現できる。Therefore, even when a plurality of vehicles arriving at the same time are targeted, an appropriate parking place can be assigned to each of them, and the assigned evaluation value of the remaining parking place candidates for each one parking place assignment. To recalculate, it is not necessary to recalculate the evaluation value for all the parking place candidates, only the evaluation value recalculation is performed only for the assigned parking place and adjacent parking place candidates, which saves calculation time. And high-speed allocation processing can be realized.
【００５０】したがって、上記構成の割当て決定支援方
式を適用した情報処理システムによれば、時系列的に到
着する車ｘi(i=0,…,n) を物理的な基準により番号付け
られた駐車領域ｙj(j=0,…,m) に割当てるに際し、到着
車ｘi と駐車場所候補ｙj との関係を、該ｘi とｙj 及
びｙj に隣接するｙj-1 とｙj+1 のみの情報から成る評
価関数Ｆ（ｘi ，ｙj-1 ，ｙj ，ｙj+1 ）に基づき評価
することにより、予め各駐車場所ｙj を中型車に対応し
て区画した場合でも、あらゆる大きさの到着車ｘi に対
して適切な駐車場所ｙj を割当てることができ、空間的
無駄を省くことができると共に、１台の車に対する駐車
場所割当て後の次の車に対する駐車場所の再評価時間が
少くて済み、高速な割当て処理が行なえるようになる。Therefore, according to the information processing system to which the allocation decision support system having the above-mentioned configuration is applied, the vehicles xi (i = 0, ..., N) arriving in time series are numbered by a physical standard. When allocating to the area yj (j = 0, ..., m), the evaluation of the relationship between the arriving vehicle xi and the parking location candidate yj is composed of only the information of yj-1 and yj + 1 adjacent to the xi and yj. By evaluating based on the function F (xi, yj-1, yj, yj + 1), even if each parking place yj is divided in advance corresponding to a medium-sized car, it is appropriate for an arrival car xi of any size. It is possible to allocate different parking places yj, to save space waste, and to reduce the re-evaluation time of the parking place for the next car after the parking place is allocated for one car, which enables high-speed allocation processing. You will be able to do it.
【００５１】なお、上記実施例における評価関数Ｆの項
目は、適合度と便利度とを含んで設定したが、例えば評
価値要素として駐車予定時間を考慮する項目を加え、長
く駐車する車を入口から離れた駐車場所に割当てたり、
初心者かどうかの項目を加え、初心者ならば空間的に余
裕のある駐車場所に割当てるようにしてもよい。また、
駐車場所ｙj の区画を一定の広さに分割したが、予め異
なる広さに分割し、該ｙj の広さも考慮して割当てを行
なってもよい。さらに、駐車場に限らず、倉庫内の荷物
の置き場を決定する場合に応用してもよい。Although the item of the evaluation function F in the above embodiment is set to include the degree of conformity and the degree of convenience, for example, an item that considers the planned parking time is added as an evaluation value element, and a car that is to be parked for a long time is entered. Assigned to a parking place away from
It may be possible to add an item as to whether or not the user is a beginner, and if the user is a beginner, allocate it to a parking place that has enough space. Also,
Although the compartment of the parking place yj is divided into fixed areas, it may be divided into different areas in advance and the allocation may be performed in consideration of the area of the yj. Further, the present invention may be applied not only to the parking lot but also to the case where the storage place of the luggage in the warehouse is determined.
【００５２】また、上記実施例では、到着車ｘi がラン
ダムに発生する駐車場について述べたが、予めスケジュ
ールの定まっている荷物輸送トラックや定期バスの駐車
を考え、評価関数Ｆの評価値要素として、到着予定時刻
に関する項目を加えてもよい。In the above embodiment, the parking lot in which the arrival vehicles xi are randomly generated has been described. Considering the parking of the luggage transport truck or the regular bus whose schedule is fixed in advance, as an evaluation value element of the evaluation function F, You may add an item about the estimated arrival time.
【００５３】また、上記実施例における駐車場は、１次
元に並んだ領域について述べたが、２次元平面に格子状
に並んだ領域や正６角形で区切られた領域に対し、隣接
する領域に対する評価関数を作成してもよい。Further, although the parking lots in the above embodiments have been described with respect to the one-dimensionally arranged areas, the areas arranged in a grid on the two-dimensional plane or the areas separated by regular hexagons are compared with the adjacent areas. You may create an evaluation function.
【００５４】[0054]
【発明の効果】以上のように本発明によれば、時系列的
に発生する物Ｘi(i=0,…,n) を物理的な基準により番号
付けられた領域ｙj(j=0,…,m) に割当てるに際し、上記
ｘi とｙj との関係を評価するにあたり、ｘi とｙj 及
び該ｙj に隣接するｙj-1 及びｙj+1 のみの情報からな
る評価関数 Ｆ（ｘi ，ｙj-1 ，ｙj ，ｙj+1 ）As described above, according to the present invention, the regions yj (j = 0, ...) In which the objects Xi (i = 0, ..., n) that are generated in time series are numbered by a physical reference. , m) in evaluating the relationship between xi and yj, an evaluation function F (xi, yj-1, which is composed of only xi and yj and yj-1 and yj + 1 adjacent to yj, yj, yj + 1)
【００５５】を作成し、この評価値計算を各ｙj に対し
て繰返し行ない、最も評価値の良いｘi とｙj の組合せ
から割当てを決定するので、予め領域の分割を決定する
必要なく、空間的な無駄の発生を防止し、しかも、長時
間の評価値計算を要することなく、ｙj 周辺の領域も考
慮した効率的な割当てが可能になる。Is generated and this evaluation value calculation is repeated for each yj, and the allocation is determined from the combination of xi and yj with the best evaluation value. It is possible to prevent waste and efficiently allocate the area around yj without considering the evaluation value calculation for a long time.
【図１】本発明の一実施例に係わる割当て決定支援方式
を適用した情報処理システムの構成を示すブロック図。FIG. 1 is a block diagram showing the configuration of an information processing system to which an allocation decision support system according to an embodiment of the present invention is applied.
【図２】上記情報処理システムが割当て決定支援システ
ムとして運用される駐車場を示す図。FIG. 2 is a diagram showing a parking lot in which the information processing system is operated as an allocation decision support system.
【図３】上記情報処理システムにおける割当て決定支援
処理を示すフローチャート。FIG. 3 is a flowchart showing allocation determination support processing in the information processing system.
【図４】上記情報処理システムにおける割当て決定支援
処理に伴う評価値算出状況を示す図。FIG. 4 is a diagram showing a situation of evaluation value calculation accompanying the allocation decision support processing in the information processing system.
【図５】車を駐車場に割当てる際の割当て状況を示す
図。FIG. 5 is a diagram showing an allocation situation when a car is allocated to a parking lot.
１１…ｘデータ保持部、１２…ｙデータ記憶部、１３…
候補作成部、１４…条件検査部、１５…評価値計算部、
１６…評価値記憶部、１７…候補決定部、１８…割当
部。11 ... x data storage unit, 12 ... y data storage unit, 13 ...
Candidate creation unit, 14 ... Condition inspection unit, 15 ... Evaluation value calculation unit,
16 ... Evaluation value storage unit, 17 ... Candidate determination unit, 18 ... Allocation unit.
Claims (1)
物理的な基準により番号付けられた領域ｙj(j=0,…,m)
に割当てる割当て決定支援方式において、上記ｘi とｙ
j との関係をｘi 、ｙj 及び該ｙj に隣接するｙj-1 、
ｙj+1 のみからなる評価関数 Ｆ（ｘi ，ｙj-1 ，ｙj ，ｙj+1 ） で評価し、最も評価値の高いｘi とｙj の組合せに応じ
て領域ｙj を割当てることを特徴とする割当て決定支援
方式。1. An area yj (j = 0, ..., m) in which objects Xi (i = 0, ..., n) that are generated in a time series are numbered according to physical criteria.
In the allocation decision support method for allocating to
The relation with j is xi, yj and yj-1 adjacent to the yj,
Allocation decision characterized by evaluating with an evaluation function F (xi, yj-1, yj, yj + 1) consisting only of yj + 1 and allocating the region yj according to the combination of xi and yj with the highest evaluation value. Support method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP15801092A JPH064516A (en) | 1992-06-17 | 1992-06-17 | Assignment decision support system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP15801092A JPH064516A (en) | 1992-06-17 | 1992-06-17 | Assignment decision support system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| JPH064516A true JPH064516A (en) | 1994-01-14 |
Family
ID=15662294
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP15801092A Pending JPH064516A (en) | 1992-06-17 | 1992-06-17 | Assignment decision support system |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPH064516A (en) |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009193543A (en) * | 2008-02-18 | 2009-08-27 | Japan Research Institute Ltd | Parking lot management system |
| WO2013047342A1 (en) | 2011-09-26 | 2013-04-04 | 富士フイルム株式会社 | Electrolyte solution for nonaqueous secondary batteries, and secondary battery |
| WO2017099247A1 (en) | 2015-12-11 | 2017-06-15 | 富士フイルム株式会社 | Solid-state electrolyte composition, sheet for all-solid-state secondary battery, electrode sheet for all-solid-state second battery and manufacturing method therefor, and all-solid-state secondary battery and manufacturing method therefor |
| WO2019151373A1 (en) | 2018-02-05 | 2019-08-08 | 富士フイルム株式会社 | Solid electrolyte composition and method for producing same, solid electrolyte-containing sheet, and methods for manufacturing all-solid secondary battery electrode sheet and all-solid secondary battery |
| WO2019203183A1 (en) | 2018-04-20 | 2019-10-24 | 富士フイルム株式会社 | Solid electrolyte composition, sheet for all-solid-state secondary cell, electrode sheet for all-solid-state secondary cell, all-solid-state secondary cell, and method for manufacturing all-solid-state secondary cell and sheet for all-solid-state secondary cell |
| WO2020067003A1 (en) | 2018-09-28 | 2020-04-02 | 富士フイルム株式会社 | Composition for electrodes, electrode sheet for all-solid-state secondary batteries, all-solid-state secondary battery, and method for producing electrode sheet for all-solid-state secondary batteries or all-solid-state secondary battery |
| WO2020067107A1 (en) | 2018-09-27 | 2020-04-02 | 富士フイルム株式会社 | Method for manufacturing all-solid-state secondary battery, electrode sheet for all-solid-state secondary battery, and method for manufacturing same |
| WO2020075749A1 (en) | 2018-10-11 | 2020-04-16 | 富士フイルム株式会社 | Solid electrolyte composition, sheet for solid-state secondary battery, electrode sheet for solid-state secondary battery, and solid-state secondary battery |
| WO2020080262A1 (en) | 2018-10-15 | 2020-04-23 | 富士フイルム株式会社 | Electrode composition, electrode sheet for all-solid-state secondary battery, and all-solid-state secondary battery, as well as methods for manufacturing electrode composition, electrode sheet for all-solid-state secondary battery, and all-solid-state secondary battery |
| WO2020080261A1 (en) | 2018-10-15 | 2020-04-23 | 富士フイルム株式会社 | Electrode composition, electrode sheet for all-solid-state secondary battery, and all-solid-state secondary battery, as well as methods for manufacturing electrode composition, electrode sheet for all-solid-state secondary battery, and all-solid-state secondary battery |
| WO2021014852A1 (en) | 2019-07-19 | 2021-01-28 | 富士フイルム株式会社 | Inorganic solid electrolyte-containing composition, sheet for all-solid-state secondary batteries, electrode sheet for all-solid-state secondary batteries, all-solid-state secondary battery, method for producing sheet for all-solid-state secondary batteries and method for producing all-solid-state secondary battery |
| WO2021039468A1 (en) | 2019-08-30 | 2021-03-04 | 富士フイルム株式会社 | Composition containing inorganic solid electrolyte, sheet for all-solid secondary batteries, all-solid secondary battery, method for manufacturing sheet for all-solid secondary batteries, and method for manufacturing all-solid secondary battery |
| WO2021039949A1 (en) | 2019-08-30 | 2021-03-04 | 富士フイルム株式会社 | Inorganic solid electrolyte-containing composition, sheet for all-solid-state secondary battery, all-solid-state secondary battery, and methods for manufacturing sheet for all-solid-state secondary battery and all-solid-state secondary battery |
| WO2021039950A1 (en) | 2019-08-30 | 2021-03-04 | 富士フイルム株式会社 | Inorganic solid electrolyte-containing composition, sheet for solid-state secondary batteries, solid-state secondary battery, and methods for producing solid-state secondary battery and sheet for solid-state secondary batteries |
| WO2021193751A1 (en) | 2020-03-26 | 2021-09-30 | 富士フイルム株式会社 | Electrode composition, electrode sheet for all-solid-state secondary battery and all-solid-state secondary battery, and methods for manufacturing electrode sheet for all-solid-state secondary battery and all-solid-state secondary battery |
| WO2021193826A1 (en) | 2020-03-27 | 2021-09-30 | 富士フイルム株式会社 | Inorganic-solid-electrolyte-containing composition, all-solid-state secondary battery sheet, all-solid-state secondary battery, and method for manufacturing all-solid-state secondary battery sheet and all solid-state secondary battery |
| WO2022118870A2 (en) | 2020-12-02 | 2022-06-09 | 富士フイルム株式会社 | Lithium-based solid electrolyte, inorganic solid electrolyte, lithium-based solid electrolyte production method, modified positive electrode active material, modified negative electrode active material, all-solid-state secondary battery, electrode sheet for all-solid-state secondary battery, solid electrolyte sheet, electrode for all-solid-state secondary battery |
| WO2022118868A1 (en) | 2020-12-02 | 2022-06-09 | 富士フイルム株式会社 | Oxide solid electrolyte, binder, solid electrolyte layer, active material, electrode, and all-solid-state secondary battery |
| WO2023068237A1 (en) | 2021-10-18 | 2023-04-27 | 富士フイルム株式会社 | Inorganic solid electrolyte–containing composition, sheet for all-solid secondary battery, all-solid secondary battery, and method for manufacturing sheet for all-solid secondary battery and all-solid secondary battery |
-
1992
- 1992-06-17 JP JP15801092A patent/JPH064516A/en active Pending
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009193543A (en) * | 2008-02-18 | 2009-08-27 | Japan Research Institute Ltd | Parking lot management system |
| WO2013047342A1 (en) | 2011-09-26 | 2013-04-04 | 富士フイルム株式会社 | Electrolyte solution for nonaqueous secondary batteries, and secondary battery |
| WO2017099247A1 (en) | 2015-12-11 | 2017-06-15 | 富士フイルム株式会社 | Solid-state electrolyte composition, sheet for all-solid-state secondary battery, electrode sheet for all-solid-state second battery and manufacturing method therefor, and all-solid-state secondary battery and manufacturing method therefor |
| WO2019151373A1 (en) | 2018-02-05 | 2019-08-08 | 富士フイルム株式会社 | Solid electrolyte composition and method for producing same, solid electrolyte-containing sheet, and methods for manufacturing all-solid secondary battery electrode sheet and all-solid secondary battery |
| WO2019203183A1 (en) | 2018-04-20 | 2019-10-24 | 富士フイルム株式会社 | Solid electrolyte composition, sheet for all-solid-state secondary cell, electrode sheet for all-solid-state secondary cell, all-solid-state secondary cell, and method for manufacturing all-solid-state secondary cell and sheet for all-solid-state secondary cell |
| WO2020067107A1 (en) | 2018-09-27 | 2020-04-02 | 富士フイルム株式会社 | Method for manufacturing all-solid-state secondary battery, electrode sheet for all-solid-state secondary battery, and method for manufacturing same |
| WO2020067003A1 (en) | 2018-09-28 | 2020-04-02 | 富士フイルム株式会社 | Composition for electrodes, electrode sheet for all-solid-state secondary batteries, all-solid-state secondary battery, and method for producing electrode sheet for all-solid-state secondary batteries or all-solid-state secondary battery |
| WO2020075749A1 (en) | 2018-10-11 | 2020-04-16 | 富士フイルム株式会社 | Solid electrolyte composition, sheet for solid-state secondary battery, electrode sheet for solid-state secondary battery, and solid-state secondary battery |
| WO2020080262A1 (en) | 2018-10-15 | 2020-04-23 | 富士フイルム株式会社 | Electrode composition, electrode sheet for all-solid-state secondary battery, and all-solid-state secondary battery, as well as methods for manufacturing electrode composition, electrode sheet for all-solid-state secondary battery, and all-solid-state secondary battery |
| WO2020080261A1 (en) | 2018-10-15 | 2020-04-23 | 富士フイルム株式会社 | Electrode composition, electrode sheet for all-solid-state secondary battery, and all-solid-state secondary battery, as well as methods for manufacturing electrode composition, electrode sheet for all-solid-state secondary battery, and all-solid-state secondary battery |
| WO2021014852A1 (en) | 2019-07-19 | 2021-01-28 | 富士フイルム株式会社 | Inorganic solid electrolyte-containing composition, sheet for all-solid-state secondary batteries, electrode sheet for all-solid-state secondary batteries, all-solid-state secondary battery, method for producing sheet for all-solid-state secondary batteries and method for producing all-solid-state secondary battery |
| WO2021039468A1 (en) | 2019-08-30 | 2021-03-04 | 富士フイルム株式会社 | Composition containing inorganic solid electrolyte, sheet for all-solid secondary batteries, all-solid secondary battery, method for manufacturing sheet for all-solid secondary batteries, and method for manufacturing all-solid secondary battery |
| WO2021039949A1 (en) | 2019-08-30 | 2021-03-04 | 富士フイルム株式会社 | Inorganic solid electrolyte-containing composition, sheet for all-solid-state secondary battery, all-solid-state secondary battery, and methods for manufacturing sheet for all-solid-state secondary battery and all-solid-state secondary battery |
| WO2021039950A1 (en) | 2019-08-30 | 2021-03-04 | 富士フイルム株式会社 | Inorganic solid electrolyte-containing composition, sheet for solid-state secondary batteries, solid-state secondary battery, and methods for producing solid-state secondary battery and sheet for solid-state secondary batteries |
| WO2021193751A1 (en) | 2020-03-26 | 2021-09-30 | 富士フイルム株式会社 | Electrode composition, electrode sheet for all-solid-state secondary battery and all-solid-state secondary battery, and methods for manufacturing electrode sheet for all-solid-state secondary battery and all-solid-state secondary battery |
| WO2021193826A1 (en) | 2020-03-27 | 2021-09-30 | 富士フイルム株式会社 | Inorganic-solid-electrolyte-containing composition, all-solid-state secondary battery sheet, all-solid-state secondary battery, and method for manufacturing all-solid-state secondary battery sheet and all solid-state secondary battery |
| WO2022118870A2 (en) | 2020-12-02 | 2022-06-09 | 富士フイルム株式会社 | Lithium-based solid electrolyte, inorganic solid electrolyte, lithium-based solid electrolyte production method, modified positive electrode active material, modified negative electrode active material, all-solid-state secondary battery, electrode sheet for all-solid-state secondary battery, solid electrolyte sheet, electrode for all-solid-state secondary battery |
| WO2022118868A1 (en) | 2020-12-02 | 2022-06-09 | 富士フイルム株式会社 | Oxide solid electrolyte, binder, solid electrolyte layer, active material, electrode, and all-solid-state secondary battery |
| WO2023068237A1 (en) | 2021-10-18 | 2023-04-27 | 富士フイルム株式会社 | Inorganic solid electrolyte–containing composition, sheet for all-solid secondary battery, all-solid secondary battery, and method for manufacturing sheet for all-solid secondary battery and all-solid secondary battery |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JPH064516A (en) | Assignment decision support system | |
| Church et al. | Integrating Normative Location Models into GIS: Problems and Prospects with the p-median Model (94-5) | |
| Gromicho et al. | Restricted dynamic programming: a flexible framework for solving realistic VRPs | |
| Koo et al. | Fleet sizing and vehicle routing for container transportation in a static environment | |
| Guo et al. | Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information | |
| Mokhtarinejad et al. | A novel learning based approach for a new integrated location-routing and scheduling problem within cross-docking considering direct shipment | |
| Landrieu et al. | A tabu search heuristic for the single vehicle pickup and delivery problem with time windows | |
| Lee et al. | Vehicle capacity planning system: A case study on vehicle routing problem with time windows | |
| KR20160070699A (en) | Method of designing vehicle delivery routes by setting zones | |
| JP2007191296A (en) | Main physical distribution network schedule preparation system | |
| Roghanian et al. | The combination of TOPSIS method and Dijkstra’s algorithm in multi-attribute routing | |
| JP7121154B2 (en) | Delivery plan creation method, device, system, and computer-readable storage medium | |
| JP2005043974A (en) | Method and system for forming transport schedule | |
| Ceder et al. | Scheduling considerations in designing transit routes at the network level | |
| KR100506926B1 (en) | working-system for one path and control method thereof | |
| KR20200078318A (en) | Situation-adapted Global Pooling System and Method for Transfer Vehicles in Automated Container Terminal | |
| US8489228B2 (en) | Path planning in a warehouse | |
| CN111208815A (en) | Method for distributing a plurality of handling tasks to a plurality of automated guided vehicles and related device | |
| Albareda Sambola | Models and algorithms for location-routing and related problems | |
| JP3567277B2 (en) | Operation planning method and operation planning system for self-propelled cargo transportation means | |
| JP2009073623A (en) | Device, method and program for assigning operation | |
| Evans et al. | A modular algorithm for pre-simulation design of Automatic Guided Vehicle systems | |
| Nguyen et al. | An adaptive large neighborhood search for multi-trip multi-traffic pickup and delivery problem with time windows and synchronization | |
| JP2005145573A (en) | Transportation program planning method | |
| KR20120003627A (en) | Ship block management system and ship block carrying out route decision method thereof |