1 / 11

A Research of a R eal- W orld V ehicle R outing P roblem using

A Research of a R eal- W orld V ehicle R outing P roblem using E volutionary C omputation A pproach. Dr. Fangyan Dong （董　芳艶（博士（工学）） Tokyo Tech Postdoctral Fellow （東工大特別研究員） Hirota Lab. 7. 3. 2. 8. 5. 4. 9. 4. 5. 6. 3. 4. 6. 3. 1. 3. 2. 2. goods. ・・・. User.

ossie
Download Presentation

A Research of a R eal- W orld V ehicle R outing P roblem using

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Research of a Real-World Vehicle Routing Problem using Evolutionary Computation Approach Dr. Fangyan Dong （董　芳艶（博士（工学）） Tokyo Tech Postdoctral Fellow（東工大特別研究員） Hirota Lab

  2. 7 3 2 8 5 4 9 4 5 6 3 4 6 3 1 3 2 2 goods ・・・ User User order Route What is the VRP/SD problem? Depot e.g. Vehicle Capacity = 12,10

  3. 8 5 7 9 4 Problems !! Low loading rate Bad working balance High Cost Empty! 6 2 1 3 Depot Conventional method VRP/SD in Real World Problems !! Traffic jam Traffic accident Air pollution Noise Increase of vehicles

  4. Sequence of visited users V1 2 7 6 5 14 ・・・ V2 10 8 4 17 20 ・・・ vehicle V3 11 1 9 12 16 ・・・ ・・・ 　・・・・・・ VL 3 13 15 19 18 ・・・ The Evolutionary Computation Strategy • Chromosome = Trip • Basic idea : Operation for users groups • ( Igarashi [’95] : for single user ) ■Move-Crossover Operator • ■Exchange-Crossover Operator • ■Fast convergence

  5. rice ball depot : Road : Convenience store : Cross road Experimental Settings • Real world daily food • delivery problem • Saitama pref. Japan • 1 depot, • 46 convenience stores • Experiment 1 • Trucks: 4-ton×3 • Experiment 2 • Trucks : • 2-ton×2 and 4-ton×2 Depot

  6. 01 depot Experiment 1 :Optimal Route of truck 4T-01 10 14 23 25 26 28 29 36 37 39 40 41 42 43 44 45 46

  7. 02 depot Experiment 1 :Optimal Route of truck 4T-02 8 11 15 17 19 21 27 30 31 33 32 34 35 38

  8. Exp2:Comparison with conventional method 4-ton×2 2-ton×2

  9. Experiment 2 :Optimal Route of truck 4T-01 01 depot 18 19 28 33 32 36 38 41 42 43 44 45 46

  10. Experiment 2 :Optimal Route of truck 4T-02 02 depot 5 6 11 15 16 17 21 22 26 29 30 31 34 35 37 39 40

  11. Experiment 2 :Optimal Route of truck 2T-02 02 depot 1 2 9 10 12 14 25

More Related