Optimum Criterion of the Vehicle Navigation for Saving the Fuel Consumption by Tabu Search Algorithm with Non Dominated Technique

Jetsada Meeruang, T. Dolwichai
{"title":"Optimum Criterion of the Vehicle Navigation for Saving the Fuel Consumption by Tabu Search Algorithm with Non Dominated Technique","authors":"Jetsada Meeruang, T. Dolwichai","doi":"10.1109/CICN.2016.103","DOIUrl":null,"url":null,"abstract":"Vehicle navigation now a day, it has used the navigation devices for guided the user to get the destination point. The requirement of the user in general must be arrived by the right destination. In usual work of navigation system, it directed the path with shortest path, by did not calculate the time consuming as the traffic condition. Which effect to fuel consumption of the vehicle. The vehicle fuel consumption for running in the city has known as high because of it almost run on low load which the engine must be consumed more fuel. If the navigation system can be directed the path with short time or short distance, the vehicle can be saved the fuel. According to the navigation system, it is the optimization problem with 2 objectives, minimization of the time and the distance. Tabu search algorithm (TS) is used for this work. It efficient for working with the multi variables and unequal variable for each navigation. The navigation examples are simulated with 4x4, 5x5 and 6x6 grid path. All of the path are assigned the traffic condition by using the level of service (LOS) which shown the ratio between volume and road capacity. The optimum solution path can be shown as the Pareto frontier. It can be used for alternating choice of the path in navigation system. The minimum time criterion is effective in decreasing of specific fuel consumption (sfc) than the distance criterion with the percentage of 5.54%.","PeriodicalId":189849,"journal":{"name":"2016 8th International Conference on Computational Intelligence and Communication Networks (CICN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th International Conference on Computational Intelligence and Communication Networks (CICN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICN.2016.103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Vehicle navigation now a day, it has used the navigation devices for guided the user to get the destination point. The requirement of the user in general must be arrived by the right destination. In usual work of navigation system, it directed the path with shortest path, by did not calculate the time consuming as the traffic condition. Which effect to fuel consumption of the vehicle. The vehicle fuel consumption for running in the city has known as high because of it almost run on low load which the engine must be consumed more fuel. If the navigation system can be directed the path with short time or short distance, the vehicle can be saved the fuel. According to the navigation system, it is the optimization problem with 2 objectives, minimization of the time and the distance. Tabu search algorithm (TS) is used for this work. It efficient for working with the multi variables and unequal variable for each navigation. The navigation examples are simulated with 4x4, 5x5 and 6x6 grid path. All of the path are assigned the traffic condition by using the level of service (LOS) which shown the ratio between volume and road capacity. The optimum solution path can be shown as the Pareto frontier. It can be used for alternating choice of the path in navigation system. The minimum time criterion is effective in decreasing of specific fuel consumption (sfc) than the distance criterion with the percentage of 5.54%.
基于非支配技术禁忌搜索算法的车辆导航节能优化准则
车辆导航现在已经有一天了,它已经利用导航装置来引导用户到达目的地。一般来说,用户的需求必须通过正确的目的地到达。在通常的导航系统工作中,它以最短路径为导向,而不将耗时作为交通条件来计算。这对车辆的燃油消耗有影响。众所周知,在城市中行驶的汽车燃油消耗量高,因为它几乎是低负荷运行,发动机必须消耗更多的燃料。如果导航系统能够在短时间或短距离内引导车辆的路径,则可以节省车辆的燃料。根据导航系统,这是一个具有2个目标的优化问题,即时间和距离的最小化。这项工作使用禁忌搜索算法(TS)。对于每次导航的多变量和不等变量的处理是有效的。导航示例采用4x4、5x5和6x6网格路径进行模拟。所有的路径都是通过使用服务水平(LOS)来分配交通状况的,服务水平(LOS)显示了交通量与道路容量之间的比率。最优解路径可表示为帕累托边界。它可用于导航系统中路径的交替选择。最小时间准则比距离准则更能有效地降低比油耗(sfc),降低率为5.54%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信