IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v140y2020ics1366554520306578.html
   My bibliography  Save this article

Fairness in hazmat routing-scheduling: A bi-objective Stackelberg game

Author

Listed:
  • Mohri, Seyed Sina
  • Asgari, Nasrin
  • Zanjirani Farahani, Reza
  • Bourlakis, Michael
  • Laker, Benjamin

Abstract

We investigate a hazmat routing-scheduling problem. To minimize the overall expected risk, various vehicles may take different routes/schedules to avoid multiple accidents on the same link. Therefore, the company envisages two issues: (1) unfairly, a vehicle departing earlier from its origin may arrive earlier at its destination than the others leaving later; (2) focusing only on the minimization of risk may increase travel time/cost incurred by the company. We suggest a bi-objective game-theoretic formulation and solve it by a modified Adaptive Large Neighborhood Search and Simulated Annealing. We test the solution on a real-life case and extract practical insights.

Suggested Citation

  • Mohri, Seyed Sina & Asgari, Nasrin & Zanjirani Farahani, Reza & Bourlakis, Michael & Laker, Benjamin, 2020. "Fairness in hazmat routing-scheduling: A bi-objective Stackelberg game," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    • Handle: RePEc:eee:transe:v:140:y:2020:i:c:s1366554520306578
    DOI: 10.1016/j.tre.2020.102006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554520306578
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2020.102006?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. David Pisinger & Stefan Ropke, 2010. "Large Neighborhood Search," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 399-419, Springer.
    2. Grangier, Philippe & Gendreau, Michel & Lehuédé, Fabien & Rousseau, Louis-Martin, 2016. "An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization," European Journal of Operational Research, Elsevier, vol. 254(1), pages 80-91.
    3. Zografos, Konstantinos G. & Androutsopoulos, Konstantinos N., 2004. "A heuristic algorithm for solving hazardous materials distribution problems," European Journal of Operational Research, Elsevier, vol. 152(2), pages 507-519, January.
    4. Omar Drissi-Kaïtouni & Abdelhamid Hameda-Benchekroun, 1992. "A Dynamic Traffic Assignment Model and a Solution Algorithm," Transportation Science, INFORMS, vol. 26(2), pages 119-128, May.
    5. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    6. van der Zijpp, N.J. & Fiorenzo Catalano, S., 2005. "Path enumeration by finding the constrained K-shortest paths," Transportation Research Part B: Methodological, Elsevier, vol. 39(6), pages 545-563, July.
    7. Tsung-Sheng Chang & Linda K. Nozick & Mark A. Turnquist, 2005. "Multiobjective Path Finding in Stochastic Dynamic Networks, with Application to Routing Hazardous Materials Shipments," Transportation Science, INFORMS, vol. 39(3), pages 383-399, August.
    8. Romero, Natalia & Nozick, Linda K. & Xu, Ningxiong, 2016. "Hazmat facility location and routing analysis with explicit consideration of equity using the Gini coefficient," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 165-181.
    9. Ram Gopalan & Krishna S. Kolluri & Rajan Batta & Mark H. Karwan, 1990. "Modeling Equity of Risk in the Transportation of Hazardous Materials," Operations Research, INFORMS, vol. 38(6), pages 961-973, December.
    10. Chen, Huey-Kuo & Hsueh, Che-Fu, 1998. "A model and an algorithm for the dynamic user-optimal route choice problem," Transportation Research Part B: Methodological, Elsevier, vol. 32(3), pages 219-234, April.
    11. Ali Timajchi & Seyed Mohammad Javad Mirzapour Al-E-Hashem & Yacine Rekik, 2019. "Inventory routing problem for hazardous and deteriorating items in the presence of accident risk with transshipment option," Post-Print hal-02312116, HAL.
    12. Rongrong Li & Yee Leung, 2011. "Multi-objective route planning for dangerous goods using compromise programming," Journal of Geographical Systems, Springer, vol. 13(3), pages 249-271, September.
    13. Ran, Bin & Hall, Randolph W. & Boyce, David E., 1996. "A link-based variational inequality model for dynamic departure time/route choice," Transportation Research Part B: Methodological, Elsevier, vol. 30(1), pages 31-46, February.
    14. Ghaderi, Abdolsalam & Burdett, Robert L., 2019. "An integrated location and routing approach for transporting hazardous materials in a bi-modal transportation network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 49-65.
    15. Huo Chai & Ruichun He & Changxi Ma & Cunjie Dai & Kun Zhou, 2017. "Path Planning and Vehicle Scheduling Optimization for Logistic Distribution of Hazardous Materials in Full Container Load," Discrete Dynamics in Nature and Society, Hindawi, vol. 2017, pages 1-13, November.
    16. Timajchi, Ali & Mirzapour Al-e-Hashem, Seyed M.J. & Rekik, Yacine, 2019. "Inventory routing problem for hazardous and deteriorating items in the presence of accident risk with transshipment option," International Journal of Production Economics, Elsevier, vol. 209(C), pages 302-315.
    17. Bronfman, Andrés & Marianov, Vladimir & Paredes-Belmar, Germán & Lüer-Villagra, Armin, 2016. "The maxisum and maximin-maxisum HAZMAT routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 316-333.
    18. Yates, Justin & Batta, Rajan & Karwan, Mark & Casas, Irene, 2012. "Establishing public policy to protect critical infrastructure: Finding a balance between exposure and cost in Los Angeles County," Transport Policy, Elsevier, vol. 24(C), pages 109-117.
    19. Shahrzad Faghih-Roohi & Yew-Soon Ong & Sobhan Asian & Allan N. Zhang, 2016. "Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks," Annals of Operations Research, Springer, vol. 247(2), pages 715-734, December.
    20. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2012. "An adaptive large neighborhood search heuristic for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 346-359.
    21. Mahmoudabadi, Abbas & Seyedhosseini, Seyed Mohammad, 2014. "Solving Hazmat Routing Problem in chaotic damage severity network under emergency environment," Transport Policy, Elsevier, vol. 36(C), pages 34-45.
    22. Michael Bell, 2006. "Mixed Route Strategies for the Risk-Averse Shipment of Hazardous Materials," Networks and Spatial Economics, Springer, vol. 6(3), pages 253-265, September.
    23. 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.
    24. Fang, Kan & Ke, Ginger Y. & Verma, Manish, 2017. "A routing and scheduling approach to rail transportation of hazardous materials with demand due dates," European Journal of Operational Research, Elsevier, vol. 261(1), pages 154-168.
    25. Rahman, Ashrafur & Fiondella, Lance & Lownes, Nicholas E., 2014. "A Bi-Objective Approach to Evaluate Highway Routing and Regulatory Strategies for Hazardous Materials Transportation," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 53(1).
    26. Linda K. Nozick & George F. List & Mark A. Turnquist, 1997. "Integrated Routing and Scheduling in Hazardous Materials Transportation," Transportation Science, INFORMS, vol. 31(3), pages 200-215, August.
    27. Szeto, W.Y. & Farahani, R.Z. & Sumalee, Agachai, 2017. "Link-based multi-class hazmat routing-scheduling problem: A multiple demon approach," European Journal of Operational Research, Elsevier, vol. 261(1), pages 337-354.
    28. Erhan Erkut & Osman Alp, 2007. "Integrated Routing and Scheduling of Hazmat Trucks with Stops En Route," Transportation Science, INFORMS, vol. 41(1), pages 107-122, February.
    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. Mohri, Seyed Sina & Mohammadi, Mehrdad & Gendreau, Michel & Pirayesh, Amir & Ghasemaghaei, Ali & Salehi, Vahid, 2022. "Hazardous material transportation problems: A comprehensive overview of models and solution approaches," European Journal of Operational Research, Elsevier, vol. 302(1), pages 1-38.
    2. Zandieh, Fatemeh & Ghannadpour, Seyed Farid, 2023. "A comprehensive risk assessment view on interval type-2 fuzzy controller for a time-dependent HazMat routing problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 685-707.
    3. Wu, Weitiao & Ma, Jian & Liu, Ronghui & Jin, Wenzhou, 2022. "Multi-class hazmat distribution network design with inventory and superimposed risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    4. Choi, Tsan-Ming & Zhang, Ting, 2023. "Will being an angel bring more harm than good? Altruistic newsvendors with different risk attitudes," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1153-1165.

    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. Mohri, Seyed Sina & Mohammadi, Mehrdad & Gendreau, Michel & Pirayesh, Amir & Ghasemaghaei, Ali & Salehi, Vahid, 2022. "Hazardous material transportation problems: A comprehensive overview of models and solution approaches," European Journal of Operational Research, Elsevier, vol. 302(1), pages 1-38.
    2. Szeto, W.Y. & Farahani, R.Z. & Sumalee, Agachai, 2017. "Link-based multi-class hazmat routing-scheduling problem: A multiple demon approach," European Journal of Operational Research, Elsevier, vol. 261(1), pages 337-354.
    3. Zahra Fattahi & Javad Behnamian, 2022. "Location and transportation of intermodal hazmat considering equipment capacity and congestion impact: elastic method and sub-population genetic algorithm," Annals of Operations Research, Springer, vol. 316(1), pages 303-341, September.
    4. 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.
    5. Zandieh, Fatemeh & Ghannadpour, Seyed Farid, 2023. "A comprehensive risk assessment view on interval type-2 fuzzy controller for a time-dependent HazMat routing problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 685-707.
    6. Wu, Weitiao & Ma, Jian & Liu, Ronghui & Jin, Wenzhou, 2022. "Multi-class hazmat distribution network design with inventory and superimposed risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    7. Kumar, Anand & Roy, Debjit & Verter, Vedat & Sharma, Dheeraj, 2018. "Integrated fleet mix and routing decision for hazmat transportation: A developing country perspective," European Journal of Operational Research, Elsevier, vol. 264(1), pages 225-238.
    8. Turkeš, Renata & Sörensen, Kenneth & Hvattum, Lars Magnus, 2021. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," European Journal of Operational Research, Elsevier, vol. 292(2), pages 423-442.
    9. Ditta, A. & Figueroa, O. & Galindo, G. & Yie-Pinedo, R., 2019. "A review on research in transportation of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 68(C).
    10. Fang, Kan & Ke, Ginger Y. & Verma, Manish, 2017. "A routing and scheduling approach to rail transportation of hazardous materials with demand due dates," European Journal of Operational Research, Elsevier, vol. 261(1), pages 154-168.
    11. Mo, Pengli & Yao, Yu & D’Ariano, Andrea & Liu, Zhiyuan, 2023. "The vehicle routing problem with underground logistics: Formulation and algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    12. Sheng Dong & Jibiao Zhou & Changxi Ma, 2020. "Design of a Network Optimization Platform for the Multivehicle Transportation of Hazardous Materials," IJERPH, MDPI, vol. 17(3), pages 1-14, February.
    13. Ke, Ginger Y. & Zhang, Huiwen & Bookbinder, James H., 2020. "A dual toll policy for maintaining risk equity in hazardous materials transportation with fuzzy incident rate," International Journal of Production Economics, Elsevier, vol. 227(C).
    14. Kallestad, Jakob & Hasibi, Ramin & Hemmati, Ahmad & Sörensen, Kenneth, 2023. "A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 309(1), pages 446-468.
    15. Gläser, Sina, 2022. "A waste collection problem with service type option," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1216-1230.
    16. Ruf, Moritz & Cordeau, Jean-François, 2021. "Adaptive large neighborhood search for integrated planning in railroad classification yards," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 26-51.
    17. Rahman, Ashrafur & Fiondella, Lance & Lownes, Nicholas E., 2014. "A Bi-Objective Approach to Evaluate Highway Routing and Regulatory Strategies for Hazardous Materials Transportation," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 53(1).
    18. Singh, Nitish & Dang, Quang-Vinh & Akcay, Alp & Adan, Ivo & Martagan, Tugce, 2022. "A matheuristic for AGV scheduling with battery constraints," European Journal of Operational Research, Elsevier, vol. 298(3), pages 855-873.
    19. Li, Hongqi & Wang, Haotian & Chen, Jun & Bai, Ming, 2020. "Two-echelon vehicle routing problem with time windows and mobile satellites," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 179-201.
    20. Arjun Paul & Ravi Shankar Kumar & Chayanika Rout & Adrijit Goswami, 2021. "A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint," OPSEARCH, Springer;Operational Research Society of India, vol. 58(4), pages 962-993, December.

    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:eee:transe:v:140:y:2020:i:c:s1366554520306578. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.