ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

A hybrid metaheuristic algorithm for the green vehicle routing problem with a heterogeneous fleet

Ene, Seval; Kucukoglu, Ilker; Aksoy, Asli; Ozturk, Nursel
INTERNATIONAL JOURNAL OF VEHICLE DESIGN2016DOI: 10.1504/IJVD.2016.078771
16被引2阅读
引用收藏
分享

摘要

In this study, the green vehicle routing problem (GVRP) with a heterogeneous fleet is presented for both capacity and time-windows constraints to reduce fuel consumption and consequently to minimise CO2 emissions. A hybrid metaheuristic algorithm (HMA) is developed to solve this problem to analyse the effect of a heterogeneous fleet on reducing the fuel consumption for the specified variants of GVRP, such as GVRP with capacity constraints and GVRP with time-windows constraints. The proposed HMA is validated using well-known instances with different numbers of customers and fleet configurations. The computational results indicated that the HMA is capable of obtaining good results for GVRP variants within a reasonable amount of time by providing remarkable reductions in fuel consumption and greener fleet configurations.

学科与关键词

关键词
green vehicle routingheterogeneous fleetfuel consumptionHMAhybrid metaheuristic algorithmtabu searchsimulated annealing
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
INTERNATIONAL JOURNAL OF VEHICLE DESIGN
发表日期
2016
卷期
第 71 卷, 第 1-4 期
页码
75-102
DOI
10.1504/IJVD.2016.078771
语言
MULTI-LANGUAGE
成果收录
SCIE
资助标注
Commission of Scientific Research Projects of Uludag University [KUAP(M)-2012/53]

作者

  • E

    Ene, Seval (第一作者)

  • K

    Kucukoglu, Ilker

查看全部 4 位作者收起作者
  • A

    Aksoy, Asli

  • O

    Ozturk, Nursel

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417