IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v16y2024i14p6145-d1437909.html
   My bibliography  Save this article

The Multi-Visit Vehicle Routing Problem with Drones under Carbon Trading Mechanism

Author

Listed:
  • Qinxin Xiao

    (School of Business, Sichuan Normal University, Chengdu 610066, China)

  • Jiaojiao Gao

    (School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China)

Abstract

In the context of the carbon trading mechanism, this study investigated a multi-visit vehicle routing problem with a truck-drone collaborative delivery model. This issue involves the route of a truck fleet and drones, each truck equipped with a drone, allowing drones to provide services to multiple customers. Considering the carbon emissions during both the truck’s travel and the drone’s flight, this study established a mixed integer programming model to minimize the sum of fixed costs, transportation costs, and carbon trading costs. A two-stage heuristic algorithm was proposed to solve the problem. The first stage employed a “Scanning and Heuristic Insertion” algorithm to generate an initial feasible solution. In the second stage, an enhanced variable neighborhood search algorithm was designed with problem-specific neighborhood structures and customized search strategies. The effectiveness of the proposed algorithm was validated with numerical experiments. Additionally, this study analyzed the impact of various factors on carbon trading costs, revealing that there exists an optimal combination of drones and trucks. It was also observed that changes in carbon quotas do not affect carbon emissions but do alter the total delivery costs. These results provide insights for logistics enterprise operations management and government policy-making.

Suggested Citation

  • Qinxin Xiao & Jiaojiao Gao, 2024. "The Multi-Visit Vehicle Routing Problem with Drones under Carbon Trading Mechanism," Sustainability, MDPI, vol. 16(14), pages 1-23, July.
    • Handle: RePEc:gam:jsusta:v:16:y:2024:i:14:p:6145-:d:1437909
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/16/14/6145/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/16/14/6145/
    Download Restriction: no
    ---><---

    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. Zhang, Dongyang & Kong, Qunxi, 2022. "Green energy transition and sustainable development of energy firms: An assessment of renewable energy policy," Energy Economics, Elsevier, vol. 111(C).
    3. Drew Shindell & Christopher J. Smith, 2019. "Climate and air-quality benefits of a realistic phase-out of fossil fuels," Nature, Nature, vol. 573(7774), pages 408-411, September.
    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. Jumbo, Olga & Moghaddass, Ramin, 2022. "Resource optimization and image processing for vegetation management programs in power distribution networks," Applied Energy, Elsevier, vol. 319(C).
    2. Jānis Krūmiņš & Māris Kļaviņš, 2023. "Investigating the Potential of Nuclear Energy in Achieving a Carbon-Free Energy Future," Energies, MDPI, vol. 16(9), pages 1-31, April.
    3. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    4. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    5. Ido Orenstein & Tal Raviv & Elad Sadan, 2019. "Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 683-711, December.
    6. Tianlu Zhao & Yongjian Yang & En Wang, 2020. "Minimizing the average arriving distance in carpooling," International Journal of Distributed Sensor Networks, , vol. 16(1), pages 15501477198, January.
    7. Dessouky, Maged M & Shao, Yihuan E, 2017. "Routing Strategies for Efficient Deployment of Alternative Fuel Vehicles for Freight Delivery," Institute of Transportation Studies, Working Paper Series qt0nj024qn, Institute of Transportation Studies, UC Davis.
    8. A. Mor & M. G. Speranza, 2020. "Vehicle routing problems over time: a survey," 4OR, Springer, vol. 18(2), pages 129-149, June.
    9. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    10. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    11. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    12. Y H Lee & J I Kim & K H Kang & K H Kim, 2008. "A heuristic for vehicle fleet mix problem using tabu search and set partitioning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 833-841, June.
    13. 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.
    14. 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).
    15. Tibor Holczinger & Olivér Ősz & Máté Hegyháti, 2020. "Scheduling approach for on-site jobs of service providers," Flexible Services and Manufacturing Journal, Springer, vol. 32(4), pages 913-948, December.
    16. Zhiping Zuo & Yanhui Li & Jing Fu & Jianlin Wu, 2019. "Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints," Mathematics, MDPI, vol. 7(7), pages 1-18, July.
    17. Jinil Han & Chungmok Lee & Sungsoo Park, 2014. "A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times," Transportation Science, INFORMS, vol. 48(3), pages 373-390, August.
    18. Narjes MASHHADI BANDANI & Alireza NADERI & Mohsen AKBARPOUR SHIRZAEI, 2017. "Cement Transportation Limited-Fleet Modeling And Assigning To Rated Demands," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 12(1), pages 111-123, March.
    19. Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    20. Molina-Rodea, R. & Saucedo-Velázquez, J. & Gómez-Franco, W.R. & Wong-Loya, J.A., 2024. "Operational proposal of “U” type earth heat exchanger harnessing a non-producing well for energy supply to an absorption cooling system. Approach with “La Primavera” geothermal field data," Renewable Energy, Elsevier, vol. 227(C).

    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:gam:jsusta:v:16:y:2024:i:14:p:6145-:d:1437909. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.