IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v18y2026i3p1238-d1849045.html

A Cost–Carbon Synergy Adaptive Genetic Algorithm for Unbalanced Transportation Problem

Author

Listed:
  • Zuocheng Li

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China)

  • Yunya Guo

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China)

  • Rongjuan Luo

    (School of Logistics and Management Engineering, Yunnan University of Finance and Economics, Kunming 650221, China)

Abstract

Traditional vehicle routing problems focus primarily on cost minimization. This paper addresses the unbalanced transportation problem, aiming to minimize both costs and carbon emissions. We propose a Cost–Carbon Emissions Adaptive Genetic Algorithm (CSC-AGA) based on the Cost–Carbon Synergy (CSC) mechanism, which quantifies the marginal cost of carbon emission reduction by comparing intergenerational changes in cost and emissions. This mechanism enables dynamic adjustment of penalty coefficients during the evolutionary process. The algorithm adapts penalty coefficients and search parameters to optimize both objectives within a single framework. Experimental results demonstrate that the proposed algorithm outperforms traditional approaches in both cost control and emission reduction, while also approximating or surpassing the approximate Pareto front of existing multi-objective methods with better computational efficiency. The Generalized Unbalanced Transportation Problem (G-UTP) is an NP-hard optimization problem, inheriting the complexity of classical transportation problems while also balancing economic and environmental objectives.

Suggested Citation

  • Zuocheng Li & Yunya Guo & Rongjuan Luo, 2026. "A Cost–Carbon Synergy Adaptive Genetic Algorithm for Unbalanced Transportation Problem," Sustainability, MDPI, vol. 18(3), pages 1-44, January.
  • Handle: RePEc:gam:jsusta:v:18:y:2026:i:3:p:1238-:d:1849045
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/18/3/1238/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/18/3/1238/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:gam:jsusta:v:18:y:2026:i:3:p:1238-:d:1849045. 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: 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.