机译:VRP和SDVRP的复杂性
University of Brescia, Department of Quantitative Methods, Contrada Santa Chiara 50, Brescia, 1-25122, Italy;
Ecole des Mines de Saint-Etienne, CMP Georges Charpak, Gardanne, F-13541, France;
ClRRELT and Universite de Montreal, C.P. 6128, succ. Centre-ville, Montreal (Quebec), Canada, H3C 3J7, Canada;
University of Brescia, Department of Quantitative Methods, Contrada Santa Chiara 50, Brescia, 1-25122, Italy;
vehicle routing problem; split delivery vehicle routing problem; computational complexity on line; tree; star; circle;
机译:VRP,OVRP和VRP的元启发式和启发式算法的组合,同时具有提取和交付功能
机译:双斯特兰德妥塞巴灭虫坪HVRPS18ANDHVRPL13REVEAL潜在目标,用于害虫管理28斑点的瓢虫,羊皮氏菌脊椎针刺
机译:基于萤火虫的过渡进化蚁群算法求解车辆路径问题:针对VRP的EAFA
机译:加载是关键:SDVRP的新型遗传量子算法
机译:使用车辆路径问题(VRP)为农业提供物流解决方案
机译:疾病抗性抵抗假单胞菌SYRINGAE5的蛋白激酶AVRPPHB SUSCEPTIBLEBLE1的识别取决于S-酰化作用和AVRPPHB SUSCEPTIBLE1中的裸露环
机译:关于VRPT中列一代的最短路径模型的复杂性