IDEAS home Printed from https://ideas.repec.org/a/igg/jisscm/v12y2019i4p27-41.html
   My bibliography  Save this article

Energy-Efficient Green Vehicle Routing Problem

Author

Listed:
  • A. Sruthi

    (Department of Mechanical Engineering, Amrita School of Engineering, Coimbatore, India)

  • S.P. Anbuudayasankar

    (Department of Mechanical Engineering, Amrita School of Engineering, Coimbatore, India)

  • G. Jeyakumar

    (Department of Computer Science and Engineering, Amrita School of Engineering, Coimbatore, India)

Abstract

The greenhouse gas emissions from the transportation sector are one of the major contributors to global warming today. Freight share to GHG emissions is likely to increase 2-fold by 2050. This makes it critical for CO2 emissions to be reduced through an optimized transportation strategy. Vehicle routing, when done efficiently, can reduce these emissions across countries. In this attempt, the traditional distance minimization objective of the vehicle routing problem has been replaced with an energy-emission-centric objective. A model is formulated taking energy and emissions into simultaneous consideration and a typical VRP problem has been evaluated using a genetic algorithm. The application of the proposed model is observed to reduce emissions significantly compared to conventional models. Considering the possibility of increase in carbon tax in future, energy-emission minimized routing would not only aid “green logistics,” but also reduce the environmental costs incurred.

Suggested Citation

  • A. Sruthi & S.P. Anbuudayasankar & G. Jeyakumar, 2019. "Energy-Efficient Green Vehicle Routing Problem," International Journal of Information Systems and Supply Chain Management (IJISSCM), IGI Global, vol. 12(4), pages 27-41, October.
    • Handle: RePEc:igg:jisscm:v:12:y:2019:i:4:p:27-41
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISSCM.2019100102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jisscm:v:12:y:2019:i:4:p:27-41. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.