欢迎您!
东篱公司
退出
申报数据库
申报指南
立项数据库
成果数据库
期刊论文
会议论文
著 作
专 利
项目获奖数据库
位置:
成果数据库
>
会议
> 会议详情页
Tabu Assisted Guided Local Search Approaches for Freight Service Network Design
所属机构名称:宁波诺丁汉大学
会议名称:In the CD proceedings of the 8th International Conference on the Practice and Theory of of Automated
时间:2010.8.10
成果类型:会议
相关项目:供应链管理中高能效货物运输调度研究
作者:
Bai, Ruibin|Graham Kendall|
同会议论文项目
供应链管理中高能效货物运输调度研究
期刊论文 20
会议论文 21
同项目会议论文
A Simulated Annealing Hyper-heuristic: AdaptiveHeuristic Selection for Different Vehicle Routing Pro
Swarm Intelligence in Big Data Analytics
A Branch-and-price Approach for the Bidirectional Multi-shift Full Truckload Vehicle Routing Problem
A Canonical Representation for GeneticProgramming
A study of automated container truck travel timeprediction based on real-life GPS data Using ARIMA
A Decision Support Approach for Group Decision Making under Risk and Uncertainty
Why Evolution Is Not a Good Paradigm For Program Induction; A Critique of Genetic Programming
An Efficient Guided Local Search Approach for Service Network Design Problem with Asset Balancing
Simulated Annealing Hyper-heuristic: Adaptive Heuristic Selection for Different Vehicle Routing Prob
Memory Length in Hyper-heuristics: An Empirical Study
An Investigation of Automated Planograms Using a Simulated Annealing Based Hyper-heuristic
A Simulated Annealing Hyper-heuristic for University Course Timetabling Problem
A Game Theoretic Approach for the Taxi Scheduling Problem with Street Hailing
Sustainability Aspects in Transportation Service Procurement
A Variable Neighbourhood Search Algorithm with Compound Neighbourhoods for VRPTW
A Hybrid Genetic Algorithm for a Two-Stage Stochastic Portfolio Optimization With Uncertain Asset Pr
Modeling Urban Road Risky Driving Behaviors in China with Multi-agent Microscopic Traffic Simulation
A Combinatorial Algorithm for the Cardinality Constrained Portfolio Optimization Problem
Maintaining Population Diversity in Brain Storm Optimization Algorithm
A task based approach for a real-world commodity routing problem