IDEAS home Printed from https://ideas.repec.org/a/ijs/journl/v0y2024i40p183-198.html
   My bibliography  Save this article

A Sectoral Application for Green Vehicle Routing Problem Optimization with Capacity Constrained and Heterogeneous Fleet

Author

Listed:
  • Furkan Dişkaya

    (İstanbul Beykent University, Industrial Engineering, İstanbul, Türkiye)

  • Sait Erdal Dinçer

    (Marmara University, Department of Econometrics, İstanbul, Türkiye)

Abstract

The vehicle routing problem (VRP), which is a type of traveling salesman problem (TSP), is a combinatorial optimization problem which determines the shortest route distribution from a central warehouse to customer points in certain locations. Today, global climate change resulting from high greenhouse gas emissions and the rapid decrease in natural resources have begun to threaten life as well as the sustainability of our economic structures. For this purpose, businesses have begun to prioritize to the concept of green logistics, which is based on the strategy of environmentally friendly activities in the production of goods and services. In this study, a mathematical model is proposed to solve the green vehicle routing problem with capacity limited and heterogeneous fleet (CHFGVRP), which is a type of vehicle routing problem under the green logistics strategy. Metaheuristic approaches produce successful solutions when solving routing problems with an NP-hard class problem structure. The presented model was developed by Ekol Inc., with the help of the Genetic Algorithm (GA) and Tabu Search (TS) metaheuristic solution approaches. It has been optimized as a real distribution operation for logistics businesses. The main purpose of the present study is assigning vehicles of different capacities of a logistics company to the most suitable loads for two different order sets, to determine the most appropriate customer point route. Thus, as transportation costs decrease thanks to fuel savings, the amount of carbon emissions released into the environment will also decrease. The results of this research will contribute to businesses which seek environmental and economic sustainability, as well as to the developing scientific literature on the subject.

Suggested Citation

  • Furkan Dişkaya & Sait Erdal Dinçer, 2024. "A Sectoral Application for Green Vehicle Routing Problem Optimization with Capacity Constrained and Heterogeneous Fleet," Istanbul Journal of Economics-Istanbul Iktisat Dergisi, Istanbul Journal of Economics-Istanbul Iktisat Dergisi, vol. 0(40), pages 183-198, June.
  • Handle: RePEc:ijs:journl:v:0:y:2024:i:40:p:183-198
    DOI: :10.26650/ekoist.2024.40.1451034
    as

    Download full text from publisher

    File URL: https://cdn.istanbul.edu.tr/file/JTA6CLJ8T5/D04A51F5573444C0A44211F1003F01DB
    Download Restriction: no

    File URL: https://iupress.istanbul.edu.tr/tr/journal/ekoist/article/a-sectoral-application-for-green-vehicle-routing-problem-optimization-with-capacity-constrained-and-heterogeneous-fleet
    Download Restriction: no

    File URL: https://libkey.io/:10.26650/ekoist.2024.40.1451034?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    2. Abdullahi, Hassana & Reyes-Rubiano, Lorena & Ouelhadj, Djamila & Faulin, Javier & Juan, Angel A., 2021. "Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 292(1), pages 143-154.
    3. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2012. "An adaptive large neighborhood search heuristic for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 346-359.
    4. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    5. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Müller, Juliane, 2010. "Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 202(1), pages 223-231, April.
    2. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem," Transportation Science, INFORMS, vol. 48(1), pages 20-45, February.
    3. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2015. "A column generation approach for a multi-attribute vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 888-906.
    4. Xiao, Yiyong & Konak, Abdullah, 2016. "The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 146-166.
    5. Zhang, Jianghua & Zhao, Yingxue & Xue, Weili & Li, Jin, 2015. "Vehicle routing problem with fuel consumption and carbon emission," International Journal of Production Economics, Elsevier, vol. 170(PA), pages 234-242.
    6. Jumbo, Olga & Moghaddass, Ramin, 2022. "Resource optimization and image processing for vegetation management programs in power distribution networks," Applied Energy, Elsevier, vol. 319(C).
    7. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    8. Srinivas, Sharan & Ramachandiran, Surya & Rajendran, Suchithra, 2022. "Autonomous robot-driven deliveries: A review of recent developments and future directions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    9. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    10. Dukkanci, Okan & Karsu, Özlem & Kara, Bahar Y., 2022. "Planning sustainable routes: Economic, environmental and welfare concerns," European Journal of Operational Research, Elsevier, vol. 301(1), pages 110-123.
    11. Cárdenas-Barrón, Leopoldo Eduardo & González-Velarde, José Luis & Treviño-Garza, Gerardo & Garza-Nuñez, Dagoberto, 2019. "Heuristic algorithm based on reduce and optimize approach for a selective and periodic inventory routing problem in a waste vegetable oil collection environment," International Journal of Production Economics, Elsevier, vol. 211(C), pages 44-59.
    12. Boschetti, Marco Antonio & Maniezzo, Vittorio & Strappaveccia, Francesco, 2017. "Route relaxations on GPU for vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 456-466.
    13. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    14. Majsa Ammouriova & Massimo Bertolini & Juliana Castaneda & Angel A. Juan & Mattia Neroni, 2022. "A Heuristic-Based Simulation for an Education Process to Learn about Optimization Applications in Logistics and Transportation," Mathematics, MDPI, vol. 10(5), pages 1-18, March.
    15. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
    16. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2018. "Vehicle routing problems with multiple trips," Annals of Operations Research, Springer, vol. 271(1), pages 127-159, December.
    17. Wu, Guoyuan & Peng, Dongbo & Boriboonsomsin, Kanok, 2024. "Developing an Efficient Dispatching Strategy to Support Commercial Fleet Electrification," Institute of Transportation Studies, Working Paper Series qt2qz0n2gv, Institute of Transportation Studies, UC Davis.
    18. Claudio Gambella & Joe Naoum-Sawaya & Bissan Ghaddar, 2018. "The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 554-569, August.
    19. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
    20. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "Vehicle routing problems with multiple trips," 4OR, Springer, vol. 14(3), pages 223-259, September.

    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:ijs:journl:v:0:y:2024:i:40:p:183-198. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Istanbul University Press Operational Team (Ertuğrul YAŞAR) (email available below). General contact details of provider: https://edirc.repec.org/data/ifisttr.html .

    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.