title: Shortest path with two objectives
body: <p>I am interested in writing an algorithm to find the shortest path with two objective (ex. time and safety). 
  For example, in the graph below, black number is the travel time and red number is the probability of a user experiencing an incident. The goal is to find the best path with the best overall cost. </p>
  
  <p>Total cost = time + (probability of an incident in this route)*(time cost of an incident)</p>
  
  <p>What type of problem is this? Is this a NP-hard problem?
  <a href="https://i.stack.imgur.com/cmi5Z.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/cmi5Z.jpg" alt="example"></a></p>