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

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

URL

https://doi.org/10.15118/00010338

A Supporting System for Improving Efficiency
of Paperworks in International Trade
Transaction Processes

Tanapun Srichanthamit

A dissertation submitted in partial fulfillmentof the requirements for the degree ofDoctor of Philosophy of EngineeringofMuroran Institute of Technology

Course of Advanced Information and Electronic
Engineering, Division of Engineering
September 2020

Declaration
I hereby declare that this thesis is my own work and effort and that it has not been
submitted anywhere for any award. Wherever contributions of others are involved,
every effort is made to indicate this clearly, with due reference to the literature, andacknowledgement of collaborative research and discussions.
Muroran, September 2020

Tanapun SRICHATHAMIT

iii

Acknowledgements
I would never have been able to finish my thesis without the guidance of my advisor
and committee members, help from friends, and support from my family.
Firstly, I would like to express my sincere gratitude to my advisor Prof.Hidetsugu
SUTO and Prof.Shinya WATANABE for the continuous support of my Ph.D. study andrelated research, for their patience, motivation, immense knowledge and providing mewith an excellent atmosphere for doing research. I could not have imagined having abetter advisor and mentor for my Ph.D. study. Your advice on both research as well as
on my career have been invaluable.
Besides my advisor, I would like to thank the rest of my thesis committee i.e. Prof.Shinya
WATANABE and Prof.Yoshifumi OKADA for his insightful comments and encouragement, but also for the hard question which encouraged me to widen my thesis fromvarious perspectives.
I thank my fellow the members of System Design Laboratory for the stimulating discussions, for the helping me about this thesis, and for all the fun we have had in thelast three years. Also, I thank my friends in the following institute. Especially, I would
like to say thank you to Zijie ZHANG and Siree BURAPORNPONG for amazing help all
the time. I thank to Junya TANAKA and Satoshi YAMASHITA, they were always willingto help me. Also I thank to Dr. Woramol Chaowarat WATANABE and Dr. Klairung
PONANAN for academic suggestions. Moreover, I would like to say thank you for every
Thai student that was with me in Muroran. When I am tired or disappointed, they
always stand my side and encourage me to be strong again.
Last but not the least, I want to express my deepest appreciation to my beloved family
for supporting me spiritually throughout writing this thesis and my life in general.
Words cannot express how grateful I am to them. They were always encouraging mewith their best wishes, and always there cheering me up and stood by me through thegood and bad times.
Muroran, September 2020

Tanapun SRICHANTHAMITv

Abstract
In this study, a supporting system for improving efficiency of paperworks in international trade transaction processes is proposed. Then, the performance of the proposedsystem is investigated by conducting experiments.
International trade transaction process between different countries has an importantrole in economic developments and movement of goods, service, and technology.
Usually, each country designs its own transaction processes without considering othercountries’ circumstances. That is to say, international trade transaction processes canbe considered as systems consisting of sub-systems designed by each country basedon 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 efficient. However, it is not easy to reconstruct thecomplex 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 flowof 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 ofan international transaction process.
The network structure of the example is described as G = (V, E). Here, V stands for aset of nodes which represent organizations in a process and E stands for a set of edges
which represent a path of document flows in a process.
Organizations of the example can be described as V = {v1 , v2 , v3 , v4 , v5 }. A path ofvii

Abstract

D =Db = c{i , i }v1
Dc =Da ={i1, i3}{i1,i2,i3}

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

1

3

v2

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

i1 i

2

v5

Db =
{i , i }1

v1{i1,i2,i3}

Dc ={i1, i2}

3

Dc ={i1, i3}

Document

v3{i1,i2,i3}

v4
Organization

i3

i1 i

2

i3

i1 i

2

v2

i1

v1

i2
i3

v5

i3

i1 i

2

Da =

v3

(C) Reduced information flows(B) Information flows(A) Document flows

Document flow

i1
i3

v4

i3

i1 i

2

i1 i

2

i3

v2

(D) Reduced document flows

i1

v1

i2
i3

v5

i3
i1 i

2

v3

v4

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

v2

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

=
D<a’>

v5

{i1,i2,i3}

=
D<a’>

i3

v3

v4

{i1,i2,i3}

Information flow

Figure 1 – An example of information flow
document flows in a process 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 )}.
These routes of documents can be converted to routes of informations by using the
below formula.
S
Rim = {
Rdp | Dp ∩ {im } =6 φ}(1)
Dp ∈DX

where, Dp stands for a document p, DX stands for a set of documents used in a process
X, Rdp stands for a route of document p, im stands for an information m, and Rim stands
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 (4) are repeated until all nodes have the number of in-degree lessthan 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 thefollowing procedure:(1) Documents which include only one information are created. Eventually, thenumber of documents become same as the number of informations in the process. Each document has the same route with information which included in theviii

Abstract
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 of
informations

Times of documenttransmission

Total number oftransmission

Da

3

4

12

Db

2

Dc
2
Total number of information
Transmission of all documents

3

6

5

10

Document

Number of
informations

Times of documenttransmission

Total number oftransmission

D0a

3

4

12

Total number of information
Transmission of all documents

1228

document.
(2) Find a pair of documents which can be merged together because they have acommon part in the paths.
(3) If there are 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 2 shows
number of documents and number 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 tradeoff 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, theproposed system can be applied for various situations.
Examples of international trade transaction processes in ASEAN countries are shownto discuss the abilities of the proposed system. As a result, it became clear that the
proposed system can be applied for relatively huge-sized problems. 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.

ix

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

v1
Dc =
Da ={i1, i3}{i1,i2,i3}

v2{i1,i2,i3}

1

v1

Dc =
1

3

i1 i

2

v5

3

v3

{i1, i3}

Documentv4
Organization

2

i3

i3

i1 i

2

v2

i1

v1

i2
i3

v5

i3

i1 i

2

Da =
Dc =

i1 i

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

D =Db = c{i , i }{i1, i2}(C) Reduced information flows(B) Information flows(A) Document flowsv3{i1,i2,i3}

Document flow

i1
i3

v4

i3

i1 i

2

i1 i

2

i3

v2

(D) Reduced document flows

i1

v1

i2
i3

v5

i3
i1 i

2

v3

v4

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

v2

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

=
D<a’>

v5

{i1,i2,i3}

=
D<a’>

i3

v3

v4

{i1,i2,i3}

Information flow

Figure 2 – An example of information flowxi

Abstract
トワークはある国際貿易取引における文書の流れの一部を表している． このネ ッ
トワークを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 )}. このとき，式(2)を用いて，文章の流れを情報の流れに変換することができる．
S
Rim = {
Rdp | Dp ∩ {im } =6 φ}(2)
Dp ∈DX

Figure 2 (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 )}).
次に下の手順に従って，冗長なエッジを削除する．
(1) 最大の入次数（in degree）をもつノードを探す．
(2) そのノード入っているエッジで直接繋がっているノードを探す．
(3) それらの中から最も大きな出次数（out degree）を持っているノードを探す．
(4) (2)で見つかったノードと3で見つかったノードの間のエッジを削除する．
(5) 全てのノードの入次数が1になるまで，(2)から(4)を手順を繰り返す．
こ の 手 順 に よ っ て ，Fig. 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 )}. Figure 2 (C) はこの情報の流れを図示したものである．
次に，この縮小された情報の流れを，下に示す手順によって書類の流れに変換する．
(1) 情報が1つだけ含まれた書類群を作成する．つまり，情報の数だけ書類が作成される．それらの書類の流れは，それに含まれる情報の流れと同じであるようにする．
(2) 経路の重複があり，統合可能な書類のペアを1つ探す.
(3) ペアが見つかった場合は，これらを統合して1つの書類にする．ペアが見つからない場合は終了する．
(4) 手順(2)-(3)を繰り返す．
この手順によって，Fig. 2 (D) に示す書類の流れが得られる． Table 2は，元のプロ
セスと縮小化後のプロセスとに含まれる書類の数と，書類の受け渡し回数を表したものである． この表から分かるように，提案手法によって，文章の数は3から1へ（66.6%），書類受け渡し回数は28から12へ（57.2%），それぞれ減少した．
事務手続きの効率性については，（1）不要な情報の受け渡し，（2) 必要な書類の種類の数など，さまざまな視点からこれを考えることができる． そして，これらは一種のトレードオフの関係にあり，たとえば必要な書類の種類を減らせば，1種類の書
xii

Abstract
Table 2 – 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

Da

3

4

12

Db

2

Dc
2
Total number of information
Transmission of all documents

3

6

5

10

Document

Number of
informations

Times of documenttransmission

Total number oftransmission

D0a

3

4

12

Total number of information
Transmission of all documents

1228

類に含まれる情報が増えてしまうことから，不要な情報の受け渡しの可能性が高まる
ことになる． よって，冗長性の削減について考える場合には，状況に応じた対策が必要になる．提案手法は，複数の解候補を，複数の観点からの評価値とともに提示することが可能であり，さまざまな状況に適応することが可能である．
論文では，ASEAN諸国間の国際貿易事務処理を例に，提案システムの有効性について議論した．その結果，提案手法は，比較的大規模な問題に対しても問題無く適応できることが分かった． 提案システムは，複数の組織間での事務手続きの時間的な同期や，情報へのアクセス権限については考慮していない．実際の問題に適応するため，これらの問題の解決が今後の課題になる．

xiii

Contents
Declarationiii

Acknowledgementsv

Abstractvii

Abstract

xi

List of figures

xvi

List of tables

xvii

Introduction

1

1 Introduction
1.1 Background of the study . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.2 Purpose of thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.3 Research contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.4 Structure of thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

1
1
2
2
3

2 Backgrounds
2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2.2 Background of study . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2.2.1 International trade transaction . . . . . . . . . . . . . . . . . . .
2.3 Previous works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2.4 Graph theory and Set theory . . . . . . . . . . . . . . . . . . . . . . . . .
2.4.1 Graph theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2.4.2 Definitions of symbols based on set theory . . . . . . . . . . . .
2.5 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

5
5
5
5
6
10
11
12
13

3 A model of supporting system for improving efficiency of paperworks in international trade transaction processes
15
xv

Contents
3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3.2 A mathematical model of supporting system for improving efficiency of
paperworks in international trade transaction processes . . . . . . . . .
3.3 An example of international trade transaction process . . . . . . . . . .
3.4 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

15
17
18

4 Algorithms for reducing document flows
4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
4.2 Algorithms for reducing document flows . . . . . . . . . . . . . . . . . .
4.3 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

21
21
22
25

5 Experiments
5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.2 Experiment 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.2.1 Example A: An export process from Thailand to Malaysia . . . .
5.2.2 Example B: An export process from Lao PDR to Thailand . . . .
5.2.3 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.3 Experiment 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.3.1 Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.3.2 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.3.3 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.4 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

27
27
28
30
37
41
42
46
48
50
50

6 Conclusions and Future directions
6.1 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
6.2 Directions for future works . . . . . . . . . . . . . . . . . . . . . . . . . .

51
51
52

Bibliography

55

xvi

15

List of Figures
1
2

An example of information flow . . . . . . . . . . . . . . . . . . . . . . .
An example of information flow . . . . . . . . . . . . . . . . . . . . . . .

viii
xi

1.1 Structure of the thesis. . . . . . . . . . . . . . . . . . . . . . . . . . . . .

4

3.1 A framework of support system for international trade transaction. . .
3.2 An example of document flows. . . . . . . . . . . . . . . . . . . . . . . .

16
18

4.1 A basic idea of reducing an international trade transaction process. . .

23

5.1
5.2
5.3
5.4
5.5
5.6
5.7
5.8
5.9

31
34
36
38
41
43
44
47
49

Document flows of example A. . . . . . . . . . . . . . . . . . . . . . . . .
Flow of information i5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Original and reduced document flows of example A. . . . . . . . . . . .
Document flows of example B. . . . . . . . . . . . . . . . . . . . . . . . .
Original and reduced document flows of example B. . . . . . . . . . . .
Document flows of the merged process. . . . . . . . . . . . . . . . . . .
Document flows of the actual process. . . . . . . . . . . . . . . . . . . .
Initial document flows of the example. . . . . . . . . . . . . . . . . . . .
Generating document flows of the example. . . . . . . . . . . . . . . . .

xvii

List of Tables
1

The numbers of information transmission of current process and the
reduced process in the example . . . . . . . . . . . . . . . . . . . . . . .
The numbers of information transmission of current process and the
reduced process in the example . . . . . . . . . . . . . . . . . . . . . . .

xiii

2.1 Summary of strengths and weaknesses of previous works . . . . . . . .
2.1 Summary of strengths and weaknesses of previous works . . . . . . . .

910

3.1 Document used in the example . . . . . . . . . . . . . . . . . . . . . . .
3.2 Notation of organizations in the example . . . . . . . . . . . . . . . . .
3.3 A Mathematical model of the example . . . . . . . . . . . . . . . . . . .

17
18
19

5.1
5.1
5.1
5.2
5.3
5.4
5.5
5.6

28
29
30
31
32
33
35

2

Documents and informations used in examples . . . . . . . . . . . . . .
Documents and informations used in examples . . . . . . . . . . . . . .
Documents and informations used in examples . . . . . . . . . . . . . .
Notation of organizations in example A . . . . . . . . . . . . . . . . . .
A Mathematical model of example A . . . . . . . . . . . . . . . . . . . .
Routes of information of example A . . . . . . . . . . . . . . . . . . . . .
Reduced information flows of example A . . . . . . . . . . . . . . . . . .
The numbers of information transmission of current process and the
reduced process in example A . . . . . . . . . . . . . . . . . . . . . . . .
5.7 Notation of organizations in example B . . . . . . . . . . . . . . . . . .
5.8 A Mathematical model of example B . . . . . . . . . . . . . . . . . . . .
5.9 Routes of information of example B . . . . . . . . . . . . . . . . . . . . .
5.10 Reduced information flows of example B . . . . . . . . . . . . . . . . . .
5.11 The numbers of information transmission of current process and the
reduced process in example B . . . . . . . . . . . . . . . . . . . . . . . .
5.12 Information getten by each node . . . . . . . . . . . . . . . . . . . . . .
5.13 Organizations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.14 Information of the experiment . . . . . . . . . . . . . . . . . . . . . . .
5.15 Merged pair and evaluation values . . . . . . . . . . . . . . . . . . . . .
5.16 Weights of the conditions . . . . . . . . . . . . . . . . . . . . . . . . . . .

ix

37
38
39
39
40
42
43
47
47
48
48
xix

List of Tables
5.17 Results of the experimentxx. . . . . . . . . . . . . . . . . . . . . . . . . .

49

1 Introduction

This chapter provides an introduction to the research covered in this study. It starts
by explaining backgrounds of the study, followed by purpose of thesis and researchcontributions. Then, details of the structure of thesis is shown.

1.1

Background of the study

In recent years, international trade processes between different countries have an
important role in the economic development and movement of goods, services, andtechnology. Regional economic integration occurs to remove barriers of trading andcustoms unions between countries. For instance, the European Union (EU) is theregional economic integration in the Europe zone which aims to remove barriers totrade such as tariffs and border controls. In Southeast Asia, it also has the regional
economic integration Association of Southeast Asian Nations (ASEAN). One of the aimsof ASEAN is to accelerate economic growth, social progress, and cultural development.
In the North America zone, the U.S., Canada, and Mexico, there is the NAFTA whichaims to eliminate or reduce barriers to trade and investment. Although the aims ofeach regional economic integration are successful, limitations of international trade
have remained. For example, each country has designed its own international tradetransaction processes without considering other countries’ circumstances.
Therefore, international trade transaction processes can be considered as systems
consisting of sub-systems designed by each country for international trades. Thus,
each sub-system has designed based on their own concept, and it makes the wholesystem complex. If we can reconstruct the whole-system, it could be a higher efficientsystem. However, it is not easy to reconstruct the complex integrated system withkeeping the consistency. Despite many countries try to reduce the complexity of
documentation requirements in the process of trading across borders, e.g. developing
online submitting system and sharing their regulations on the Internet [1, 2], the1Chapter 1. Introduction
problems have not resolved yet. Such facts cause several types of redundancy of
paperworks process in an international trade transaction, such as redundancy of
sharing information and redundancy of using documents.
To solve the problems, a system for reducing redundancy of paperworks in international trade transaction processes is proposed. The system is created based on athree-layer model which consists of Information flow layer, Document flow layer, andPresentation layer. This background of a supporting system which will be discussed
in Chapter 3. A function of the supporting system is to streamline document flows ininternational trade transactions processes. This function is executed by three modules:(1) Generating information from document flows, (2) Reducing redundancy of theinformation flows, and (3) Generating document flows from information flows. Thisfunction of a supporting system which will be discussed in Chapter 4. Furthermore,experiments are conducted to investigate the performances of the proposed system in
Chapter 5.

1.2

Purpose of thesis

The main purpose of this thesis is to propose a system for improving the efficiency of
paperwork process in an international trade transaction by reducing redundancy andcomplexity of paperworks process. To achieve the main purposes, the study attempts
to focus on the following objects.
(1) To investigate document flows and information flows among organizations ofinternational trade transaction processes.
(2) To realize document flows and information flows of international trade transaction processes.
(3) To propose a method for improving efficiency of paperworks in international
trade transaction processes.
(4) To realize the proposed method in the case of international trade(5) To investigate the performances of the proposed method in the case of international trade transaction process

1.3

Research contributions

This thesis aims to propose a system for improving the efficiency of paperwork process
in an international trade transaction. The research and theoretical contributions of
this thesis can be summarized as follows.
Practical contribution A novel system for improving efficiency of paperworks in international trade transaction processes is proposed. Several situations of paper-21.4. Structure of thesis
works process in international trade transaction can be applied in the proposedsystem.
Theoretical contribution A diagrammatic and mathematical model for represent thesystem are proposed.

1.4Structure of thesis

This thesis consists of six chapters in which shown in figure 1.1. This thesis is organized into three main parts in six chapters. The first part covers theoretical andmethodological perspective through relevant literature (Chapter 1-2). The second
part presents a model for improving efficiency of paperworks in international tradetransaction processes (Chapter 3). The third part explains the proposed algorithms for
reducing document flows based on the supporting system for improving efficiency of
paperworks in international trade transaction processes (Chapter 4-5). Conclusions
and future directions (Chapter 6) are presented at the final part of this thesis. Brief
descriptions of the chapters are presented as followed.
Chapter 1: Introduction
Chapter 2: Backgrounds
Chapter 3: A model of supporting system for improving efficiency of paperworks ininternational trade transaction processes
Chapter 4: Algorithms for reducing document flows based on the proposed model
Chapter 5: Experiments
Chapter 6: Conclusions and future directions

3

Chapter 1. Introduction
Chapter 1
Introduction
Chapter 2
Background

Chapter 3
A Model of Supporting System for Improving
Efficiency of Paperworks in International
Trade Transaction Processes

Chapter 4
Algorithms for Reducing Document Flows

Chapter 5
Experiments
Chapter 6
Conclusions and Future Directions

Figure 1.1 – Structure of the thesis.

42 Backgrounds

2.1

Introduction

The aim of this chapter is to present covers theoretical and methodological perspective
through relevant literature. The following three topics are mentioned; the first one isthe background of study, the second one is previous works, the last one is fundamental
theory.

2.2

Background of study

2.2.1

International trade transaction

International trade is a concept of exchange of goods and services between people
or entities in different countries. International trade processes between different
countries have an important role in the economic development. In the period from2008 - 2018, the volume of import and export has increased dramatically. In 2018, thevolume of world trade, as measured by the average of exports and imports, grew by 3.0
percent, just above the 2.9 percent increase in world GDP over the same period [3] .
International trade create jobs and stimulates economic growth, as well as give domestic companies more experience in producing for foreign markets. The only way
to stimulates international trade is to make trade process easier overall. Regional economic integration occurs to remove barriers of trading and customs unions between
countries. For instance, the European Union (EU) is the regional economic integrationin the Europe zone which aims to remove barriers to trade such as tariffs and bordercontrols. In Southeast Asia, it also has the regional economic integration Association ofSoutheast Asian Nations (ASEAN). One of the aims of ASEAN is to accelerate economic
growth, social progress, and cultural development. In the North America zone, the U.S.,
Canada, and Mexico, there is the NAFTA which aims to eliminate or reduce barriers
to trade and investment. Although the aims of each regional economic integration

5

Chapter 2. Backgrounds
are successful, limitations of international trade have remained. For example, eachcountry has designed its own trade transaction processes without considering othercountries’ circumstances. International trade transaction process is not as easy as domestic trade transaction process. International markets are more dynamics, uncertain,
and challenging because cultural diversities and political realities in several nations
create plenty of barriers that need special attention.
Doing business [4] has considered several important dimensions of the regulatoryenvironment as it applies to local firms. It provides quantitative indicators on regulation for starting a business, dealing with construction permits, getting electricity,
registering property, getting credit, protecting minority investors, paying taxes, trading
across borders, enforcing contracts and resolving insolvency. In the terms of trading
across borders, they have reported that outdated and inefficient border procedures,
inadequate infrastructure, and unreliable logistics services are reasons that cause thetime and cost consuming. They collects the data included time and cost of international trade process, number of documents that needed to complete the transaction
processes. In order to proceed in international trade processes, organizations haveto follow procedure and handle various documents. Documents also contain various
informations. Obviously, a paperwork process is important to trade facilitation forinternational trade. The paperwork process also can be represented as an ease of doing
business between two countries. However, it is one of the bottlenecks in the international trade. It has been observed that border crossings still remain the weakest links inmany economic corridors [5]. Weak points of these processes are redundant clearance
process, and requirement of multiple documents in different formats, differences oflaws, regulations and languages.
Moreover, international trade has evolved into a complex network of organizations,both inside and outside countries; government agencies under the ministry of trade,
commerce, inspection agencies, customs and central excise, banking institutions, forwarding agents, shipping companies or airlines, carriers for inland transportation,
etc [6]. The documents are supposed to cover the maximum amount of information to avoid a lack of information for each organization. Whereas there are manyorganizations who also need their own documents.
These facts lead to complexity in international trade networks. A key factor that
contributes to the complexity of border crossing network is the same element of
document occurring as a redundancy. The redundancy is perceived as a kind of noisethat affects the quality of the network [7]. This leads us to design a system to deal withthe redundancy and information diversity problems.

2.3

Previous works

Several studies have been conducted in supply chain management (SCM) in tradetransactions [8–11]. These studies have been mainly focused on domestic trade trans6

2.3. Previous works
actions, so they have not been taken the transaction procedures among different
countries and organizations into consideration.
Jolayemi has applied a linear programming model for production-distribution andtransportation planning to enhance an organizations operational efficiency and financial performance [12]. In Yung and Yangs study, genetic algorithm has been applied
to upstream and downstream firms to obtain combined solutions of supply chain toachieve efficient and effective order processing in the operation [13]. Wang and Liang
proposed a multi-objective linear programming model to minimize production cost,
shortage cost, and changes in the workforce level [14]. The main findings of thesestudies are focused on reducing the costs of transportation, production planning, andcost of inventory in the trade transactions.
Improving efficiency of paperworks in offices is an important problem for business andmany studies have been conducted. For example, Dewan, et al. proposed a method toconsolidate tasks in a business process [15]. The aim of the approach is to reduce losses
and delays in inter-task communications by consolidating related tasks. They considered four parameters; (1) Precedence of information flows (2) Loss of specialization (3)Reduction in handoffs, and (4) Technology supports costs. Their method changed theinformation precedence and the overall process network topology through task consolidation. Their methodology is an extension of the conventional PERT/CPM approach.
However, this proposal is most applicable to routine transactional processes such asorder fulfillment or accounts payable in a business process. By using the consolidating
related tasks as a unified methodology to come up with redesign initiatives is basedon the common observation that delay and hand-off are one of the main reason why
many process are inefficient.
Nonaka has also proposed a method for consolidating workflow processes [16]. In the
study, an access permission to information of each organization in a business process
is focused. Such as a case where the authorization to personnel information is different
between the subsection chief and the section chief. Some participants may not be able
to reference information necessary for decision making. In such a case, the participantalso cannot change or enter necessary information. The aim of the study is to improve
an office environment of a workflow processes and to simplify activities in a workflow
system for participants. This invention provides a workflow engine connected withmultiple computer terminals to manage workflows. In the method of the invention,
there are several steps for consolidating workflow processes; (1) determining the rangeof consolidating multiple consecutive nodes to be processed by the participant basedon a workflow definition stored in a storage device, (2) determining the highest level ofaccess permission to each field with in the consolidation from the workflow definition,(3) acquiring work items selectable for each node within the determined consolidation
range from the workflow definition stored in the storage device,(4) acquiring the layout
definition of a form to be provided to the participant from the workflow definition, and7

Chapter 2. Backgrounds(5) generating a form as consolidated information based on the access permission andthe layout definition.
In Fridgen, Gilbert, et al.[17], they have developed a prototype system based onblockchain technology to improve a cross-organization workflows by extending aworkflow management system. One major advantage of a cross-organizational WfMS
based on Blockchain is a cross-organizational workflow are enabled without the needfor one particular authority. Their prototype provides an example how to design andimplement a Blockchain solution in the field of BPM. Blockchain-based solution may
face challenges public goods are usually prone to, such as overuse, unclear responsibilities, or different opinions of users. They conducted interviews for experts to confirm
the effects of the prototype system. All interviewees emphasized that Blockchain technology can play an important role for the financial services industry if standardization
and applicability is developed further. Their prototype does not address all aspects
necessary for a productive system in full detail. Also, distinct risk, benefit, or costconsiderations of Blockchain solutions do not yet exist.
Orantes Jimenez, S. D. et al. [18] has suggested the use of paperless office for Small andMedium Enterprises (SMEs) or large companies. By introducing paperless office, we
can improve the efficiency of paperworks because we can get supports of informationand communication technologies. The authors said there are three main advantages byusing a paperless office; (1) money saving, (2) space saving, and (3) environmental care.
However, before making any changes, companies need to have a strategy, for example,
if they are to scan documents to employ digitally is necessary to determine permissions
to restrict access to files and folders, also create naming conventions for documents
and folders for recovery it efficient. The company will have to invest in and that will
have huge costs and capital investment. Hardware that may need to be purchased
includes scanners, servers and communication devices such as smartphones andtablets for those in the field to keep in touch. Software that may be needed consists
typically of integration solutions that help different systems to communicate with othersystems, document archiving and communication applications. Some of their older
employees may not be as receptive (compared to the younger staff) to the broad use oftechnology that is required to go paperless. Moreover, the international standards forpaperless trade have not been fully determined.
Civelek, et al. [1] investigated redundancy and complexity of paperworks in international trade transaction processes and suggested us to use electronic paperwork
systems. This study observed on e-document in the field of foreign trade. It is expectedthat all document functions will be combined with a single application in an electronic
environment in the future. All organizations involved in this process must come together on a common system so that a foreign trade transaction is carried out over theinternet on a single document from the beginning to the end. However, this process
does not seem like to take place in a very short time. The establishment of an online8

2.3. Previous works
infrastructure that can bring together all the parties involved in international tradetransactions need international cooperation by countries as well as major investments.
It is observed that the establishment of such cooperation is difficult. As a result, they
concluded that the processes can be executed through an online platform which allorganizations involved in the process can access. They said that the number of documents can be decreased, and complexities of paperwork process can be reduced byintroducing the electronic documents systems.
Ponanan, et.al. [19] have proposed a basic framework of supporting system for international trade transaction process for absorbing differences of formats and typesof documents. The model is designed from three aspects, information flow, document flow and presentation. Then, an international logistics ontology is developed
to describe the international trade transaction model. An algorithm for optimizing
information flow is proposed for removing redundancies of information flows in theinternational trade transaction system. This framework is well designed, but theimplementing way has not shown yet.
To conclude the several of researches on system for improving efficiency of paperworks
in offices, strengths and weaknesses of literature review are summarized in Table 2.1.
Table 2.1 – Summary of strengths and weaknesses of previous works
Authors

Goal

Strengths

Dewan et al.
[15]

To reduce delays
in inter-task
communications
by consolidatingtasks- Suitable for a businessprocess- Extension of theconventional PERT/CPM

Nonaka[16]

Orantes et al.
[18]

To improve
workflow in
an officeenvironment

To improve
quality andaccessibilityof services of
an office- Suitable for a businessprocess- Suitable for a large process- Highlight of a level ofaccess permission ofparticipants in a process- Suitable for instructing aworkflow system as acomputer- Idea and concept are easy
to apply- Flexible and easy tomaintain- Space saving- Environment care
- Supported by information
technology andcommunication (ICT)

Weaknesses- Only concentrate on
routine transactional
processes- Can be time and costconsuming- Difficult to interpret- Time and cost consuming- Difficult to construct- Difficult to use- Easily becomescomplicated- Time and cost consuming- Only concentrate oninternal organization in
an office- Lack of standard ofpaperless trade- Do not include redundancy
of information in documents

9Chapter 2. Backgrounds
Table 2.1 – Summary of strengths and weaknesses of previous works
Authors

Goal

Strengths

Civelek et al.
[1]

To improvea document
system in thefield of foreigntrade- Highlight on document of
a foreign trade transaction- Supported by e-document
system- Present a useful of using
e-documents

Fridgen et al.
[17]

To improve acrossorganizational
workflow

Ponanan et.al.
[19]

To improve
an international
trade transaction
process by
optimizing
document flows- Highlight on developinga Blockchain
prototype to improve across-organizational
workflow- Suitable for a businessprocesses- Supported by Blockchain
technology- Suitable for international
trade transaction
processes- Highlight on informations
and documents- Can provide several
language for the users- Reducing redundancy
of information of
document flows

Weaknesses- Time and cost consuming
in construction- Do not have standard ofelectronic documents- Difficult to integrate allparties involved inforeign trade transaction- Easy become complicate- Lack of standard ofblockchain technology- Lack of aspect for a
productive system infull details- Difficult to construct- Do not include distinct risk,
benefit, or cost considerationsof Blockchain solutions- Only concentrate oninternational tradetransaction processes
among ASEAN countries- Lack of the implementingway

In these studies, business processes are represented by using graph structures andconceptual ideas of the methodologies are shown. However, most of the previous works
have not considered about processing documents among different organizations orcountries. As same as our motivation, their approaches aim to improve the efficiency ofbusiness. Basically, their approaches do not change the network structures, and change
the tasks which are conducted on the networks. Most of the previous works have notconsidered about re-construct structures of network and re-design documents format.
On the other hand, our approach aims to re-construct structures of network, andsolve the problem more radically. The mechanism in this study consider to re-design
document format and improve efficiency of paperworks processes.

2.4

Graph theory and Set theory

In this section, the definitions and concepts of graph and definitions of symbols basedon set theory are shown.
10

2.4. Graph theory and Set theory

2.4.1

Graph theory

Graph theoretical concepts are widely used to study and model various applications,in different areas [20].
In [21], A graph G is an ordered triple (V (G), E(G), φG ) consisting of a set of V (G) of
nodes, a set E(G) of edges which connect the nodes, and an incidence function φGthat associates with each edge of G an unordered pair of vertices of G. If e is an edge
and u and v are nodes such that φG (e) = (u, v), then e is said to join u and v; the nodesu and v are called the ends of e.
In real life, there are various graphical models applications such as manufacturing,finance, steel production, handwriting recognition, network flow, etc [22–24]. In these
papers, business processes are represented by using graph structures and conceptualideas of the methodologies are shown. Many mechanisms for optimizing databasesystems have been proposed. These studies also related the paper because a document
can be considered as a record of database.
Bordoloi and Kalita [25] have proposed an approach for designing graph databasemodels from existing relational databases. In this article, database structures are
represented as graph structures. In the process of converting database structure tograph structure, intersection operation of set theory are used. Adji and Setiawan [26]have proposed an enhanced graph transforming algorithm to reduce the redundancyof results of transforming data from relational databases to NoSQL database. This study
shows that modeling with graph and set theory is a promised way to reduce redundancy
of a structure. In [27], they presented a graph technique for resolving a graph theory
problem. They presented a high performance graph indexing mechanism to address
the graph query problem on large networks. Wang, et al. [28] have provided a graphbased document representation in which documents are represented as dependency
graph. Nodes are identified as words and edges represent the relationship between pairof words. Rafi, et al. [29] also considered document as a document graph. Graph data
structures can easily captures the non-linear relationships of nodes, the documents
contains various feature terms that can be non-linearly connected hence a graph caneasily represent this information.
Those papers have resolved a graph problem by the operations on the graph such as
union and intersection of sets. In this study, paperwork processes can be represented
by graph structure. Each node stands for organization. Each edge stands for path of
information flow or path of document flow. Process of paperworks in an international
trade transaction named X is described as:
PX = (GX , DX , IX , QX , RX )11

Chapter 2. Backgrounds
Structure of process X is described as:
GX = (VX , EX )VX stands for a set of nodes which represent organizations in process X, EX stands fora set of edges which represent a path of document flows in process X, DX stands for aset of documents used in process X, IX stands for a set of all of informations used inprocess X, and QX stands for a set of all required informations of each organization inprocess X.

2.4.2

Definitions of symbols based on set theory

In order to realize the proposed system for reducing the redundancy of paperworks
processes, set theory is applied. A set is a collection of existing objects. The objects canbe considered as a member of a set. It can be numbers, people, letters of the alphabet,other sets, and so on.
In this study, symbols based on set theory are used for representing elements of paperworks processes. A process of paperworks in an international trade transaction named
X is described as:
PX = (GX , DX , IX , QX , RX )A structure of process X is described as:
GX = (VX , EX )here, VX stands for a set of nodes which represent organizations in process X, and EX
stands for a set of edges which represent a path of document flows in process X. An
edge from node vi to node vj is represented as (vi , vj )(∈ EX ).
A document Da (∈ DX ) is represented as a set of informations included in the document:
Da = {i1 , i2 , · · · in }here, im (∈ Da ) stands for an information m included in Document a. A set of all of
informations used in process X is represented as IX . Obviously, ∀D ⊂ IX . QX stands
for a set of all required informations of each organization in process X.
RX stands for a set of route of documents. Route of document a is represented as
Rda (∈ RX ). Route of information m is represented as Rim .
Moreover, operations of set theory are applied in the mechanism for reducing the12

2.5. Conclusion
redundancy of paperworks processes. Union is used for combing edges of routes of
documents. Intersection is used for finding the same edges of routes of document.

2.5

Conclusion

In this chapter, the three topics that concerned in this study have been mentioned suchas the background of study, previous works, and fundamental theory; graph theory
and set theory. The basic concept and application of each topic have been shown. The
notation of graph theory and set theory are the background theories and manipulate
the main objective of this paper. In the chapter 3-4, graph theory and set theory are
employed for describing international trade transaction processes.

13

3 A model of supporting system
for improving efficiency of paperworks in international tradetransaction processes
3.1

Introduction

The aims of this chapter are (1) to investigate document flows and information flows
among organizations of international trade transaction processes and (2) to realize
document flows and information flows of international trade transaction processes. In
this chapter, graph theory and set theory are employed for describing international
trade transaction processes. For this chapter, an international trade transaction process model consists of three layers: (1) Information flow layer, (2) Document flow layer,and (3) Presentation layer. It is necessary to have a common structure to describe information in documents that used in a transaction process. In this study, a mathematicalmodel for representing international trade transaction processes is defined.

3.2

A mathematical model of supporting system for improving efficiency of paperworks in international trade transaction processes

A framework of supporting system for international trade transaction processes was
proposed [19]. The framework is created based on a three-layer model which consistsof Information flow layer, Document flow layer, and Presentation layer. On Document
flow layer, flows of documents used in the process are represented; on Information flow
layer, information flows are described; on Presentation layer, labels of informations
are defined in several languages which required in the process.
Details of each layer are shown below:
Document flow layer : Flow of all documents in a process are represented by a network model on this layer.

15

Chapter 3. A model of supporting system for improving efficiency of paperworks
in international trade transaction processes
Information flow layer : Flow of all informations in a process are represented on thislayer.
Presentation layer : Labels of informations are described in several languages. Documents are translated into suitable languages for users on this layer.
Figure 3.1 illustrates the three-layer model.

(1) Presentation layer
年月日

住所

名

ชื่อ

ที่อยู

Name

Addressวันที่
Date(2) Document flow layer
Organization
1

Importer_a.name

Organization
2

Importer_a.address

Importer_a.name
Importer_a.address

Exporter_b.name

Importer_a.name

Document A(Type Invoice)

Importer_a.address
Packinglist_b.no

Exporter_b.name
Document A(Type Invoice)

Packinglist_b.date
3
Organization

Document B(Type Packing list)(3) Information flow layer

Organization
1

Organization
Importer_a.name
Importer_a.address
2
Exporter_b.name
Importer_a.name
Importer_a.name
Importer_a.address
Importer_a.address
Packing_b.no
Exporter_b.name
Packing_b.date
3
Organization

Figure 3.1 – A framework of support system for international trade transaction.

In order to implement the framework, notation of document flows and information
flows are needed. It is necessary to have a common structure to describe informationin documents used in a transaction process. A mathematical model for representing
international trade transaction processes is defined. By using this model, document
flows and information flows can be represented as a mathematical model for communicating between each layer in the supporting system as mentioned before.
A process of paperworks in an international trade transaction named X is described16

3.3. An example of international trade transaction processas:
PX = (GX , DX , IX , QX , RX )A structure of process X is described as:
GX = (VX , EX )here, VX stands for a set of nodes which represent organizations in process X, and EX
stands for a set of edges which represent a path of document flows in process X.
DX stands for a set of documents used in process X. A document Da (∈ DX ) is represented as a set of informations included in the document:
Da = {i1 , i2 , · · · in }here, im (∈ Da ) stands for an information m included in Document a. A set of all of
informations used in process X is represented as IX . Obviously, ∀D ⊂ IX . QX (⊂IX ) stands for a set of all required informations in a process X. A set of required
informations of organization r is represented as qr (∈ QX ).
An edge from node i to node j is represented as (vi , vj )(∈ EX ). RX stands for a setof route of documents. Route of document a is represented as Rda (∈ RX ). Route of
information m is represented as Rim .

3.3

An example of international trade transaction process

An example of international trade transaction process X is shown to illustrate the proposed mathematical model. In the example, three types of documents; (1) Document
type a (2) Document type b , and (3) Document type c are used. In each document,
several informations are described as shown in table 3.1.
Table 3.1 – Document used in the example
Type of document

Notation

Informations

Notation

Document type aDa

Document type b

Db

Document type c

Dc

Information 1
Information 2
Information 3
Information 1
Information 2
Information 1
Information 3

i1
i2
i3
i1
i2
i1
i3

In this process, there are five organizations; (1) Organization 1, (2) Organization 2, (3)Organization 3, (4) Organization 4, and (5) Organization 5. Table 3.2 shows notation
17

Chapter 3. A model of supporting system for improving efficiency of paperworks
in international trade transaction processes
representing organizations in the example.
Table 3.2 – Notation of organizations in the example
Organization

Notation

Organization 1
Organization 2
Organization 3
Organization 4
Organization 5

v1
v2
v3
v4
v5

(A)

(B)

Organization 1

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

1

3

Organization 2

Da = {i , i }
1 2

Dc =
Da ={i1, i3}{i1,i2,i3}

1

Dc =Da ={i1, i3}3Organization 5

3

Da =

Dc =

Organization 3

1{i1,i2,i3}

D =Db = c{i , i }{i1, i2}v1

D =Db = c{i , i }Organization 4{i1, i3}{i1,i2,i3}{i1,i2,i3}

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

v2{i1,i2,i3}{i1,i2,i3}

D =Db = c{i , i }{i1, i2}

1

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

v5

3

Da =

v3

Dc =
{i1, i3}

v4{i1,i2,i3}

Figure 3.2 – An example of document flows.
In Fig. 3.2 (A), the document flow of the example are shown. Each node stands fororganization and each arrow stands for a path of document flow. In Fig. 3.2 (B), thedocument flows are represented as a graph structure by using the symbols in Table 3.1
and 3.2. The process in Fig. 3.2 can be described as formulae in Table 3.3 by using the
proposed mathematical model.

3.4

Conclusion

In this chapter, an international trade transaction process model is introduced. A
mathematical model for representing information flows and document flows in international trade transaction processes is proposed. An example of paperworks process
is shown to illustrate the usage of the proposed mathematical model. As a result of
the example, we can see that international trade transaction processes are shown as
networks. Each node stands for an organization, and each edge stands for a flow of an
information. Information flows and documents flows of paperworks in international
trade transaction processes can be realized as an actual system by using the proposedmodel.

18

3.4. Conclusion
Table 3.3 – A Mathematical model of the example
PX = (GX , DX , IX , QX , RX )GX = (VX , EX )VX = {v1 , v2 , v3 , v4 , v5 }EX = {(v1 , v2 ), (v1 , v3 ), (v2 , v3 ), (v2 , v5 ), (v3 , v4 ), (v5 , v4 )}DX = {Da , Db , Dc }Da = {i1 , i2 , i3 }Db = {i1 , i2 }Dc = {i1 , i3 }IX = {i1 , i2 , i3 }QX = {q1 , q2 , q3 , q4 , q5 }RX = {Rda , Rdb , Rdc }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 )}19

4 Algorithms for reducing document
flows

4.1

Introduction

In this chapter, a fundamental of set theory as mentioned in chapter 2 is used. The
aim of this chapter is to propose a method for improving efficiency of paperworks ininternational trade transaction processes.
In this study, a supporting system for improving efficiency of paperworks in international trade transaction processes is proposed. The aim of the supporting system is to
reduce redundancy of document flows in international trade transaction processes.
The supporting system has three main steps: (1) converting document flows to information flows, (2) reducing information flows, and (3) generating document flows frominformation flows.
Details of each step are shown below.
(1) Converting document flows to information flows
Current document flows on document flow layer are converted to information
flows. A document can be considered as a set of informations because several
informations are described in it. Obviously, informations contained in a document have the same route with the document. Thus, by extracting informations,document flows can be converted into information flows.
(2) Reducing information flows
In this step, information flows on Information flow layer are focused. On thislayer, repeated information flows are eliminated by using a proposed algorithm
for reducing information flows.
(3) Generating document flows from information flows
Sets of informations are created by gathering informations which have the same
21

Chapter 4. Algorithms for reducing document flows
routes. Then, new documents are generated as each set of information corresponds to each document. Flow of each new document is generated fromreducing information flows.
Figure 4.1 shows a basic idea of reducing an international trade transaction process.

4.2

Algorithms for reducing document flows(1) Converting document flows to information flows
As mentioned above, each document can be considered as a set of informations.
Obviously, all informations contained in a document have the same route with the
document. In addition, same type of informations are used in several documents. So,
Rim , a route of information m, can be deduced as shown in Equation (4.1).

Rim = {S
Da ∈DX

Rda | Da ∩ {im } =
6 φ}

(4.1)

(2) Reducing information flows
Information flows are reduced by using algorithm 1 for reducing routes of information:
Algorithm 1 Reducing routes of information m
1: Input IX : A set of all information in a process X
2: Output IX : A set of all information in a process X
3: while ∃vn ∈ VX , deg+ (vn ) > 1 do
4: Find vc , where deg+ (vc ) = max (deg+ (vn )), ∀vn ∈ VX
5: Find vr , where deg− (vr ) = max (deg− (vn )), ∀(vr , vc ) ∈ Φ(EX )6:while deg+ (vc ) > 1 do
7:
Rim ← (Rim − (vr , vc ))8:
Find vc , where deg+ (vc ) = max (deg+ (vn )), ∀vn ∈ VX
9:Find vr , where deg− (vr ) = max (deg− (vn )), ∀(vr , vc ) ∈ Φ(EX )10:end while
11: end while

Here, deg+ (v) stands for the number of indegree of node v, deg− (v) stands for thenumber of outdegree of node v. φ stands for a mapping from an edge to a pair of nodes.
For example, φ(e) = (v1 , v2 ) stands for a situation where edge e connects node v1 andv2 .
(3) Generating document flows from information flows
Documents which include only one information are created. Here, 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. Then, a pair of
documents are found. If they have a common path of their route of document, these22

4.2. Algorithms for reducing document flows
A document flow
Db =

Dc =

{i1,i2,i3} {i1, i2}{i1, i3}

Da =

v1

v2

Dc =

Dc =

{i1, i3}{i1, i3}

Db ={i1, i2}

Da ={i1,i2,i3}

Dc =

Db =

{i1, i3}{i1, i2} {i1,i2,i3}

Da =

v3

v4
(1) Converting document flows
to information flows
An information flow

v1

i1

i2

v2

i3

i1

i3
i2

i2
i3

i1
i1

v3

v4

i2

i3
(2) Reducing information flows

A reduced information flow

v1

i1

i2

v2

i3

i1
i2
i3

v3

i1

i2

v4
i3
(3) Generating document flows
from information flows

A new document flowDA={i1,i2,i3}

v1

v2

DA=
{i1,i2,i3}

DA={i1,i2,i3}

v3

v4

Figure 4.1 – A basic idea of reducing an international trade transaction process.

23

Chapter 4. Algorithms for reducing document flows
documents can be merged. Algorithm 2 shows the algorithm to generate document
flows from information flows.
Algorithm 2 Generating routes of document from routes of information
1: Input IX : A set of all information in a process X
2: Output D∗X : Generated Document flows
3: Create a set of document DX = {D1 , D2 , ..., D|IX | }, |DX | = |IX |, RX = φ
4: Fmax = 0
5: for j = 0; j < |DX | − 1; j + + do
6:create Rdj , Rdj ← Rij , RX ← RX ∪ {Rdj }7: end for
8:
9: for a = 0; a < |DX | − 1; a + + do
10:
for b = a + 1; b < |DX |; b + + do
11:
if Rda ∩ Rdb = φ then12:
continue
13:
else
14:
if Rda = Rdb (6= φ) then. Route a and route b are same.
15:
create Dc ← Da ∪ Db , Rdc ← Rda
16:
DX ← DX ∪ {Dc }, RX ← RX ∪ {Rdc }17:
DX ← DX − {Da , Db }, RX ← RX − {Rda , Rdb }18:
FDX = α(f1 ) + β(f2 ). Calculate evaluation function
19:
else. Route a and route b have same routes.
20:
if Rda ∩ Rdb 6= φ then21:
create Dc ← Da ∪ Db , Rdc ← Rda ∩ Rdb
22:
Rda ← Rda − Rdc , Rdb ← Rdb − Rdc
23:
DX ← DX ∪ {Dc }, RX ← RX ∪ {Rdc }24:
FDX = α(f1 ) + β(f2 ). Calculate evaluation function
25:
else. Route b incluldes route a.
26:
if Rda ⊂ Rdb thendd27:
create Dc ← Da ∪ Db , Rc ← Rb
28:
DX ← DX ∪ {Dc }, RX ← RX ∪ {Rdc }29:
DX ← DX − {Db }, RX ← RX − {Rdb }30:
FDX = α(f1 ) + β(f2 ). Calculate evaluation function
31:
end if32:
end if33:
end if34:
end if
35:
Goto line 936:
end for37:
if FDX > Fmax then . Choose a candidate which has the maximum evaluation function
38:
Fmax ← FDX
39:
D∗X ← DX
. DX has been changed.
40:
end if
41: end forFirst, documents which include only one information are created ( line 3 ). Eventually,
the number of documents become same as the number of informations in the process.
Then, routes of documents are created. Each route is the same as route of information
24

4.3. Conclusion
included in the document ( line 5 - 7 ). Each document is checked if it is possible tomerge with other documents and evaluation function is calculated ( line 9 - 40 ). If
a document is merged with other documents, the checking process starts from firstagain ( line 35 ). Finally, the maximum evaluation function is found and new document
flows is generated ( line 37 - 40 ).

4.3

Conclusion

In this chapter, a mathematical model for representing paperworks process havebeen presented. By using the proposed mathematical model, the algorithms used for
reducing redundancy document flows in international trade transaction processes
can implement. In this chapter, the major contribution is the diagrammatic andmathematical model for represent the system are proposed. In the next chapter,
experiments are conducted for investigating the abilities of the proposed system.

25

5 Experiments

5.1

Introduction

In this chapter, two experiments are conducted for investigating the abilities of the proposed system in chapter 4. Two points of view are considered; (1) reducing redundancyof paperworks and (2) flexibility of the proposed system.
The first experiment is conducted for confirmimg the reducing redundancy of paperworks by using the proposed system. In this experiment, two examples are shown toillustrate the proposed system. The first example, the example A, is an export processfrom Thailand to Malaysia. The second example, the example B, is an export processfrom Lao PDR to Thailand. In the examples, the total number of documents and thetotal number of information transmissions are compared between original process
and reduced process.
Besides, the second experiment is conducted for confirming the flexibility of the proposed system. When reducing document flows, the requirements of system designers
must be considered. For example, someone could want to reduce the number of documents in a process, and the other one could want to reduce the number of informations
included in a document. The proposed system can have several evaluation functionsin accordance with the requirements of the system designers. In order to show theflexibility of the proposed system, a result of experiment was shown. The evaluation
functions in the experiment, two types of the redundancy of paperwork processes
are used as criteria; (1) redundancy of sharing information and (2) redundancy ofusing documents. By using the functions, they have a trade-off relationship. Two
different situations of reducing redundancy in paperworks process are investigated;(1) designer place emphasis on reducing informations in a document and (2) designer
place emphasis on reducing number of documents in a process.

27

Chapter 5. Experiments

5.2

Experiment 1

In this section, two examples of international trade transaction processes in ASEAN
are shown to illustrate the details of the proposed algorithms. The first example, theexample A, is an export process from Thailand to Malaysia. The second example,
the example B, is an export process from Lao PDR to Thailand. Table 5.1 shows
informations contained in each type of document which used in the examples.
Table 5.1 – Documents and informations used in examples
Type of document

Notation

Informations

Notation

Invoice

D1

Invoice number
Invoice date
Importer name
Importer address
Exporter name
Exporter address

i1
i2
i3
i4
i5
i6

InvoiceD’1

Invoice number
Invoice date
Importer name
Importer address
Exporter name
Exporter address
Tax ID number

i1
i2
i3
i4
i5
i6
i7

Bill of lading

D2

Importer name
Importer address
Exporter name
Exporter address
Name of import vehicle

i3
i4
i5
i6
i8

Bill of lading

D’2

Importer name
Importer address
Exporter name
Exporter address
Name of import vehicle

i3
i4
i5
i6
i8

Packing list

D3

Packing list number
Packing dateCompany of packing nameCompany of packing addressCountry of origin
Number of packages

i9
i10
i11
i12
i13
i14

Packing list

D’3

Name of import vehiclei828

5.2. Experiment 1
Table 5.1 – Documents and informations used in examples
Type of document

Notation

Informations

Notation

Packing list number
Packing dateCompany of packing nameCompany of packing addressCountry of origin
Number of packages

i9
i10
i11
i12
i13
i14

Export license

D4

Importer name
Importer address
Exporter name
Exporter addressCountry of origin
Country of destination

i3
i4
i5
i6
i13
i15

Import permit

D5

Importer name
Importer address
Exporter name
Exporter address
Number of permit
Name of authorized agent
Address of authorized agent

i3
i4
i5
i6
i16
i17
i18

Certificate of origin

D6

Importer name
Importer address
Exporter name
Exporter addressCountry of destination
Departure date

i3
i4
i5
i6
i15
i19

Cargo clearance

D7

Importer name
Importer address
Exporter name
Exporter addressCountry of origin
Country of destination

i3
i4
i5
i6
i13
i15

Custom declaration

D8

Importer name
Importer address
Exporter name
Exporter addressCountry of origin

i3
i4
i5
i6
i13

29

Chapter 5. Experiments
Table 5.1 – Documents and informations used in examples
Type of document

Notation

Informations

Notation

Country of destination

i15

Request for delivery

D9

Importer name
Importer address
Exporter name
Exporter address
Number of packages

i3
i4
i5
i6
i14

Container movement order

D10

Importer name
Importer address
Exporter name
Exporter address

i3
i4
i5
i6

Personal passport

D11

Passport number
Name of passport holder
Sex
Birthdate

i20
i21
i22
i23

Personal passport

D’11

Passport number
Name of passport holder
Sex
Birthdate

i20
i21
i22
i23

International transport permit

D12

Number of packages
ID of driver
Name of driver
Driver license number

i14
i24
i25
i26

International transport permit

D’12

Number of packages
ID of driver
Name of driver
Driver license number

i14
i24
i25
i26

Details of the examples are described below.

5.2.1

Example A: An export process from Thailand to Malaysia

Eight organizations; (1) Exporter, (2) Thailand’s custom, (3) Importer, (4) Forwarding
Agent, (5) Malaysia’s immigration, (6) Shipping Agent, (7) Malaysia’s custom, and (8)Port are related to the process. Twelve types of documents; including (1) invoice, (2)bill of lading, (3) packing list, (4) export license, (5) import permit, (6) certificate oforigin, (7) cargo clearance, (8) custom declaration form, (9) request for delivery, (10)container movement order, (11) personal passport, and (12) international transport30

5.2. Experiment 1
permit are used.
Table 5.2 – Notation of organizations in example A
Organization

Notation

Organization

Notation

ExporterThailand’s custom
Importer
Forwarding agent

v1
v2
v3
v4

Malaysia’s immigration
Shipping agent
Malaysia’s custom
Port

v5
v6
v7
v8

(A)
Malaysia’s
Immigration

Import permit
Invoice
Packing list
Export license

Exporter

Invoice
Packing list
Export license

Port

Personal passport
Invoice
Packing list
International transport permit
Certificate of origin
Container Movement Order

ImporterContainer Movement Order
Cargo clearance

Bill of lading
Request for delivery

Forwarding
Agent

Thailand’s
CustomShipping
Agent

Custom delcaration form

Malaysia’s
Custom

(B)

v5
D1
D3
D6
D11
D12

D5

v1
D1
D3
D4

v2

D1 D3 D4

v8

v3

D10
D10
D7

v4
D8

v6
D2 D9

v7
Figure 5.1 – Document flows of example A.
In Fig. 5.1 (A), the document flow of the example A are shown. Each node stands for an
organization and each arrow stands for a path of document flow. In Fig. 5.1 (B), thedocument flows are represented as a graph structure by using the symbols in Table 5.1
31Chapter 5. Experiments
and 5.2.
The process in Fig. 5.1 can be described as formulae in Table 5.3 by using the proposed
mathematical model shown in chapter 3.
Table 5.3 – A Mathematical model of example A
PA = (GA , DA , IA , QA , RA )GA = (VA , EA )VA = {v1 , v2 , v3 , v4 , v5 , v6 , v7 , v8 }EA = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ), (v3 , v5 ), (v4 , v6 ), (v4 , v7 ), (v5 , v3 ), (v6 , v4 ), (v6 , v8 )}DA = {D1 , D2 , D3 , D4 , D5 , D6 , D7 , D8 , D9 , D10 , D11 , D12 }
D1 = {i1 , i2 , i3 , i4 , i5 , i6 }D2 = {i3 , i4 , i5 , i6 , i8 }D3 = {i9 , i10 , i11 , i12 , i13 , i14 }D4 = {i3 , i4 , i5 , i6 , i13 , i15 }D5 = {i3 , i4 , i5 , i6 , i16 , i17 , i18 }D6 = {i3 , i4 , i5 , i6 , i15 , i19 }D7 = {i3 , i4 , i5 , i6 , i13 , i15 }D8 = {i3 , i4 , i5 , i6 , i13 , i15 }D9 = {i3 , i4 , i5 , i6 , i14 }D10 = {i3 , i4 , i5 , i6 }D11 = {i20 , i21 , i22 , i23 }D12 = {i14 , i24 , i25 , i26 }IA = {i1 , i2 , i3 , i4 , i5 , i6 , i8 , i9 , i10 , i11 , i12 , i13 , i14 , i15 , i16 , i17 , i18 , i19 , i20 , i21 , i22 , i23 ,
i24 , i25 , i26 }QA = {qv1 , qv2 , qv3 , qv4 , qv5 , qv6 , qv7 , qv8 , qv9 , qv10 }RA = {Rd1 , Rd2 , Rd3 , Rd4 , Rd5 , Rd6 , Rd7 , Rd8 , Rd9 , Rd10 , Rd11 , Rd12 }Rd1 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}, Rd2 = {(v4 , v6 )},Rd3 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}, Rd4 = {(v1 , v2 ), (v1 , v3 )},Rd5 = {(v5 , v3 )}, Rd6 = {(v3 , v5 )}, Rd7 = {(v3 , v4 )},Rd8 = {(v4 , v7 )}, Rd9 = {(v4 , v6 )}, Rd10 = {(v6 , v4 ), (v6 , v8 )},Rd11 = {(v3 , v5 )}, Rd12 = {(v3 , v5 )}(1) Converting document flows to information flows
In this step, routes of informations are generated from routes of documents shown in
Fig. 5.1 by using the equation (4.1) on page 22. The generated routes of information
are shown in Table 5.4.
(2) Reducing information flows
The generated information flows are reduced by using algorithm 1. For example, Ri6(Fig. 5.2) is reduced as followings:
line 1: deg+ (v3 ) = 2(> 0) and deg+ (v4 ) = 2(> 0), so loop is continued.
32

5.2. Experiment 1
Table 5.4 – Routes of information of example A
Ri1 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}Ri2 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}Ri3 = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ),(v3 , v5 ), (v4 , v6 ), (v4 , v7 ),(v5 , v3 ), (v6 , v4 ), (v6 , v8 )}Ri4 = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ),(v3 , v5 ), (v4 , v6 ), (v5 , v3 ),(v6 , v4 ), (v6 , v8 )}Ri5 = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ),(v3 , v5 ), (v4 , v6 ), (v4 , v7 ),(v5 , v3 ), (v6 , v4 ), (v6 , v8 )}Ri6 = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ),(v3 , v5 ), (v4 , v6 ), (v5 , v3 ),(v6 , v4 ), (v6 , v8 )}i
R8 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 ),(v4 , v6 )}Ri9 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}Ri10 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}Ri11 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}Ri12 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}Ri13 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 ),(v4 , v7 )}Ri14 = {(v3 , v5 )}Ri15 = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ),(v3 , v5 ), (v4 , v7 )}Ri16 = {(v5 , v3 )}Ri17 = {(v5 , v3 )}Ri18 = {(v5 , v3 )}Ri19 = {(v5 , v3 )}Ri20 = {(v3 , v5 )}Ri21 = {(v3 , v5 )}Ri22 = {(v3 , v5 )}Ri23 = {(v3 , v5 )}Ri24 = {(v3 , v5 )}Ri25 = {(v3 , v5 )}Ri26 = {(v3 , v5 )}line 2: v3 is selected which has maximum indegree (= 2).
line 3: two nodes, v1 and v5 , are connected with v3 . Here deg− (v5 ) > deg− (v1 ). Thus,
v5 is selected.
line 4: deg+ (v3 ) = 2, so loop is continued.
line 5: Edge (v5 , v3 ) is deleted from the route Ri5 ( Fig. 5.2 (2) )line 6: v4 is selected which has maximum indegree (= 2).
line 7: 2 nodes, v3 and v6 , are connected with v4 . Here deg− (v6 ) > deg− (v3 ). Thus, v6
is selected.
line 4’: deg+ (v4 ) = 2, so loop is continued.
line 5’: Edge (v6 , v4 ) is deleted from the route Ri6 ( Fig. 5.2 (3) )line 6’: v2 is selected which has maximum indegree (= 1).
line 7’: one node, v1 , is connected with v2 . Thus, v2 is selected.
33

Chapter 5. Experiments
(1)

(2)

v8

v5
v1

v3

v5
v1

v4

v3

v6

v2

vA4
4

v6

v2
v7

v7

(3)

(4)

v8

v5
v1

v8

v3

v1
v4

v3

v6

v2

v8

v5

v4

v6

v2
v7

v7

Figure 5.2 – Flow of information i5 .

line 4”: deg+ (v2 ) = 1, so loop is cancelled.
Eventually, the reduced route shown in Fig. 5.2 (4) is obtained.
In this way, all of the routes of information are reduced as shown in Table 5.5.
(3) Generating document flows from information flows
Document flows are generated from the reduced information flows by using algorithms
2 as followings:
line 3: Twenty-five documents (|IA | = 25) are created as DA = {D<1> , D<2> , D<3> , · · · ,D<26> }. Each document has an information, e.g. D<5> = {i5 }, D<6> = {i6 }.
line 5-7: Create route of each document as same with the route of information included in the document.
line 9: 0th document, D<5> is selected as a. Rda = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ), (v3 , v5 ),(v4 , v6 ), (v4 , v7 ), (v6 , v8 )}line 10: 1st document, D<6> is selected as b. Rdb = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ), (v3 , v5 ),(v4 , v6 ), (v4 , v7 ), (v6 , v8 )}34

5.2. Experiment 1
Table 5.5 – Reduced information flows of example A
Ri1 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}Ri2 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}Ri3 = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ), (v3 , v5 ),(v4 , v6 ), (v6 , v8 )}Ri4 = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ), (v3 , v5 ),(v4 , v6 ), (v6 , v8 )}Ri5 = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ), (v3 , v5 ),(v4 , v6 ), (v4 , v7 ), (v6 , v8 )}i
R6 = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ), (v3 , v5 ),(v4 , v6 ), (v6 , v4 ), (v6 , v8 ), }Ri8 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 ), (v4 , v6 )}Ri9 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}Ri10 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}Ri11 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}Ri12 = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}Ri13 = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ), (v3 , v5 ),(v4 , v7 )}Ri14 = {(v3 , v5 )}Ri15 = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ),(v3 , v5 ), (v4 , v7 )}Ri16 = {(v3 , v5 )}Ri17 = {(v5 , v3 )}Ri18 = {(v5 , v3 )}Ri19 = {(v5 , v3 )}Ri20 = {(v3 , v5 )}Ri21 = {(v3 , v5 )}Ri22 = {(v3 , v5 )}Ri23 = {(v3 , v5 )}Ri24 = {(v3 , v5 )}Ri25 = {(v3 , v5 )}Ri26 = {(v3 , v5 )}line 11: Rda ∩ Rdb 6= φline 14: Rda = Rdb , so line 15-18 are executed.
line 15: Create a new document D<5,6> = {i5 , i6 }.
line 16: Document D<5,6> is added for the set of DA , and the route of document
D<5,6> (= D<5> ) is add for the set of RA .
line 17: Document D<5> and D<5> are delete from the set of DA . Rd<5> and Rd<5> aredeleted from the set of RA . Here, DA = {D<1> , D<2> , · · · , D<26> , D<5,6> }.
line 18: Evaluation function is calculated.
line 35: Goto line 9
line 9’: 0th document, D<3> is selected as a.
line 10’: 1st document, D<4> is selected as b.
In this way, the documents are gradually merged. Eventually the below five documents
are obtained:(1) DA = {i3 , i4 , i5 , i6 }, RdA = {(v1 , v2 ), (v1 , v3 ), (v3 , v4 ), (v3 , v5 ), (v4 , v6 ), (v4 , v7 ), (v6 , v8 )}(2) DB = {i1 , i2 , i9 , i10 , i11 , i12 , i13 , i14 , i15 }, RdB = {(v1 , v2 ), (v1 , v3 ), (v3 , v5 )}35

Chapter 5. Experiments(3) DC = {i13 , i15 }, RdC = {(v3 , v4 ), (v4 , v7 )}(4) DD = {i16 , i17 , i18 , i19 }, RdD = {(v5 , v3 )}(5) DE = {i8 , i14 }, RdE = {(v4 , v6 )}(6) DF = {i14 , i20 , i21 , i22 , i23 , i24 , i25 , i26 }, RdF = {(v3 , v5 )}
(A)

v5
D1
D3
D6
D11
D12

D5

v1

D1 D3 D4

v8

v3

D10
D10

D1
D3
D4

D7

v2

v4
D8

v6
D2 D9

v7
v5

(B)

DA
DB
DF

DD

v1
DA
DB

v2

DA DB

v8

v3

DA
DA

DC

v4
DA
DC

v6
DA DE

v7
Figure 5.3 – Original and reduced document flows of example A.
Figure 5.3 (A) shows the original document flows and Fig.5.3 (B) shows the reduced
document flows. In addition, the number of information transmissions can be deduced
as shown in Equation (5.1).
36

5.2. Experiment 1(5.1)

Ta = |Da | × ta
where,• Ta : Total number of informations transmission of a document a• Da : Number of informations of a document a• ta : Times of document a transmission in a process

Table 5.6 – The numbers of information transmission of current process and the
reduced process in example A
Original process of example A

Reduced process of example A

Document

Number of
informations

Times of documenttransmission

Total number oftransmission

Document

Number of
informations

Times of documenttransmission

Total number oftransmission

D1

6

3

D2

5

1

18

DA

4

8

28

5

DB

9

3

D3

7

27

3

21

DC

2

2

D4

4

6

2

12

DD

4

1

4

D5

7

1

7

DE

2

1

2

D6

6

1

6

DF

8

1

2

D7

6

D8
6
D9
5
D10
4
D11
4
D12
4
Total number of informationtransmissions of all documents

1

6

1
1
2
1
1

6
5
8
4
4

Total number of informationtransmissions of all documents

73

102

Table 5.6 shows the numbers of information transmissions of current process and the
reduced process in example A. In the table, number of information of a document,
times of document transmission, and total number of transmission are shown. We
can see that the number of documents is decreased from ten to six. The flow of
document from shipping agent (v6 ) to forwarding agent (v4 ) is eliminated due toreduction. Futhermore, the number of information transmissions is also decreased
from one-hundred-two times to seventy-three times (28.4%).

5.2.2

Example B: An export process from Lao PDR to Thailand

Seven organizations: (1) Exporter, (2) Bank, (3) Lao PDR custom, (4) Lao PDR immigration, (5) Thailand immigration, (6) Importer, and (7) Thailand custom are related tothe process. In the process, five types of documents: (1) invoice, (2) packing list, (3)personal passport, (4) international transport permit, and (5) bill of lading are used.
Table 5.7 shows notation representing organizations in example B.
In Fig. 5.4 (A), the document flows of example B are shown. Each node stands for37

Chapter 5. Experiments
Table 5.7 – Notation of organizations in example B
Organizations

Notations

ExporterBank
Lao PDR’s custom
Lao PDR’s immigration
Thailand’s immigration
ImporterThailand’s custom

v10
v11
v12
v13
v14
v15
v16

organization and each arrow stands for a path of document flow. In Fig. 5.4 (B), thedocument flows are represented by using a graph structure with the symbols in Table
5.1 and 5.7. The process in Fig. 5.4 can be described as formulae in Table 5.8 by using(A)

Exporter

Invoice
Packing list

Bank

Invoice
Packing list

Lao PDR’s
CustomPersonal passport
International transport permit

Lao PDR’s
Immigration

Personal passport
International transport permit

Thailand’s
Immigration

Bill of lading
Invoice
Packing list

Bill of lading
Invoice
Packing list

Importer

(B)

v11
D’3

v12
D’3 D’1
D’12 D’11

v10
D’3

D’12 D’11

D’2

v13
v14

D’1

v15

D’3 D’2 D’1’

v16

Figure 5.4 – Document flows of example B.

38

Thailand’s
Custom5.2. Experiment 1
the mathematical model shown in chapter 3.
Table 5.8 – A Mathematical model of example B
PB = (GB , DB , IB , QB , RB )GB = (VB , EB )VB = {v10 , v11 , v12 , v13 , v14 , v15 , v16 }EB = {(v10 , v11 ), (v10 , v12 ), (v10 , v13 ), (v10 , v14 ), (v10 , v15 ), (v15 , v16 )}DB = {D10 , D20 , D30 , D110 , D120 }
D10 = {i1 , i2 , i5 , i6 , i3 , i4 , i7 }D20 = {i5 , i6 , i3 , i4 , i8 }
D30 = {i9 , i10 , i11 , i12 , i13 , i8 , i14 }D110 = {i20 , i21 , i22 , i23 }D120 = {i24 , i25 , i26 , i14 }IB = {i1 , i2 , i5 , i6 , i3 , i4 , i7 , i8 , i9 , i10 , i11 , i12 , i13 , i14 , i20 , i21 , i22 , i23 , i24 ,
i25 , i26 }QB = {q10 , q11 , q12 , q13 , q14 , q15 , q16 }RB = {Rd10 , Rd20 , Rd30 , Rd110 , Rd120 }Rd10 = {(v10 , v11 ), (v10 , v12 ), (v10 , v15 ), (v15 , v16 )}Rd20 = {(v10 , v15 ), (v15 , v16 )}Rd30 = {(v10 , v11 ), (v10 , v12 ), (v10 , v15 ), (v15 , v16 )}Rd110 = {(v10 , v13 ), (v10 , v14 )}Rd120 = {(v10 , v13 ), (v10 , v14 )}(1) Converting document flows to information flows
Routes of information are generated from the routes of document shown in Fig. 5.4 byusing the equation (4.1) on page 22. The generated routes of information are shown in
Table 5.9.
Table 5.9 – Routes of information of example B
Ri1 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri2 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri3 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri4 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri5 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri6 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri7 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri8 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri9 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri10 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri11 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri12 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 )(v15 , v16 )}Ri13 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 )(v15 , v16 )}Ri14 = {(v10 , v11 ), (v10 , v13 ), (v10 , v13 ),(v10 , v14 )(v10 , v15 ), (v15 , v16 )}Ri20 = {(v10 , v13 ), (v10 , v14 )}Ri21 = {(v10 , v13 ), (v10 , v14 )}Ri22 = {(v10 , v13 ), (v10 , v14 )}Ri23 = {(v10 , v13 ), (v10 , v14 )}Ri24 = {(v10 , v13 ), (v10 , v14 )}Ri25 = {(v10 , v13 ), (v10 , v14 )}Ri26 = {(v10 , v13 ), (v10 , v14 )}(2) Reducing information flows
The generated information flows are reduced by using algorithm 1 as same as example
A. For example, Ri14 is reduced as followings:
39

Chapter 5. Experiments
line 1: deg+ (v2 ) = 1(> 0), deg+ (v3 ) = 1(> 0), deg+ (v4 ) = 1(> 0), deg+ (v5 ) = 1(> 0),
deg+ (v6 ) = 1(> 0), and deg+ (v7 ) = 1(> 0) so loop is continued.
line 2: v2 is selected which has maximum indegree (= 1).
line 3: Here only node v1 is connected with node v2 (deg− (v1 ) = 1). Thus, v1 isselected.
line 4: deg+ (v1 ) = 0, so loop is cancelled.
In this example, all nodes of Ri14 have indegree less than 1 (deg+ (v2 ) = 1(> 0),
deg+ (v3 ) = 1(> 0), deg+ (v4 ) = 1(> 0), deg+ (v5 ) = 1(> 0), deg+ (v6 ) = 1(> 0), anddeg+ (v7 ) = 1(> 0)) which means Ri14 have already reduced. In this way, all of the routes
of information are reduced as shown in Table 5.10.
Table 5.10 – Reduced information flows of example B
Ri1 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri2 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri3 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri4 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri5 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri6 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri7 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri8 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri9 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri10 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri11 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 ), (v15 , v16 )}Ri12 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 )(v15 , v16 )}i
R13 = {(v10 , v11 ), (v10 , v13 ), (v10 , v15 )(v15 , v16 )}Ri14 = {(v10 , v11 ), (v10 , v13 ), (v10 , v13 ),(v10 , v14 )(v10 , v15 ), (v15 , v16 )}Ri20 = {(v10 , v13 ), (v10 , v14 )}Ri21 = {(v10 , v13 ), (v10 , v14 )}Ri22 = {(v10 , v13 ), (v10 , v14 )}Ri23 = {(v10 , v13 ), (v10 , v14 )}Ri24 = {(v10 , v13 ), (v10 , v14 )}Ri25 = {(v10 , v13 ), (v10 , v14 )}Ri26 = {(v10 , v13 ), (v10 , v14 )}(3) Generating document flows from information flows
Document flows are generated from the reduced information flows by using algorithms
2 as same as example A. The two documents shown below are obtained.
(1) DG = {i1 , i2 , i3 , i4 , i5 , i6 , i7 , i8 , i9 , i10 , i11 , i12 , i13 , i14 },RdG = {(v10 , v11 ), (v10 , v12 ), (v10 , v15 ), (v10 , v16 )}(2) DH = {i14 , i20 , i21 , i22 , i23 , i24 , i25 , i26 }, RdH = {(v10 , v13 ), (v10 , v14 )}Figure 5.5 (A) shows the original document flows and Fig. 5.5 (B) shows the reduced
document flows.
Table 5.11 shows the numbers of information transmissions of current process andthe reduced process in example B by using the equation (5.1) on page 37. In the table,
number of information of a document, times of document transmission, and total
40

5.2. Experiment 1
(A)

v11
D’3

v12
D’3 D’1
D’12 D’11

v10
D’3

v13

D’12 D’11

D’2

v14

D’1

v15

v16

D’3 D’2 D’1’

v11

(B)

DG

v12
DG
DH

v10

v13

DH

v14

DG

v15

DG

v16

Figure 5.5 – Original and reduced document flows of example B.

number of transmission are shown. According to the table, the number of documents
decreases from five to two. Furthermore, the number of information transmissions is
also decreased from seventy-eight times to seventy times (10.3%).

5.2.3

Discussion

In this paper, the algorithms used in the supporting system for reducing document
flows in international trade transaction processes are proposed. First, a mathematicalmodel has been defined for describing document flows in international trade transaction processes. Then, two algorithms have been proposed base on the mathematicalmodel; one is reducing information flows, and the other is generating document flows
from information flows.
Two examples are shown to discuss the ability of the proposed model and algorithms.
The numbers of information transmissions are decreased one-hundred-two times toseventy-three times (28.4%) in example A and from seventy-eight times to seventy
times (10.3%) in example B, respectively. They seem that the the proposed algorithms
41

Chapter 5. Experiments
Table 5.11 – The numbers of information transmission of current process and the
reduced process in example B
Original process of example B

Reduced process of example B

Document

Number of
informations

Times of documenttransmission

Total number oftransmission

D’1

7

4

D’2

5

2

D’3

6

D’11
4
D’12
4
Total number of informationtransmissions of all documents

Document

Number of
informations

Times of documenttransmission

Total number oftransmission

28

DG

14

4

56

10

DH

7

2

14

Total number of informationtransmissions of all documents

70

4

24

2
2

8
8
78

contribute to reduce redundancies in the paperworks.
By using the proposed mathematical model, it is expected that different countries’
systems can be merged as one-system. For instance, process of example A (PA ) andexample process of example B (PB ) can be considered as a process from Lao PDR to
Malaysia via Thailand (PBA ) as shown below:
PBA = (GBA , DBA , IBA , QBA , RBA )GBA = (VB ∪ VA , EB ∪ EA )DBA = DB ∪ DA
RBA = RB ∪ RA
v1 ∈ VA and v15 ∈ VB are merged as v1 because they stand for the same organization.
v2 ∈ VA and v16 ∈ VB are merged as v2 because both of them stand for ‘Thailand’s
custom’. Figure 5.6 shows the merged processes.
Figure 5.7 shows the actual process of international trade transaction from Lao PDR to
Malaysia via Thailand (PL_Th_M ). Table 5.12 shows informations which are received byeach node. This table shows that all of the organizations in the merged process can
get the same informations with the actual process. However, the size of network of themerged process is larger than the size of network of the current process. In addition,
more numbers of informations are transmitted in the merged process. In Table 5.12,
the informations indicated by bold fonts are informations which are not transmitted
in the actual process. Optimizing methods should be considered in the future works.

5.3

Experiment 2

In this experiment, it is conducted for confirming the flexibility of the proposed system.
When reducing document flows, the requirements of system designers must be considered. For example, someone could want to reduce the number of documents in aprocess, and the other one could want to reduce the number of informations included
in a document. The proposed system can have several evaluations in accordance
425.3. Experiment 2
v11
DG

v12
DG
DH

v10

v13

v5

v2

DH
DG

DA
DB

v14

DA
DB
DF

DD

DG

v1

DA DB

v8

v3

DA
DA

DC

v4
DA
DC

v6
DA DE

v7

Figure 5.6 – Document flows of the merged process.
Table 5.12 – Information getten by each node
Node

Merged process

Actual prcess

v1

i1 , i2 , i5 , i6 , i7 , i3 , i4 , i8 ,
i9 , i10 , i11 , i12 , i13 , i14v2

i1 , i2 , i5 , i6 , i3 , i4 , i7 , i8 , i9 , i10 ,
i11 , i12 , i13 , i15 , i14

i1 , i2 , i5 , i6 , i3 , i4 , i8 , i7 , i9 , i10 ,
i11 , i12 , i13 , i14v3i1 , i2 , i5 , i6 , i3 , i4 , i7 , i9 , i10 , i11 ,
i12 , i13 , i15 , i14 , i16 , i17 , i18 , i19

i1 , i2 , i5 , i6 , i3 , i4 , i7 , i8 , i9 , i10 ,
i11 , i12 , i13 , i14v4i5 , i6 , i3 , i4 ,13 , i15v5i5 , i6 , i3 , i4 , i1 , i2 , i9 , i10 , i11 ,
i12 , i13 , i15 , i14 , i20 , i21 , i22 ,
i23 , i24 , i25 , i26 , i14v6i5 , i6 , i3 , i4 , i8 , i14v7i5 , i6 , i3 , i4 , i13 , i15v8i5 , i6 , i3 , i4i5 , i6 , i3 , i4 , i13 , i15

v10
v11

i1 , i2 , i5 , i6 , i7 , i3 , i4 , i8 , i9 , i10 ,
i11 , i12 , i13 , i14

i1 , i2 , i5 , i6 , i7 , i3 , i4 , i8 , i9 , i10 ,
i11 , i12 , i13 , i14v12

i1 , i2 , i5 , i6 , i7 , i3 , i4 , i8 , i9 , i10 ,
i11 , i12 , i13 , i14

i1 , i2 , i5 , i6 , i3 , i4 , i7 , i8 , i9 , i10 ,
i11 , i12 , i13 , i14v13i20 , i21 , i22 , i23 , i24 , i25 , i26 , i14

i20 , i21 , i22 , i23 , i24 , i25 , i26 , i14v14i20 , i21 , i22 , i23 , i24 , i25 , i26 , i14

i20 , i21 , i22 , i23 , i24 , i25 , i26 , i14

43Chapter 5. Experiments(A)

Exporter

Invoice
Packing list

Bank

Invoice
Packing list

Lao PDR’s
CustomPersonal passport
International transport permit

Lao PDR’s
Immigration

Personal passport
International transport permit
Bill of lading
Invoice
Packing list

Malaysia’s
Immigration
Malaysia’s
CustomCustom declaration

Importer

Invoice
Packing list

Thailand’s
CustomPersonal passport
International transport permit(B)

Thailand’s
Immigration

v11
D’1
D’3

v12

D’1

D’3

v13

D’12 D’11
D’12 D’11

v10
D’3

D’2

D’1

v3

D’3
D’12

v5
D8

v7

D’1

v2

D’11

v14

Figure 5.7 – Document flows of the actual process.

with the requirements of the system designers. In order to show the flexibility of the
proposed system, a result of experiment was shown. The evaluation functions in theexperiment, two types of the redundancy of paperwork processes are used as criteria; (1) redundancy of sharing information and (2) redundancy of using documents.
By using the functions, they have a trade-off relationship. Two different situationsof reducing redundancy in paperworks process are investigated; (1) designer placeemphasis on reducing informations in a document and (2) designer place emphasis
on reducing number of documents in the process.
A mechanism is proposed for generating document flows. This mechanism has several
evaluation functions, and can switch the function in accordance with the designers’ requirements. The proposed mechanism for generating document flows frominformation flows is shown below:
445.3. Experiment 2(1) Each information in the process is arranged on a document, that is the numberof documents become same as the number of informations in the process, androute of document is same as the route of information that is included in the
document.
(2) For all combinations of a pair of documents, the below sub procedure is conducted.
(2.1) Check if their routes have a common part. If they have, do (2.2).
(2.2) Calculate the evaluation value of the document flows when the two documents are merged.
(3) If there are one or more pairs of documents, merge a pair of documents as theevaluation value of the document flows become minimum, and repeat (2) and(3).
In the procedure, an evaluation function for calculating evaluation value is used. Thisevaluation function is selected based on the requirements of system designers. In the
proposed system, two types of redundancy of paperwork processes are considered;(1) redundancy of sharing informations and (2) redundancy of using documents. The
details are described in the next section.
(1) Redundancy of sharing informations
Each organization uses some documents. A document contains several informations.
All of them are not particularly used in all of the organization received the document.
These unused informations can be considered as redundant one for the organization.
To calculate the redundancy, the total number of required informations of all organizations and the total number of obtained information of all organizations are used. The
redundancy of sharing informations in document flows can be calculated as shown inequation (5.2).


f1 (PX ) = 



P

P

|qn |
qn QXPP

Da DX vn VX(vm ,vn )Rda

|Da,vn |

(5.2)

where,• PX : Process of paperworks in an international trade transaction named X• qn : A set of informations that required on node n• VX : A set of nodes which represent organizations in process X
45

Chapter 5. Experiments• vm : A source organization m• vn : A source organization n• Rda : A route of document a• DX : A set of documents used in process X• Da : A set of informations included in a document a(2) Redundancy of using documents in paperworks processes
The total number of documents in a paperworks process is used for representing theredundancy of using documents. The redundancy of using documents as shown inequation (5.3)

f2 (DX ) = |D1X |(5.3)

where,• DX : A set of documents that used in process X
Finally, the evaluation value of a paperworks process is calculated as shown in equation(5.4) .

F (PX ) = αf1 (PX ) + βf2 (DX )(5.4)

α and β are the weight to decide which redundancy should be focused on. The range
of weight α and β is between 0 to 1. The summation of three weights is 1(α + β = 1)
. For example, when the redundancy of sharing information is focused. The weight
can be set as α = 0.8 and β = 0.2. In order to identify the best trade-offs relationshipbetween each criterion, the weight can be changed in the evaluation function.

5.3.1

ExampleAn international trade transaction process is used for an example. This process has
seven organizations; (1) Buyer, (2) Seller, (3) Freight forwarder, (4) Custom broker ofdestination, (5) Custom of destination, (6) Custom broker of origin, and (7) Customsof origin. In this process, four types of informations are transmitted among the organizations. Table 5.13 and 5.14 show notations which represent organizations andinformations.
A process of generating document flows from information flows are shown below.
46

5.3. Experiment 2
Table 5.13 – Organizations
Organization

Notation

Buyer
SellerFreight forwarder
Custom broker of destination
Custom of destination
Custom broker of original
Custom of original

v1
v2
v3
v4
v5
v6
v7

Table 5.14 – Information of the experiment
Information

Notation

Seller name
Purchase order number
Bill of lading number
Gross weight

ia
ib
ic
id

(1) Four documents which included one information are created; Da (includes information a, the route is Rda ), Db (includes information b, the route is Rdb ), Dc(includes information c, the route is Rdc ), and Dd (includes information d, theroute is Rdd ). Figure 5.8 shows the initial document flows. Figure 5.8 (A) shows
the route of document a, Fig. 5.8 (B) shows the route of document b, Fig. 5.8 (C)shows the route of document c, and Fig. 5.8 (D) shows the route of document d,respectively.
v1
v2

v4

v5

v3
v6

v1

v4

v2

v2
v7

v6

(A) Route of document a

v1

v5

v7

(B) Route of document b

v4

v3
v6

v5

v1

v4

v6

v7

v5

v2
v7

(C) Route of document c(D) Route of document d

Figure 5.8 – Initial document flows of the example.
(2) Six pairs of documents are found; pair of a − b, a − c, a − d, b − c, b − d, and c − d.
(2.1) Rad and Rdb , Rad and Rdc , Rda and Rdd , Rdb and Rdc , Rdb and Rdd , and Rdc and Rdd havea common paths.
(2.2) The evaluation values when the above pairs are merged are calculated (α =0.8, β = 0.2). The results are shown below table:(3) The pair of Rdc and Rdd has the maximum evaluation value. Thus, the Dc and Dd
47

Chapter 5. Experiments
Table 5.15 – Merged pair and evaluation values
Merged pair

Evaluation values

Rda and Rdb
Rda and Rdc
Rda and Rdd
Rdb and Rdc
Rdb and Rdd
Rdc and Rdd

0.631
0.657
0.633
0.631
0.631
0.684

are merged. Now, there are three documents, D<c,d> , Da , and Db , then go to thestep (3). The step (2) and (3) are repeated until cannot find the maximum of
the evaluation value of the merged document. Other evaluation functions arecalculated in the same way.

5.3.2

Results

In this section, results of an experiment which was conducted for evaluating the
proposed mechanism are shown. The initial document flows, which shown in Fig. 5.8
were used for the experiment. The experiment is conducted under two conditions asshown in Table 5.16.
Table 5.16 – Weights of the conditions
Conditions

Weights12

α = 0.8, β = 0.2
α = 0.2, β = 0.8

We can consider the experiments under these conditions as situations:• Situation 1: The designer place emphasis on reducing informations in a document.
• Situation 2: The designer place emphasis on reducing number of documents inthe process.
These two situations have a trade-off relationship. If we want to minimize the numberof informations included in a document thus the number of documents should be
increased. On the other hand, if we want to minimize the number of documents in apaperworks process thus the number of informations included in a document should
be decreased. Thus, different answer must be obtained under these conditions. By
following the proposed method, two document flows are generated; (1) Document
flow A (under condition 1), (2) Document flow B (under condition 2), as shown in Fig.
5.9. Document flow A included three documents; D<c−d> , Da , and Db . Document flow48

5.3. Experiment 2
B included two documents; D<a−c−d> and Db .
Condition 1

v1

v4

v5

v3

v2

v6

v1
v2

v7

v5

v3
v6

(A) Route of document c-d

v4

v1

v4

v5

v3

v2
v7

v6

v7

(B) Route of document b(B) Route of document a

Condition 2

v1
v2

v4

v2

v3
v6

v1

v5

(A) Route of document a-c-d

v5

v3
v6

v7

v4

v7

(B) Route of document b

Figure 5.9 – Generating document flows of the example.
Table 5.17 shows a summary of the results. In the table, the second column shows thereturn value of f1 (redundancies of sharing informations), the third column shows thereturn value of f2 (redundancies of using documents), and the last column shows theevaluation values (F ), respectively.
Table 5.17 – Results of the experimentDocument flow

Redundancies ofsharing informations(f1 )Redundancies ofusing documents(f2 )Evaluation values (F )A (Condition 1)
B (Condition 2)

0.773
0.708

0.333
0.500

0.684
0.542

As we can see from the table, under condition 1, Document flow A is better than
Document flow B from aspect of redundancies of sharing informations (0.773 > 0.708).
Under the condition 2, Document flow B is better than Document flow A from aspectof redundancies of using documents (0.500 > 0.333). From the aspect of the evaluation
value, Document flow A is better than Document flow B.
These results confirm that we can adjust the weights of the evaluation function as acondition for generating document flows in accordance with the designers’ requirements. Moreover, by arranging informations into a document, they seem that the
proposed mechanism can re-design document format.
49

Chapter 5. Experiments

5.3.3

Discussion

In this section, a new mechanism for optimizing paperworks is proposed. The mechanism can have several evaluations in accordance with the requirements of the systemdesigners. In order to show the usages of proposed mechanism, a result of experiment
was shown. The evaluation functions in the experiment, two types of the redundancyof paperwork processes are used as criteria; (1) redundancy of sharing informationand (2) redundancy of using documents. By using the functions, they have a trade-off
relationship. As a result, the best document flows were generated in accordance withthe requirements of system designers. A simple example is shown which have only
two sub-evaluation values. However, in actual situations, we have to consider more
complex situations that have more compositive requirements and documents. We
have to confirm that the proposed mechanism works well in such complex situation in
the future.

5.4

Conclusion

In this chapter, two experiments are conducted for investigating the performance ofthe proposed system. Examples of international trade transaction processes in ASEAN
are shown to discuss the abilities of the proposed system. In the first experiment, thetotal number of information transmissions is compared between original processes
and the reduced processes.
In the second experiment, a new mechanism for optimizing paperworks is proposed
for generating document flows. The mechanism can have several evaluations in accordance with the requirements of the system designers. In the function, two types of theredundancy of paperwork processes are used as criteria. By changing the value of theweights in the function, the redundancy of paperwork process can be estimated fromthe two perspectives of (1) redundancy of sharing information and (2) redundancy ofusing documents in paperwork processes.

50

6 Conclusions and Future directions

6.1

Conclusions

In this paper, international trade transaction processes can be considered as systems
consisting of sub-systems designed by each country for international trades. Eachsub-system has designed based on their own concept, and it makes the whole-systemcomplex. Thus, international trade transaction processes can be shown as networks.
A supporting system for improving efficiency of paperworks in international tradetransaction processes has been proposed. This system consists of three modules; (1)converting document flows to information flows, (2) reducing information flows, and(3) generating document flows from information flows. Graph theory is adopted torepresent international trade transaction processes. Besides, set theory is introduced
to describe documents and informations.
To investigate the performances of the proposed system, two experiments are conducted. Two points of view are considered; (1) reducing redundancy of paperworks and(2) flexibility of the proposed system. The first experiment is conducted for validating
the proposed system can be applied in an actual situation and confirming the proposedsystem can be reducing the redundancy of paperworks processes. Document flows
and information flows in the trade transaction processes can represent as a common
structure by using the mathematical model. Algorithms for reducing redundancy of
paperworks processes are proposed by using the mathematical model. As a result,
the total number of information transmissions is reduced. The second experiment isconducting for confirming the proposed system. The system can provide a suitable
paperworks process for various evaluation criteria.

51

Chapter 6. Conclusions and Future directions

6.2

Directions for future works

Algorithms for reducing redundancy of paperworks processes are proposed basedon reducing redundancy of information flows. From the results of reducing redundancy, redundancy of information flows are eliminated and new document flows are
generated. However, synchronizations of procedures and management of access to
informations are also important elements in an actual situation. Therefore, theses
elements are expected in the future.
Beside, in the proposed mechanism for optimizing paperworks, they have several evaluations in accordance with the requirements of the system designers. The evaluation
functions in the second experiment, two types of the redundancy of paperwork processes are used as criteria; (1) redundancy of sharing information and (2) redundancy
of using documents. In the experiment, a simple example is shown which have only
two sub-evaluation values. However, in actual situations, we have to consider more
complex situations that have more compositive requirements and documents. We
have to confirm that the proposed mechanism works well in such complex situation in
the future. By tackling this problem, LISP processor is considered for implementing
the proposed mechanism in the future.

52

Bibliography[1] M. E. Civelek and N. Seçkin, “Paperless trade evaluation of the current situation &towards the integrated single foreign trade document,” Journal of Management
Research, vol. 9, no. 2, 2017.
[2] D. Business, “Training for reform, a world bank group flagship report,” 2019.
[3] K. Statistics, “Trends in international trade,” UNCTAD.–2019. URL: https://unctad.
org/en/PublicationsLibrary/ditctab2019d2_en. pdf, 2015.
[4] D. Business, 2013.
[5] R. Banomyong, “Benchmarking economic corridors logistics performance: a gms
border crossing observation,” World Customs Journal, vol. 4, no. 1, pp. 29–38,
2010.
[6] D. Business, 2017.
[7] J. Goldstein, V. Mittal, J. Carbonell, and M. Kantrowitz, “Multi-document summarization by sentence extraction,” in Proceedings of the 2000 NAACL-ANLP Workshop on Automatic summarization, pp. 40–48, Association for Computational
Linguistics, 2000.
[8] S. Talluri, “An it/is acquisition and justification model for supply-chain management,” International Journal of Physical Distribution & Logistics Management,
2000.
[9] P. Kouvelis and M. J. Rosenblatt, “A mathematical programming model for global
supply chain management: Conceptual approach and managerial insights,” inSupply chain management: Models, applications, and research directions, pp. 245–
277, Springer, 2002.
[10] B. Babatunde, “Application of multi-objective mathematical linear programming53

Bibliographymodel for supply chain management in a fussy environment,” International
Journal of Applied Engineering Research, vol. 1, no. 3, p. 615, 2010.
[11] C.-H. Lan, H.-M. Chen, C.-W. Chiu, and M.-H. Chen, “A complicated continuous
model of supply chain,” Journal of Applied Science and Engineering, vol. 15, no. 2,
pp. 177–186, 2012.
[12] J. K. Jolayemi, “Optimum production-distribution and transportation planning inthree-stage supply chains,” International Journal of Business and Management,
vol. 5, no. 12, p. 29, 2010.
[13] S. K. Yung and C. C. Yang, “Intelligent multi-agents for supply chain management,”
in IEEE SMC’99 Conference Proceedings. 1999 IEEE International Conference on
Systems, Man, and Cybernetics (Cat. No. 99CH37028), vol. 2, pp. 528–533, IEEE,
1999.
[14] R.-C. Wang and T.-F. Liang, “Application of fuzzy multi-objective linear programming to aggregate production planning,” Computers & Industrial Engineering,
vol. 46, no. 1, pp. 17–41, 2004.
[15] R. Dewan, A. Seidmann, and Z. Walter, “Workflow optimization through task
redesign in business information processes,” in Proceedings of the Thirty-First
Hawaii International Conference on System Sciences, vol. 1, pp. 240–252, IEEE,
1998.
[16] T. Nonaka, “Workflow process consolidation,” Nov. 4 2014. US Patent 8,880,418.
[17] G. Fridgen, S. Radszuwill, N. Urbach, and L. Utz, “Cross-organizational workflow
management using blockchain technology-towards applicability, auditability, andautomation,” in Proceedings of the 51st Hawaii International Conference on System
Sciences, 2018.
[18] S.-D. Orantes-Jimenez, A. Zavala-Galindo, and G. Vazquez-Alvarez, “Paperlessoffice: a new proposal for organizations,” Systemics, Cybernetics and Informatics,
vol. 13, no. 3, pp. 47–55, 2015.
[19] K. Ponanan, T. Srichanthamit, W. C. Watanabe, S. Watanabe, and H. Suto, “A
framework of supporting system for optimizing information flow in international
trade transaction,” Transactions of Japan Society of Kansei Engineering, vol. 18,
no. 1, pp. 95–104, 2019.
[20] S. Shirinivas, S. Vetrivel, and N. Elango, “Applications of graph theory in computerscience an overview,” International journal of engineering science and technology,
vol. 2, no. 9, pp. 4610–4621, 2010.

54

Bibliography[21] J. A. Bondy, U. S. R. Murty, et al., Graph theory with applications, vol. 290. Macmillan London, 1976.
[22] V. Kaibel and M. Peinhardt, “On the bottleneck shortest path problem,” 2006.
[23] K. Pardeep, “Cardinality based approach for reliability redundancy optimizationof flow networks,” Reliability: Theory & Applications, vol. 7, no. 4 (27), 2012.
[24] L. R. Ford Jr and D. R. Fulkerson, Flows in networks, vol. 54. Princeton university
press, 2015.
[25] S. Bordoloi and B. Kalita, “Designing graph database models from existing relational databases,” International Journal of Computer Applications, vol. 74, no. 1,
2013.
[26] T. B. Adji, N. A. Setiawan, et al., “Enhanced graph transforming algorithm to solve
transitive dependency between vertices,” in 2017 International Conference on
Signals and Systems (ICSigSys), pp. 250–255, IEEE, 2017.
[27] P. Zhao and J. Han, “On graph query optimization in large networks,” Proceedingsof the VLDB Endowment, vol. 3, no. 1-2, pp. 340–351, 2010.
[28] Y. Wang, X. Ni, J.-T. Sun, Y. Tong, and Z. Chen, “Representing document as dependency graph for document clustering,” in Proceedings of the 20th ACM international conference on Information and knowledge management, pp. 2177–2180,
2011.
[29] M. Rafi, F. Amin, and M. S. Shaikh, “Document clustering using graph based
document representation with constraints,” arXiv preprint arXiv:1412.1888, 2014.

55

Publications

Journals• Klairung PONANAN, Tanapun SRICHANTHAMIT, Woramol Chaowarat WATANABE, Shinya WATANABE, and Hidetsugu SUTO. A Framework of Supporting System for Optimizing Information Flow in International Trade Transaction. Journalof Transactions of Japan Society of Kansei Engineering, 18(1): 95-104, 2019.
• Tanapun SRICHANTHAMIT and Hidetsugu Suto. A mathematical model for aframework of a supporting system for international trade transaction. Journal ofComputational and Applied Mathematics, 375, 2020.

International conference• Tanapun SRICHANTHAMIT and Hidetsugu Suto. A Mathematical model fora Framework of Supporting System for International Trade Transaction. International Conference on Innovative Computing and Management Science (ICMS
2019), 2019.

Japanese symposium• Tanapun SRICHANTHAMIT and Hidetsugu Suto. A study of framework for representing the relationship between information flow and document flow, 生命ソ
フトウェア・感性工房・而立の会 合同シンポジウム2018, 2018.

57