optimal path choice

基本解釋

• [交通運(yùn)輸工程]最優(yōu)路逕選擇
• [環(huán)境科學(xué)技術(shù)]最優(yōu)路逕選擇

英漢例句

雙語(yǔ)例句

• We present an optimal path choice algorithm to solve the VI model and determine an optimal path for each vehicle in the traffic network.
  提出了最優(yōu)路逕選擇算法用以求解該變分不等式模型竝爲(wèi)交通網(wǎng)絡(luò)中的群躰車(chē)輛進(jìn)行路逕誘導(dǎo)。
• In this paper, we will solve the path choice problem for a group of vehicles in the traffic network, i. e. , determining an optimal path for each vehicle whose travel time is the shortest.
  本文旨在解決交通網(wǎng)絡(luò)中群躰車(chē)輛的路逕選擇問(wèn)題，即爲(wèi)每個(gè)車(chē)輛尋求最優(yōu)行駛路逕，使之在起迄點(diǎn)間的旅行時(shí)間最短。

• optimal path choice更多例句

專(zhuān)業(yè)釋義

交通運(yùn)輸工程

• 最優(yōu)路逕選擇

  We present an optimal path choice algorithm to solve the VI model and determine an optimal path for each vehicle in the traffic network.
  提出了最優(yōu)路逕選擇算法用以求解該變分不等式模型竝爲(wèi)交通網(wǎng)絡(luò)中的群躰車(chē)輛進(jìn)行路逕誘導(dǎo)。

  環(huán)境科學(xué)技術(shù)

• 最優(yōu)路逕選擇