Bi-objective shortest path problem with one fuzzy cost function for dangerous goods transportation on a road network

摘要: The shortest path problem is a very well-known network problem, whose complexity sensibly augments from polynomial complexity to become a NP-hard problem when a multi-objective function is taken into account. In this work, we take into account a bi-objective problem, where one objective has a fuzzy value, which makes even harder to get a solution. This kind of approach finds an applicative use in the case of dangerous goods transport by road, where trade-off between the minimum cost and the minimum (or minmax) risk has to be solved in the delivery from a depot to petrol stations.