Vehicle rescheduling problem
The vehicle rescheduling problem (VRSP) is a combinatorial optimization and integer programming 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. Determining the optimal solution is an NP-complete problem in combinatorial optimization, so in practice heuristic and deterministic methods are used to find acceptably good solutions for the VRSP.
Link from a Wikipage to another Wikipage
primaryTopic
Vehicle rescheduling problem
The vehicle rescheduling problem (VRSP) is a combinatorial optimization and integer programming 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. Determining the optimal solution is an NP-complete problem in combinatorial optimization, so in practice heuristic and deterministic methods are used to find acceptably good solutions for the VRSP.
has abstract
The vehicle rescheduling probl ...... y good solutions for the VRSP.
@en
Link from a Wikipage to an external page
Wikipage page ID
43,175,401
page length (characters) of wiki page
Wikipage revision ID
997,453,045
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
The vehicle rescheduling probl ...... y good solutions for the VRSP.
@en
label
Vehicle rescheduling problem
@en