IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i18p2320-d638976.html
   My bibliography  Save this article

Simulated Annealing with Mutation Strategy for the Share-a-Ride Problem with Flexible Compartments

Author

Listed:
  • Vincent F. Yu

    (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan
    Center for Cyber-Physical System Innovation, National Taiwan University of Science and Technology, Taipei 106, Taiwan)

  • Putu A. Y. Indrakarna

    (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan)

  • Anak Agung Ngurah Perwira Redi

    (BINUS Graduate Program—Master of Industrial Engineering, Industrial Engineering Department, Bina Nusantara University, Jakarta 11480, Indonesia)

  • Shih-Wei Lin

    (Department of Information Management, Chang Gung University, Taoyuan 333, Taiwan
    Department of Industrial and Management, Ming Chi University of Technology, New Taipei 243, Taiwan
    Department of Neurology, Linkou Chang Gung Memorial Hospital, Taoyuan 333, Taiwan)

Abstract

The Share-a-Ride Problem with Flexible Compartments (SARPFC) is an extension of the Share-a-Ride Problem (SARP) where both passenger and freight transport are serviced by a single taxi network. The aim of SARPFC is to increase profit by introducing flexible compartments into the SARP model. SARPFC allows taxis to adjust their compartment size within the lower and upper bounds while maintaining the same total capacity permitting them to service more parcels while simultaneously serving at most one passenger. The main contribution of this study is that we formulated a new mathematical model for the problem and proposed a new variant of the Simulated Annealing (SA) algorithm called Simulated Annealing with Mutation Strategy (SAMS) to solve SARPFC. The mutation strategy is an intensification approach to improve the solution based on slack time, which is activated in the later stage of the algorithm. The proposed SAMS was tested on SARP benchmark instances, and the result shows that it outperforms existing algorithms. Several computational studies have also been conducted on the SARPFC instances. The analysis of the effects of compartment size and the portion of package requests to the total profit showed that, on average, utilizing flexible compartments as in SARPFC brings in more profit than using a fixed-size compartment as in SARP.

Suggested Citation

  • Vincent F. Yu & Putu A. Y. Indrakarna & Anak Agung Ngurah Perwira Redi & Shih-Wei Lin, 2021. "Simulated Annealing with Mutation Strategy for the Share-a-Ride Problem with Flexible Compartments," Mathematics, MDPI, vol. 9(18), pages 1-18, September.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:18:p:2320-:d:638976
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/18/2320/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/18/2320/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Detti, Paolo & Papalini, Francesco & Lara, Garazi Zabalo Manrique de, 2017. "A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare," Omega, Elsevier, vol. 70(C), pages 1-14.
    2. Yan Cheng Hsu & Jose L. Walteros & Rajan Batta, 2020. "Solving the petroleum replenishment and routing problem with variable demands and time windows," Annals of Operations Research, Springer, vol. 294(1), pages 9-46, November.
    3. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, February.
    4. Rossana Cavagnini & Valentina Morandi, 2021. "Implementing Horizontal Cooperation in Public Transport and Parcel Deliveries: The Cooperative Share-A-Ride Problem," Sustainability, MDPI, vol. 13(8), pages 1-20, April.
    5. Goodson, Justin C., 2015. "A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 241(2), pages 361-369.
    6. Ostermeier, Manuel & Henke, Tino & Hübner, Alexander & Wäscher, Gerhard, 2021. "Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 799-817.
    7. Jean-François Cordeau & Gilbert Laporte, 2007. "The dial-a-ride problem: models and algorithms," Annals of Operations Research, Springer, vol. 153(1), pages 29-46, September.
    8. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2016. "An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 95-123.
    9. Christiansen, Marielle & Fagerholt, Kjetil & Rachaniotis, Nikolaos P. & Stålhane, Magnus, 2017. "Operational planning of routes and schedules for a fleet of fuel supply vessels," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 163-175.
    10. Li, Baoxiang & Krushinsky, Dmitry & Reijers, Hajo A. & Van Woensel, Tom, 2014. "The Share-a-Ride Problem: People and parcels sharing taxis," European Journal of Operational Research, Elsevier, vol. 238(1), pages 31-40.
    11. Lahyani, Rahma & Coelho, Leandro C. & Khemakhem, Mahdi & Laporte, Gilbert & Semet, Frédéric, 2015. "A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia," Omega, Elsevier, vol. 51(C), pages 1-10.
    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. Vincent F. Yu & Hadi Susanto & Yu-Hsuan Yeh & Shih-Wei Lin & Yu-Tsung Huang, 2022. "The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers," Mathematics, MDPI, vol. 10(6), pages 1-22, March.

    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. Lu, Chung-Cheng & Diabat, Ali & Li, Yi-Ting & Yang, Yu-Min, 2022. "Combined passenger and parcel transportation using a mixed fleet of electric and gasoline vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    2. Ostermeier, Manuel & Henke, Tino & Hübner, Alexander & Wäscher, Gerhard, 2021. "Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 799-817.
    3. Mourad, Abood & Puchinger, Jakob & Chu, Chengbin, 2019. "A survey of models and algorithms for optimizing shared mobility," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 323-346.
    4. Rossana Cavagnini & Valentina Morandi, 2021. "Implementing Horizontal Cooperation in Public Transport and Parcel Deliveries: The Cooperative Share-A-Ride Problem," Sustainability, MDPI, vol. 13(8), pages 1-20, April.
    5. Tino Henke & M. Grazia Speranza & Gerhard Wäscher, 2019. "A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes," Annals of Operations Research, Springer, vol. 275(2), pages 321-338, April.
    6. Heßler, Katrin, 2021. "Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes," European Journal of Operational Research, Elsevier, vol. 294(1), pages 188-205.
    7. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    8. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    9. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    10. Paul Czioska & Ronny Kutadinata & Aleksandar Trifunović & Stephan Winter & Monika Sester & Bernhard Friedrich, 2019. "Real-world meeting points for shared demand-responsive transportation systems," Public Transport, Springer, vol. 11(2), pages 341-377, August.
    11. Bhoopalam, Anirudh Kishore & Agatz, Niels & Zuidwijk, Rob, 2018. "Planning of truck platoons: A literature review and directions for future research," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 212-228.
    12. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
    13. Bo Sun & Ming Wei & Chunfeng Yang & Zhihuo Xu & Han Wang, 2018. "Personalised and Coordinated Demand-Responsive Feeder Transit Service Design: A Genetic Algorithms Approach," Future Internet, MDPI, vol. 10(7), pages 1-14, July.
    14. Paredes-Belmar, Germán & Montero, Elizabeth & Lüer-Villagra, Armin & Marianov, Vladimir & Araya-Sassi, Claudio, 2022. "Vehicle routing for milk collection with gradual blending: A case arising in Chile," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1403-1416.
    15. Masoud, Neda & Jayakrishnan, R., 2017. "A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 1-29.
    16. Yu, Yao & Machemehl, Randy B. & Xie, Chi, 2015. "Demand-responsive transit circulator service network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 76(C), pages 160-175.
    17. Regnier-Coudert, Olivier & McCall, John & Ayodele, Mayowa & Anderson, Steven, 2016. "Truck and trailer scheduling in a real world, dynamic and heterogeneous context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 389-408.
    18. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2021. "Crowdsourced delivery: A review of platforms and academic literature," Omega, Elsevier, vol. 98(C).
    19. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    20. Azcuy, Irecis & Agatz, Niels & Giesen, Ricardo, 2021. "Designing integrated urban delivery systems using public transport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(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:jmathe:v:9:y:2021:i:18:p:2320-:d:638976. 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.