Presentation 2022-01-22
A study on performance of local search methods for Electric Vehicle Routing Problem with Time Windows
Jun Adachi, Takafumi Matsuura, Takayuki Kimura,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The rapid increase of delivery goods and shortage of drivers causes the construction of efficient delivery routes that minimize vehicle usage and their total distance in the transportation companies. Furthermore, using electric vehicles that reduce CO2 emissions enables us to make future echo society. From these viewpoints, recent studies on solving vehicle routing problems used electric vehicles, constructing the electric vehicle routing problems with time windows. As a solving method for the electric vehicle routing problems with time windows, Adaptive Large Neighborhood Search(ALNS) that probabilistically uses several local search methods has been proposed. ALNS algorithm assigns a score to each local method and selects one of these local methods by using preferential probability based on improving rates of the current solution and scores. In this work, we analyze the time-series of these scores, and we used the approximated values of scores instead of original ones. Numerical simulations then illustrate that the searching process and the computational complexity are reduced using the approximated functions.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Electric Vehicle Routing Problems with Time Window / Combinatorial optimization problems / Metaheuristics
Paper # NLP2021-104,MICT2021-79,MBE2021-65
Date of Issue 2022-01-14 (NLP, MICT, MBE)

Conference Information
Committee NLP / MICT / MBE / NC
Conference Date 2022/1/21(3days)
Place (in Japanese) (See Japanese page)
Place (in English) Online
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Takuji Kosaka(Chukyo Univ.) / Eisuke Hanada(Saga Univ.) / Ryuhei Okuno(Setsunan Univ.) / Rieko Osu(Waseda Univ.)
Vice Chair Akio Tsuneda(Kumamoto Univ.) / Hirokazu Tanaka(Hiroshima City Univ.) / Daisuke Anzai(Nagoya Inst. of Tech.) / Junichi Hori(Niigata Univ.) / Hiroshi Yamakawa(Univ of Tokyo)
Secretary Akio Tsuneda(Kagawa Univ.) / Hirokazu Tanaka(Sojo Univ.) / Daisuke Anzai(Yokohama National Univ.) / Junichi Hori(KISTEC) / Hiroshi Yamakawa(Osaka Electro-Communication Univ)
Assistant Hideyuki Kato(Oita Univ.) / Yuichi Yokoi(Nagasaki Univ.) / Takahiro Ito(Hiroshima City Univ) / Kento Takabayashi(Okayama Pref. Univ.) / Takuya Nishikawa(National Cerebral and Cardiovascular Center Hospital) / Jun Akazawa(Meiji Univ. of Integrative Medicine) / Emi Yuda(Tohoku Univ) / Nobuhiko Wagatsuma(Toho Univ.) / Tomoki Kurikawa(KMU)

Paper Information
Registration To Technical Committee on Nonlinear Problems / Technical Committee on Healthcare and Medical Information Communication Technology / Technical Committee on ME and Bio Cybernetics / Technical Committee on Neurocomputing
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A study on performance of local search methods for Electric Vehicle Routing Problem with Time Windows
Sub Title (in English)
Keyword(1) Electric Vehicle Routing Problems with Time Window
Keyword(2) Combinatorial optimization problems
Keyword(3) Metaheuristics
1st Author's Name Jun Adachi
1st Author's Affiliation Nippon Institute of Technology(NIT)
2nd Author's Name Takafumi Matsuura
2nd Author's Affiliation Nippon Institute of Technology(NIT)
3rd Author's Name Takayuki Kimura
3rd Author's Affiliation Nippon Institute of Technology(NIT)
Date 2022-01-22
Paper # NLP2021-104,MICT2021-79,MBE2021-65
Volume (vol) vol.121
Number (no) NLP-335,MICT-336,MBE-337
Page pp.pp.143-148(NLP), pp.143-148(MICT), pp.143-148(MBE),
#Pages 6
Date of Issue 2022-01-14 (NLP, MICT, MBE)