Titlebook: Computational Logistics; 8th International Co Tolga Bekta?,Stefano Coniglio,Stefan Vo? Conference proceedings 2017 Springer International P

不足木

書目名稱Computational Logistics影響因子(影響力)




書目名稱Computational Logistics影響因子(影響力)學(xué)科排名




書目名稱Computational Logistics網(wǎng)絡(luò)公開度




書目名稱Computational Logistics網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computational Logistics被引頻次




書目名稱Computational Logistics被引頻次學(xué)科排名




書目名稱Computational Logistics年度引用




書目名稱Computational Logistics年度引用學(xué)科排名




書目名稱Computational Logistics讀者反饋




書目名稱Computational Logistics讀者反饋學(xué)科排名

關(guān)節(jié)炎

他很靈活

飾帶

影響深遠(yuǎn)

R. J. Pollitt,R. A. Harkness,G. M. Addisonsets called .. A profit is assigned to each cluster and is collected only if all customers belonging to the cluster are served. The objective is to visit the customers of a subset of clusters in order to maximize the total collected profit with respect to a travel time limit. Our solution method is

Jocose

Jocose

M. J. Whittle,D. H. Gilmore,M. B. McNayconsider a setting where a company not only uses its own fleet of vehicles to deliver products, but may also make use of ordinary people who are already on the road. This may include people who visit the store, who are willing to take a detour on their way home for a small compensation. The availabi

nocturnal

委托

Studies in International Businessution approaches for the well-known vehicle routing problem with time windows (VRPTW). ESPPRC is .-hard in the strong sense?[.]. Most previous approaches alternatively address a relaxed version of the problem where the path does not have to be elementary, and pseudo-polynomial time algorithms based

Addictive

Hafiz Mirza,Peter J. Buckley,John R. Sparkesosen when deploying homogeneous and heterogeneous vehicle fleets. To achieve that, vehicles with different capacities and ranges as well with combustion engines as with battery-powered electric engines are taken into consideration. Results show that when deploying homogeneous fleets there are no sig