Half Open Multi-Depot Heterogeneous Vehicle Routing Problem for Hazardous Materials Transportation

Author:

Zhou Zhongxin,Ha Minghu,Hu Hao,Ma Hongguang

Abstract

How to reduce the accidents of hazardous materials has become an important and urgent research topic in the safety management of hazardous materials. In this study, we focus on the half open multi-depot heterogeneous vehicle routing problem for hazardous materials transportation. The goal is to determine the vehicle allocation and the optimal route with minimum risk and cost for hazardous materials transportation. A novel transportation risk model is presented considering the variation of vehicle loading, vehicle types, and hazardous materials category. In order to balance the transportation risk and the transportation cost, we propose a bi-objective mixed integer programming model. A hybrid intelligent algorithm is developed based on the ε-constraint method and genetic algorithm to obtain the Pareto optimal solutions. Numerical experiments are provided to demonstrate the effectiveness of the proposed model. Compared with the close multi-depot heterogeneous vehicle routing problem, the average risk and cost obtained by the proposed bi-objective mixed integer programming model can be reduced by 3.99% and 2.01%, respectively. In addition, compared with the half open multi-depot homogeneous vehicle routing problem, the cost is significantly reduced with the acceptable risk.

Publisher

MDPI AG

Subject

Management, Monitoring, Policy and Law,Renewable Energy, Sustainability and the Environment,Geography, Planning and Development

Cited by 19 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3