具有线性时间复杂度的改进八步可行性检查程序用于拨召问题(DARP)
Revised eight-step feasibility checking procedure with linear time complexity for the Dial-a-Ride Problem (DARP)
Computers and Operations Research · 2024
被引 7
ABS 3
- Somayeh Sohrabi
- Koorush Ziarati
- Morteza Keshtkaran 通讯
运筹学组合优化算法设计交通规划