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

Solving the Green Open Vehicle Routing Problem Using a Membrane-Inspired Hybrid Algorithm

Author

Listed:
  • Yunyun Niu

    (School of Information Engineering, China University of Geosciences in Beijing, Beijing 100083, China)

  • Zehua Yang

    (School of Information Engineering, China University of Geosciences in Beijing, Beijing 100083, China)

  • Rong Wen

    (Singapore Institute of Manufacturing Technology, Singapore 138634, Singapore)

  • Jianhua Xiao

    (The Research Center of Logistics, Nankai University, Tianjin 300071, China)

  • Shuai Zhang

    (DeGroote School of Business, McMaster University, Hamilton, ON L8S 4M4, Canada)

Abstract

The green open vehicle routing problem with time windows has been widely studied to plan routes with minimal emissions in third-party logistics. Due to the NP-hardness, the performance of the general heuristics significantly degrades when dealing with large-scale instances. In this paper, we propose a membrane-inspired hybrid algorithm to solve the problem. The proposed algorithm has a three-level structure of cell-like nested membranes, where tabu search, genetic operators, and neighbourhood search are incorporated. In particular, the elementary membranes (level-3) provide extra attractors to the tabu search in their adjacent level-2 membranes. The genetic algorithm in the skin membrane (level-1) is designed to retain the desirable gene segments of tentative solutions, especially using its crossover operator. The tabu search in the level-2 membranes helps the genetic algorithm circumvent the local optimum. Two sets of real-life instances, one of a Chinese logistics company, Jingdong, and the other of Beijing city, are tested to evaluate our method. The experimental results reveal that the proposed algorithm is considerably superior to the baselines for solving the large-scale green open vehicle routing problem with time windows.

Suggested Citation

  • Yunyun Niu & Zehua Yang & Rong Wen & Jianhua Xiao & Shuai Zhang, 2022. "Solving the Green Open Vehicle Routing Problem Using a Membrane-Inspired Hybrid Algorithm," Sustainability, MDPI, vol. 14(14), pages 1-22, July.
    • Handle: RePEc:gam:jsusta:v:14:y:2022:i:14:p:8661-:d:863440
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. U Derigs & K Reuter, 2009. "A simple and efficient tabu search heuristic for solving the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1658-1669, December.
    2. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    3. C D Tarantilis & G Ioannou & C T Kiranoudis & G P Prastacos, 2005. "Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 588-596, May.
    4. Barth, Matthew & Younglove, Theodore & Scora, George, 2005. "Development of a Heavy-Duty Diesel Modal Emissions and Fuel Consumption Model," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt67f0v3zf, Institute of Transportation Studies, UC Berkeley.
    5. Brandao, Jose, 2004. "A tabu search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 157(3), pages 552-564, September.
    6. Tan, K.C. & Cheong, C.Y. & Goh, C.K., 2007. "Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation," European Journal of Operational Research, Elsevier, vol. 177(2), pages 813-839, March.
    7. Yu, Yang & Wang, Sihan & Wang, Junwei & Huang, Min, 2019. "A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 511-527.
    8. Kramer, Raphael & Maculan, Nelson & Subramanian, Anand & Vidal, Thibaut, 2015. "A speed and departure time optimization algorithm for the pollution-routing problem," European Journal of Operational Research, Elsevier, vol. 247(3), pages 782-787.
    9. P P Repoussis & C D Tarantilis & G Ioannou, 2007. "The open vehicle routing problem with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 355-367, March.
    10. X-Y Li & P Tian & S C H Leung, 2009. "An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 1012-1025, July.
    11. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    12. Fleszar, Krzysztof & Osman, Ibrahim H. & Hindi, Khalil S., 2009. "A variable neighbourhood search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 803-809, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yan Li & Xiao Xu & Fuyu Wang, 2023. "Research on Home Health Care Scheduling Considering Synchronous Access of Caregivers and Vehicles," Sustainability, MDPI, vol. 15(7), pages 1-18, April.
    2. Garside, Annisa Kesy & Ahmad, Robiah & Muhtazaruddin, Mohd Nabil Bin, 2024. "A recent review of solution approaches for green vehicle routing problem and its variants," Operations Research Perspectives, Elsevier, vol. 12(C).

    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. Yunyun Niu & Zehua Yang & Ping Chen & Jianhua Xiao, 2018. "A Hybrid Tabu Search Algorithm for a Real-World Open Vehicle Routing Problem Involving Fuel Consumption Constraints," Complexity, Hindawi, vol. 2018, pages 1-12, February.
    2. Emna Marrekchi & Walid Besbes & Diala Dhouib & Emrah Demir, 2021. "A review of recent advances in the operations research literature on the green routing problem and its variants," Annals of Operations Research, Springer, vol. 304(1), pages 529-574, September.
    3. Atefi, Reza & Salari, Majid & C. Coelho, Leandro & Renaud, Jacques, 2018. "The open vehicle routing problem with decoupling points," European Journal of Operational Research, Elsevier, vol. 265(1), pages 316-327.
    4. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    5. 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.
    6. Ling Shen & Fengming Tao & Songyi Wang, 2018. "Multi-Depot Open Vehicle Routing Problem with Time Windows Based on Carbon Trading," IJERPH, MDPI, vol. 15(9), pages 1-20, September.
    7. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    8. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2021. "Green vehicle routing problem: A state-of-the-art review," International Journal of Production Economics, Elsevier, vol. 231(C).
    9. 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.
    10. Onur Can Saka & Sinan Gürel & Tom Van Woensel, 2017. "Using cost change estimates in a local search heuristic for the pollution routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 557-587, March.
    11. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    12. Lei Chen & Haiyan Ma & Yi Wang & Feng Li, 2022. "Vehicle Routing Problem for the Simultaneous Pickup and Delivery of Lithium Batteries of Small Power Vehicles under Charging and Swapping Mode," Sustainability, MDPI, vol. 14(16), pages 1-23, August.
    13. Li, Xiangyong & Tian, Peng & Leung, Stephen C.H., 2010. "Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm," International Journal of Production Economics, Elsevier, vol. 125(1), pages 137-145, May.
    14. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    15. N. Norouzi & R. Tavakkoli-Moghaddam & M. Ghazanfari & M. Alinaghian & A. Salamatbakhsh, 2012. "A New Multi-objective Competitive Open Vehicle Routing Problem Solved by Particle Swarm Optimization," Networks and Spatial Economics, Springer, vol. 12(4), pages 609-633, December.
    16. Mohammad Asghari & Seyed Mohammad Javad Mirzapour Al-E-Hashem, 2021. "Green vehicle routing problem: A state-of-the-art review," Post-Print hal-03182944, HAL.
    17. 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.
    18. 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.
    19. Ehmke, Jan Fabian & Campbell, Ann M. & Thomas, Barrett W., 2018. "Optimizing for total costs in vehicle routing in urban areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 242-265.
    20. 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.

    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:14:y:2022:i:14:p:8661-:d:863440. 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.