Vehicle scheduling problem with hard time windows (VSPHTW) is a variation of vehicle scheduling problem (VSP), which is a typical NP-hard problem.

 
  • 帶硬時(shí)間窗的車(chē)輛路徑問(wèn)題(VSPHTW)是在基本的車(chē)輛路徑問(wèn)題(VSP)上增加了時(shí)間窗約束條件的一種變化形式,是一個(gè)典型的NP難題。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan