Bi-Objective Modelling for Hazardous Materials Road–Rail Multimodal Routing Problem with Railway Schedule-Based Space–Time Constraints
نویسندگان
چکیده
The transportation of hazardous materials is always accompanied by considerable risk that will impact public and environment security. As an efficient and reliable transportation organization, a multimodal service should participate in the transportation of hazardous materials. In this study, we focus on transporting hazardous materials through the multimodal service network and explore the hazardous materials multimodal routing problem from the operational level of network planning. To formulate this problem more practicably, minimizing the total generalized costs of transporting the hazardous materials and the social risk along the planned routes are set as the optimization objectives. Meanwhile, the following formulation characteristics will be comprehensively modelled: (1) specific customer demands; (2) multiple hazardous material flows; (3) capacitated schedule-based rail service and uncapacitated time-flexible road service; and (4) environmental risk constraint. A bi-objective mixed integer nonlinear programming model is first built to formulate the routing problem that combines the formulation characteristics above. Then linear reformations are developed to linearize and improve the initial model so that it can be effectively solved by exact solution algorithms on standard mathematical programming software. By utilizing the normalized weighted sum method, we can generate the Pareto solutions to the bi-objective optimization problem for a specific case. Finally, a large-scale empirical case study from the Beijing-Tianjin-Hebei Region in China is presented to demonstrate the feasibility of the proposed methods in dealing with the practical problem. Various scenarios are also discussed in the case study.
منابع مشابه
Correction: Sun, Y.; et al. Bi-Objective Modelling for Hazardous Materials Road–Rail Multimodal Routing Problem with Railway Schedule-Based Space–Time Constraints. Int. J. Environ. Res. Public Health 2016, 13, 762
Bi-Objective Modelling for Hazardous Materials Road-Rail Multimodal Routing Problem with Railway Schedule-Based Space-Time Constraints.[...].
متن کاملA Decision Support System for Urban Journey Planning in Multimodal Public Transit Network
The goal of this paper is to develop a Decision Support System (DSS) as a journey planner in complex and large multimodal urban network called Rahyar. Rahyar attempts to identify the most desirable itinerary among all feasible alternatives. The desirability of an itinerary is measured by a disutility function, which is defined as a weighted sum of some criteria. The weight...
متن کاملDeveloping a Bi-level Objective Model of Risk-Cost Trade-off for Solving Locating-Routing Problem in Transportation of Hazardous Material
Allocating and routing problems in the field of transportation engineering are generally solved using the objective function of minimizing transport cost. Transport risk is a main concern in hazardous material transportation, mainly dependent on the vision of decision makers (national and/or local authorities). In this research work, a trade-off approach has been proposed to determine the safes...
متن کاملSolving a Multi-Objective Location-Routing Problem for Hazardous Waste Management Industrial
Industrial hazardous materials (hazmat) are byproduct of industrial production and include hazardous goods, such as flammable, toxic and corrosive materials that pose a risk to the environment.Hazardous waste management includes collection, transportation, treatment, recycling and disposal of industrial hazardous material in an organized manner. With the increasing industrialization of countrie...
متن کاملBi-objective decision support system for routing and scheduling of hazardous materials
This paper presents a Pareto-based bi-objective optimization of hazardous materials vehicle routing and scheduling problem with time windows and shows its application to a realistic hazardous material logistics instance. A meta-heuristic solution algorithm is also proposed, which returns a set of routing solutions that approximate the frontier of the Pareto optimal solutions based on total sche...
متن کامل