国際貿易取引における事務処理効率化支援システムの構築
メタデータ

言語: English
出版者:
公開日: 2020-12-15
キーワード (Ja):
キーワード (En):作成者: タナパン, スリチャンタミット
メールアドレス:所属:

URL

https://doi.org/10.15118/00010338

氏

名

学位論文題目TANAPUN SRICHANTHAMIT （ﾀﾅﾊﾟﾝ ｽﾘﾁｬﾝﾀﾐｯﾄ）

A Supporting System for Improving

Efficiency ofPaperworks in International Trade Transaction
Processes(国際貿易取引における事務処理効率化支援システムの構築)

論文審査委員

主査 教 授須 藤 秀 紹准教授

渡 邉 真 也准教授

岡 田 吉 史

国際貿易取引における事務処理効率化支援システムの構築
17096508 Tanapun SRICHANTHAMIT

本稿は，国際貿易取引における事務処理の効率化を支援するシステムを提案し，実験結果を示してによってその効果を明らかにするものである．国際貿易取引は，サプライチェーンのグローバル化により，その重要性を増している．一般的に国際貿易取引のための事務処理は複雑かつ冗長性が高いと考えられている．その理由は，各国が独自に設計した海外との貿易の仕組みの組み合わせとして全体のシステムが構成されていることが考えられる．
あらためてシステム全体を再設計することで効率化が期待できるが，すでに複雑に絡み合っている事務処理を最適な形に近づけることは容易ではない．また，一概に事務処理の効率化といっても，書類の数，1 種類の書類に含まれる情報の数，1 種類の書類の経路とさまざまな視点があり，それぞれの基準から最適な状態が異なるという難しさがある．そこで本研究では，国際貿易取引における事務処理による情報の流れをネットワーク構造で記述し，効率化アルゴリズムでサイズを縮小することによって，同じ情報伝達機能をもったより小さなネットワークを生成することで，事務処理の効率化を行う．具体的な手順を下に示す．

1. 国際貿易取引における事務処理をネットワーク構造で記述する．このとき，ノードを事務手続きに関わる組織，エッジを文書の流れとする．

2. 記述した文章の流れを表すネットワークを，情報の流れを表すネットワークに変換する．
3. 情報の流れを表すネットワークから冗長なエッジを削除する．
4. 冗長なエッジを削除した情報の流れを表すネットワークを文書の流れを表すネットワークに変換する．
図 1 に示す例を用いて，この手順の概要を説明する．図 1 (A) に示すネットワークはある国際貿易取引における文書の流れの一部を表している．このネットワークを G = (V, E) とすると，G は次のように記述できる．G = (V, E),

V = {v1 , v2 , v3 , v4 , v5 }, E = {(v1 , v2 ), (v1 , v3 ), (v2 , v3 ), (v3 , v4 ), (v2 , v5 ), (v5 , v4 )}.
また，文書 p の流れを Rdp と表すとき，G 中の文書の流れは次のように記述できる．

Rda = {(v1 , v2 ), (v1 , v3 ), (v2 , v5 ), (v5 , v4 )}, Rdb = {(v1 , v2 ), (v2 , v3 ), (v2 , v5 )}, Rdc = {(v1 , v2 ), (v1 , v3 ), (v2 , v3 ), (v2 ,v5 ), (v3 , v4 )}. このとき，式 (1) を用いて，文章の流れを情報の流れに変換することができる．
Rim = {∪
Dp ∈DX

Rdp | Dp ∩ {im } ̸= ϕ}(1)

図 1 (b) にその結果を示す （Ri1 = {(v1 , v2 ), (v1 , v3 ), (v2 , v3 ), (v2 , v5 ), (v3 , v4 ), (v5 , v4 )}, Ri2 = {(v1 , v2 ), (v1 , v3 ),(v2 , v3 ), (v2 , v5 ), (v5 , v4 )}, Ri3 = {(v1 , v2 ), (v1 , v3 ), (v2 , v3 ), (v2 , v5 ), (v3 , v4 ), (v5 , v4 )}).
(B) Information flows(A) Document flows
D =Db = c{i , i }v1
Dc =Da ={i1, i3}{i1,i2,i3}

Da = {i , i }1 2{i1,i2,i3}

13v2{i1, i2}

1

D =Db = c{i , i }Da = {i , i }1 2{i1,i2,i3}

D =Db = c{i , i }v1

13

i1 iv53

Da =v3Dc ={i1, i3}

Documentv4
Organization{i1,i2,i3}

Document flow2i3

i1 i2i3

i1 i2(C) Reduced information flowsv2i1v1i2i3v5i3i1 i2v3i1i3v4i3i1 i2i1 i2i3v2(D) Reduced document flowsi1v1i2i3v5i3i1 i2v3v4

Information flow

図 1: An example of information flow=
D<a’>{i1,i2,i3}

v2

=
D<a’>
{i1,i2,i3}

=
D<a’>

v5

{i1,i2,i3}

=
D<a’>

i3v3

v4

{i1,i2,i3}

表 1: The numbers of information transmission of current process and the reduced process in the example
Original process of example

Reduced process of example

Document

Number of
informations

Times of documenttransmission

Total number oftransmission

Da3412Db2

Dc2
Total number of information
Transmission of all documents

365

10Document

Number of
informations

Times of documenttransmission

Total number oftransmission

D′a

3

412

Total number of information
Transmission of all documents

1228

次に下の手順に従って，冗長なエッジを削除する．

1. 最大の入次数（in degree）をもつノードを探す．
2. そのノード入っているエッジで直接繋がっているノードを探す．
3. それらの中から最も大きな出次数（out degree）を持っているノードを探す．
4. 2 で見つかったノードと 3 で見つかったノードの間のエッジを削除する．
5. 全てのノードの入次数が 1 になるまで，2 から 6 を手順を繰り返す．
この手順によって，図 1 (b) に示すネットワークは次のように縮小される．Ri1 = {(v1 , v2 ), (v1 , v3 ), (v2 , v5 ), (v5 , v4 )},Ri2 = {(v1 , v2 ), (v1 , v3 ), (v2 , v5 ), (v5 , v4 )} Ri3 = {(v1 , v2 ), (v1 , v3 ), (v2 , v5 ), (v5 , v4 )}. 図 1 (C) はこの情報の流れを図示したものである．
次に，この縮小された情報の流れを，下に示す手順によって書類の流れに変換する．

1. 情報が 1 つだけ含まれた書類群を作成する．つまり，情報の数だけ書類が作成される．それらの書類の流れは，それに含まれる情報の流れと同じであるようにする．

2. 経路の重複があり，統合可能な書類のペアを 1 つ探す.
3. ペアが見つかった場合は，これらを統合して 1 つの書類にする．ペアが見つからない場合は終了する．
4. 手順 2-3 を繰り返す．
この手順によって，図 1 (D) に示す書類の流れが得られる．表 1 は，元のプロセスと縮小化後のプロセスとに含まれる書類の数と，書類の受け渡し回数を表したものである．この表から分かるように，提案手法によって，文章の数は 3 から 1 へ（66.6%），書類受け渡し回数は 28 から 12 へ（57.2%），それぞれ減少した．
事務手続きの効率性については，（1）不要な情報の受け渡し，（2) 必要な書類の種類の数など，さまざまな視点からこれを考えることができる．そして，これらは一種のトレードオフの関係にあり，たとえば必要な書類の種類を減らせば，1 種類の書類に含まれる情報が増えてしまうことから，不要な情報の受け渡しの可能性が高まることになる．よって，冗長性の削減について考える場合には，状況に応じた対策が必要になる．提案手法は，複数の解候補を，複数の観点からの評価値とともに提示することが可能であり，さまざまな状況に適応することが可能である．
論文では，ASEAN 諸国間の国際貿易事務処理を例に，提案システムの有効性について議論した．その結果，提案手法は，比較的大規模な問題に対しても問題無く適応できることが分かった．提案システムは，複数の組織間での事務手続きの時間的な同期や，情報へのアクセス権限については考慮していない．実際の問題に適応するため，これらの問題の解決が今後の課題になる．

A Supporting System for Improving Eﬃciency of Paperworks inInternational Trade Transaction Processes
17096508 Tanapun SRICHANTHAMITIn this paper, a supporting system for improving eﬃciency of paperworks in international trade transaction
processes is proposed. Then, the performance of the proposed system is investigated by conducting experiments.
International trade transaction process between diﬀerent countries has an important role in economic developments and movement of goods, service, and technology.
Usually, each country designs its own transaction processes without considering other countries’ circumstances.
That is to say, international trade transaction processes can be considered as systems consisting of sub-systems
designed by each country based on their own concepts and policies. This fact makes international trade transaction
systems complex. Of course, if we can reconstruct the whole-system, we can reduce the redundancies and make it
more eﬃcient. However, it is not easy to reconstruct the complex integrated system with keeping the consistency.
To solve the problem, a system for reducing redundancies of paperworks in international trade transaction
processes is developed. The basic idea is shown below:
1. Describe the target international trade transaction processes as a network structure. Here, each node stands
for an organization, and each edge stands for a flow of document.
2. Convert the network structure to another network structure which stands for information.
3. Reduce the information flows by eliminating redundant edges.
4. Convert the information flow to document flows.
For example, a network in Fig. 1 (A) shows an example of document flow in a part of an international transaction
process.
The network structure of the example is described as G = (V, E). Here, V stands for a set of nodes which
represent organizations in a process and E stands for a set of edges which represent a path of document flows in aprocess.
Organizations of the example can be described as V = {v1 , v2 , v3 , v4 , v5 }. A path of document flows in aprocess can be described as E = {(v1 , v2 ), (v1 , v3 ), (v2 , v3 ), (v3 , v4 ), (v2 , v5 ), (v5 , v4 )}. The routes of the documents can be described as Rda = {(v1 , v2 ), (v1 , v3 ), (v2 , v5 ), (v5 , v4 )}, Rdb = {(v1 , v2 ), (v2 , v3 ), (v2 , v5 )}, Rdc ={(v1 , v2 ), (v1 , v3 ), (v2 , v3 ), (v2 , v5 ), (v3 , v4 )}.
(B) Information flows(A) Document flows
D =Db = c{i , i }v1
Dc =Da ={i1, i3}{i1,i2,i3}

Da = {i , i }1 2{i1,i2,i3}

13v2

D =
Db = c{i , i }Da = {i , i }1 2{i1,i2,i3}

Dc =

113

i1 iv5Db ={i , i }{i1, i2}v13

Da =v3Dc ={i1, i3}

Documentv4
Organization{i1,i2,i3}

Document flow2i3

i1 i2i3

i1 i2(C) Reduced information flowsv2i1v1i2i3v5i3i1 i2v3

i1i3v4i3

i1 i2

i1 i2i3v2(D) Reduced document flowsi1v1

i2i3v5i3
i1 i2v3v4

Information flow

Figure 1: An example of information flow=
D<a’>{i1,i2,i3}

v2

=
D<a’>
{i1,i2,i3}

=
D<a’>

v5

{i1,i2,i3}

=
D<a’>

i3v3

v4

{i1,i2,i3}

Table 1: The numbers of information transmission of current process and the reduced process in the example
Original process of example

Reduced process of example

Document

Number ofinformations

Times of documenttransmission

Total number oftransmission

Document

Number ofinformations

Times of documenttransmission

Total number oftransmission

Da3412D′a3412Db2Dc
2
Total number of information
Transmission of all documents

36510

Total number of information
Transmission of all documents

1228

These routes of documents can be converted to routes of informations by using the below formula.
∪Rim = {Rdp | Dp ∩ {im } ̸= ϕ}
Dp ∈DX(1)

where, Dp stands for a document p, DX stands for a set of documents used in process X, Rdp stands for a route of
document p, im stands for an information m, and Rim stand for a route of information m.
Figure 1 (b) shows the results; Ri1 = {(v1 , v2 ), (v1 , v3 ), (v2 , v3 ), (v2 , v5 ), (v3 , v4 ), (v5 , v4 )}, Ri2 = {(v1 , v2 ), (v1 , v3 ),(v2 , v3 ), (v2 , v5 ), (v5 , v4 )}, Ri3 = {(v1 , v2 ), (v1 , v3 ), (v2 , v3 ), (v2 , v5 ), (v3 , v4 ), (v5 , v4 )}.
Next, the information flows are reduced as following way:
1. Find a node which has the maximum number of in-degree.
2. Find all sender nodes that link to the node found in step 1.
3. Find the maximum number of out-degree of sender nodes.
4. An edge that connects to the sender node and the receiver node is eliminated.
5. From 2 to 6 are repeated until all nodes have the number of in-degree less than one.
By following the procedure, the network shown in Fig. 1 (b) is changed as: Ri1 = {(v1 , v2 ), (v1 , v3 ), (v2 , v5 ), (v5 , v4 )},Ri2 = {(v1 , v2 ), (v1 , v3 ), (v2 , v5 ), (v5 , v4 )} , Ri3 = {(v1 , v2 ), (v1 , v3 ), (v2 , v5 ), (v5 , v4 )}. Figure 1 (C) shows the network
structure of the reduced information flows.
Then, document flows are generated from the reduced information flows with the following procedure:
1. Documents which include only one information are created. Eventually, the number of documents become
same as the number of informations in the process. Each document has the same route with information
which included in the document.
2. Find a pair of documents which can be merged together because they have a common part in the paths.
3. If a pair of documents, they are merged, otherwise finish.
4. Repeat 2 - 3.
As a result, a reduced document flow shown in Fig. 1 (D) is obtained. Table 1 shows number of documents andnumber of transmitting documents in the original process and reduced process. As we can see from the table, total
number of documents has reduced from three to one (66.6%), and the total number of transmitting documents has
reduced from twenty-eight to twelve (57.2%).
Here, many kinds of redundancies, e.g. (1) redundancy of sharing information and (2) redundancy of using
documents are considered, and these redundancies have a trade-oﬀ relationship. Thus, in the actual situation, we
have to decide which redundancy should be focused on. The proposed system can show some solution candidates
with the evaluation values which show several types of redundancies. Therefore, the proposed system can be appliedfor various situations.
Examples of international trade transaction processes in ASEAN countries are shown to discuss the abilities ofthe proposed system. As a result, it became clear that the proposed system can be applied for relatively huge-sizedproblems.

In the system, synchronizing multi-document transitions and permission control of information are not considered. In order to implement actual system based on the idea, these problems must be solved in the future.