Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Vehicle rescheduling problem
open-in-new
<p>The vehicle rescheduling problem (VRSP) is a <a href="/facts/Combinatorial_optimization/PTcloS79">combinatorial optimization</a> and <a href="/facts/Integer_programming/MDaaadoA">integer programming</a> problem seeking to service customers on a trip after change of schedule such as vehicle break down or major delay. Proposed by Li, Mirchandani and Borenstein in 2007, the VRSP is an important problem in the fields of transportation and logistics. </p><p>Determining the optimal solution is an <a href="/facts/NP-hard/mQeNPv4R">NP-complete</a> problem in <a href="/facts/Combinatorial_optimization/PTcloS79">combinatorial optimization</a>, so in practice heuristic and deterministic methods are used to find acceptably good solutions for the VRSP. </p>