IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v13y2019i4p507-535.html
   My bibliography  Save this article

A green vehicle routing problem with time windows considering the heterogeneous fleet of vehicles: two metaheuristic algorithms

Author

Listed:
  • Neda Rezaei
  • Sadoullah Ebrahimnejad
  • Amirhossein Moosavi
  • Adel Nikfarjam

Abstract

In this paper, the green vehicle routing problem with time windows constraint is studied in the presence of a heterogeneous fleet of vehicles and filling stations. In addition, the number of vehicles and their fuel tank capacity are both limited. The main contribution of this study is the simultaneous consideration of these features, which makes the problem more practical. For this purpose, a mixed integer linear programming model that minimises the transportation costs and (or carbon dioxide) emissions, is proposed. Furthermore, a genetic algorithm and a population-based simulated annealing are developed to find high-quality solutions for large-scale instances. To validate the proposed model and algorithms, 28 instances are generated using a benchmark database. The computational results demonstrate that both algorithms provide efficient solutions regarding the objective function value and CPU time. Finally, a comprehensive sensitivity analysis is carried out to show the importance of features mentioned above. [Received: 7 October 2016; Revised: 27 December 2018; Accepted: 13 January 2019]

Suggested Citation

  • Neda Rezaei & Sadoullah Ebrahimnejad & Amirhossein Moosavi & Adel Nikfarjam, 2019. "A green vehicle routing problem with time windows considering the heterogeneous fleet of vehicles: two metaheuristic algorithms," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 13(4), pages 507-535.
    • Handle: RePEc:ids:eujine:v:13:y:2019:i:4:p:507-535
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=100919
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:eujine:v:13:y:2019:i:4:p:507-535. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.