Ichiro Satoh

Program Analysis-based Approach for Cooperative Logistics Ichiro Satoh National Institute of Informatics Tokyo

National Institute of Informatics ,[object Object],[object Object],[object Object],[object Object],NII The Imperial Palace Tokyo Station NII is 1.5km-near from Tokyo Station 1.5km NII

ICPS’2009 ,[object Object],[object Object]

Background ,[object Object],[object Object],[object Object],[object Object],[object Object]

Cooperative Logistics ,[object Object],[object Object],[object Object],[object Object],[object Object]

Example: Milk-run Operation ,[object Object],[object Object],[object Object],[object Object],Loading rates tend to be low.

Logistic Truck Routes as Program Control-Flow ,[object Object],[object Object],To treat truck routes as program control flow, we propose a programming language for specifying these routes. Program The flow of program execution The routes of trucks Program ? start { .... if (condition) { ... while(condition) { ... } switch(condition) { case 1: { ... } case 2: { ... } case 3: { ... } } } else { ... } ... } Correlation

[object Object],[object Object],[object Object],Design of Specification Language E ::= 0 (termination) | location (migration) 　　 | E 1  E 2 (sequential migration) 　　 | E 1  E 2 (selective migration) | E 1  E 2 (parallel migration) 　　 | E 1  E 2 (possible migration) | E 1  E 2 (commutable migration) | E* (arbitrary migration) for the routes of trucks. for the requirement of trucks.

Specification Example Truck 1 Destination G Truck １： A[9:00,9:05] ; B[9:20,9:35] ; C[9:30,9:35] ; F[9:50,9:55] 　 Destination A Destination B Destination C Destination D Arrival ： 9:50 〜 9:55 Truck 2 Collection/Delivering Center Arrival ： 10:10 〜 10:15 Destination I Destination H Arrival ： 9:00 〜 9:05 Arrival ： 9:20 〜 9:25 Arrival ： 9:30 〜 9:35 Arrival ： 9:50 〜 9:55 Arrival ： 9:30 〜 9:35 Arrival ： 10:40 〜 10:45 Destination E Arrival ： 10:30 〜 10:35 Arrival ： 10:50 〜 10:55 Arrival ： 11:10 〜 11:15 Arrival ： 11:00 〜 11:05 Arrival ： 11:20 〜 11:25 Departure ： 10:10 〜 10:15 Truck 3 Truck 2 ： D[9:30,9:35] ; E[9:50,9:55] ; F[10:10,10:15] ; H[10:40,10:45] ; I[11:00,11:05] Truck 3 ： F[10:10,10:15] ; G[10:30,10:35] ; I[10:50,10:55] ; F[11:20,11:25] (A[9:00,9:05];B[9:20,9:35];C[9:30,9:35];F[9:50,9:55]) || ( D[9:30,9:35] ; E[9:50,9:55] ; F[10:10,10:15] ; H[10:40,10:45] ; I[11:00,11:05]) || (F[10:10,10:15] ; G[10:30,10:35] ; I[10:50,10:55] ; F[11:20,11:25])

Reduction of CO2-Emission by using Program Analysis and Optimization ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Algebraic Order Relation ,[object Object]

Selection of Earth-friendly Trucks Dest. A needs items to Dest. B and C and picks items from Dest. D. Specification ：　 (A ; (B%C)) & (D ; A) Dest. A Dest. B Dest. D Dest. C Dest. A Dest. B Dest. D Dest. C Dest. A Dest. B Dest. D Dest. C Dest. A Dest. B Dest. D Dest. C Dest. A Dest. B Dest. D Dest. C Dest. A Dest. B Dest. D Dest. C A;B;C;D;A A;B;A;C;A;D;A A;B;C;A;D A;D;B;C;A A;D;C;A;B A;B;A;D;C Truck 1 Truck 3 Truck 2 Truck 4 Truck 5 Truck 6

Current Project: Food Transportation ,[object Object],Factory E (Sushi) Factory D (Sandwich) Factory C (Bento) Factory A (Bread) Factory B (Onigiri) Super-market’s distribution center F A B C D E F A B C D E F A B C D E F Truck 1 Truck 2 Truck 3 Collection of foods ? The term of eatability Long Short Bread 　 < Bento&Onigiri < Sandwich < Sushi The arrival orders of trucks at factories are important, when factories may exchange their products with other factories. ,[object Object]

[object Object],[object Object],Route Optimization by using Code Optimization Optimization Reduction of 　 redundant route A B C A A A B A C A B A C + B C A C B A or Optimization Serialization

Application by Mizuho Bank ,[object Object],[object Object],[object Object],[object Object]

Implementation ,[object Object],Route ：　 A; B; D; C; E; F Route ：　 A; C; B; D; E; F Route ：　 A; B; F; C; D; E; F A B C D E F Truck 2 A B C D E F Truck 1 Requirements: 　 A; (B%C); D; E; F A B C D E F Truck 3 (1) Route registration (2) Query with requirements (7) Recommendation on a truck Requirements maintained in RFID tags Database Server Carriers Customer/supplier Customer/supplier tag RFID tag RFID tag readers 端末 Item Item Info. distance A B F C D E F A C B D E F A B D C E F Route selection engine Truck 1 Truck 2 Truck 3 A; (B%C); D; E; F A C D E F B D E F C B 木の高さ移動回数・距離に対応 (3) Transformation to trees (4) matching tree structure (5) Selecting trucks (6) Selecting the most efficient truck Truck 2 Cost: shorter than 1s where 40 trucks whose visit 10 places A; C; B; D; E; F  A; (B%C); D; E; F Trucks themselves do not need any special equipments.

Conclusion ,[object Object],[object Object],[object Object],from our experiments with Japan Institute of Logistic System (JILS), which is the biggest logistic industry society.

Ichiro Satoh

Empfohlen

Empfohlen

Weitere ähnliche Inhalte

Was ist angesagt?

Was ist angesagt? (20)

Andere mochten auch

Andere mochten auch (6)

Ähnlich wie Ichiro Satoh

Ähnlich wie Ichiro Satoh (20)

Ichiro Satoh