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

An Improved Cuckoo Search for a Patient Transportation Problem with Consideration of Reducing Transport Emissions

Author

Listed:
  • Liyang Xiao

    (Nanomedicine Lab, Univ. Bourgogne Franche-Comté, UTBM, 25030 Besancon, France)

  • Mahjoub Dridi

    (Nanomedicine Lab, Univ. Bourgogne Franche-Comté, UTBM, 25030 Besancon, France)

  • Amir Hajjam El Hassani

    (Nanomedicine Lab, Univ. Bourgogne Franche-Comté, UTBM, 25030 Besancon, France)

  • Hongying Fei

    (School of Management, Shanghai University, 99 ShangDa Road, BaoShan District, Shanghai 200444, China)

  • Wanlong Lin

    (Shanghai No.3 Rehabilitation Hospital, 100 JiaoCheng Road, JingAn District, Shanghai 200072, China)

Abstract

Many government agencies and business organizations have realized that it is necessary to consider not only the economic cost but also the road transport emissions when they determine the transport policies and operations. In this study, a patient transportation problem with the aim of reducing transport emissions has been formulated by implementing CVRP model. In order to determine the routes of patient transportation with optimized emissions for targeted hospital, an improved Cuckoo Search (ICS) algorithm is proposed. In this study, a ‘split’ procedure has been implemented to simplify the individual’s representation. A new category of cuckoos has been introduced to improve the ICS’s search ability. Two heuristics have been applied to improve the quality of initial population. A local search mechanism has been embedded in the search procedure to improve the quality of solutions obtained at the end of each iteration. The computational results were encouraging and demonstrated the effectiveness of the proposed solution method.

Suggested Citation

  • Liyang Xiao & Mahjoub Dridi & Amir Hajjam El Hassani & Hongying Fei & Wanlong Lin, 2018. "An Improved Cuckoo Search for a Patient Transportation Problem with Consideration of Reducing Transport Emissions," Sustainability, MDPI, vol. 10(3), pages 1-19, March.
    • Handle: RePEc:gam:jsusta:v:10:y:2018:i:3:p:793-:d:136046
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/10/3/793/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/10/3/793/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Zhang, Zhenzhen & Liu, Mengyang & Lim, Andrew, 2015. "A memetic algorithm for the patient transportation problem," Omega, Elsevier, vol. 54(C), pages 60-71.
    3. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1994. "A Tabu Search Heuristic for the Vehicle Routing Problem," Management Science, INFORMS, vol. 40(10), pages 1276-1290, October.
    4. Zhen, Lu & Xu, Zhou & Wang, Kai & Ding, Yi, 2016. "Multi-period yard template planning in container terminals," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 700-719.
    5. Yu, Bin & Yang, Zhong Zhen, 2011. "An ant colony optimization model: The period vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(2), pages 166-181, March.
    6. Beasley, JE, 1983. "Route first--Cluster second methods for vehicle routing," Omega, Elsevier, vol. 11(4), pages 403-408.
    7. Zhen, Lu, 2016. "Modeling of yard congestion and optimization of yard template in container ports," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 83-104.
    8. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    9. Paolo Toth & Daniele Vigo, 2003. "The Granular Tabu Search and Its Application to the Vehicle-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 15(4), pages 333-346, November.
    10. Yanjie Zhou & Gyu M. Lee, 2017. "A Lagrangian Relaxation-Based Solution Method for a Green Vehicle Routing Problem to Minimize Greenhouse Gas Emissions," Sustainability, MDPI, vol. 9(5), pages 1-17, May.
    11. G. A. Croes, 1958. "A Method for Solving Traveling-Salesman Problems," Operations Research, INFORMS, vol. 6(6), pages 791-812, December.
    12. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    13. J-F Cordeau & M Gendreau & G Laporte & J-Y Potvin & F Semet, 2002. "A guide to vehicle routing heuristics," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(5), pages 512-522, May.
    14. Thomas A. Feo & Jonathan F. Bard, 1989. "Flight Scheduling and Maintenance Base Planning," Management Science, INFORMS, vol. 35(12), pages 1415-1432, December.
    15. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
    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. Themistoklis Stamadianos & Andromachi Taxidou & Magdalene Marinaki & Yannis Marinakis, 2024. "Swarm intelligence and nature inspired algorithms for solving vehicle routing problems: a survey," Operational Research, Springer, vol. 24(3), pages 1-45, September.
    2. Longlong Leng & Yanwei Zhao & Jingling Zhang & Chunmiao Zhang, 2019. "An Effective Approach for the Multiobjective Regional Low-Carbon Location-Routing Problem," IJERPH, MDPI, vol. 16(11), pages 1-28, June.
    3. Md Ashikur Rahman & Rajalingam Sokkalingam & Mahmod Othman & Kallol Biswas & Lazim Abdullah & Evizal Abdul Kadir, 2021. "Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances," Mathematics, MDPI, vol. 9(20), pages 1-32, October.

    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. 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.
    2. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    3. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.
    4. 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.
    5. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    6. Drexl, M. & Schneider, M., 2014. "A Survey of the Standard Location-Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65940, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    7. Dimitris Bertsimas & Patrick Jaillet, & Sébastien Martin, 2019. "Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications," Operations Research, INFORMS, vol. 67(1), pages 143-162, January.
    8. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    9. Christian Brabänder & Maximilian Braun, 2020. "Bringing economies of integration into the costing of groupage freight," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 19(6), pages 366-385, December.
    10. Böhnlein, Dominik & Schweiger, Katharina & Tuma, Axel, 2011. "Multi-agent-based transport planning in the newspaper industry," International Journal of Production Economics, Elsevier, vol. 131(1), pages 146-157, May.
    11. Schneider, Michael & Schwahn, Fabian & Vigo, Daniele, 2017. "Designing granular solution methods for routing problems with time windows," European Journal of Operational Research, Elsevier, vol. 263(2), pages 493-509.
    12. Michael Schneider & Michael Drexl, 2017. "A survey of the standard location-routing problem," Annals of Operations Research, Springer, vol. 259(1), pages 389-414, December.
    13. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    14. Berbotto, Leonardo & García, Sergio & Nogales, Francisco J., 2011. "A vehicle routing model with split delivery and stop nodes," DES - Working Papers. Statistics and Econometrics. WS ws110906, Universidad Carlos III de Madrid. Departamento de Estadística.
    15. Schneider, Michael, 2016. "The vehicle-routing problem with time windows and driver-specific times," European Journal of Operational Research, Elsevier, vol. 250(1), pages 101-119.
    16. Brandstätter, Christian & Reimann, Marc, 2018. "The Line-haul Feeder Vehicle Routing Problem: Mathematical model formulation and heuristic approaches," European Journal of Operational Research, Elsevier, vol. 270(1), pages 157-170.
    17. Guido Perboli & Ferdinando Pezzella & Roberto Tadei, 2008. "EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 361-382, October.
    18. Jean-Yves Potvin, 2009. "State-of-the Art Review ---Evolutionary Algorithms for Vehicle Routing," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 518-548, November.
    19. Gilbert Laporte, 2007. "What you should know about the vehicle routing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(8), pages 811-819, December.
    20. L Zeng & H L Ong & K M Ng, 2007. "A generalized crossing local search method for solving vehicle routing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 528-532, April.

    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:10:y:2018:i:3:p:793-:d:136046. 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.