.png){kind=icon}
返回
Advanced vehicle routing algorithms for complex operations management problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfoodeng.2004.09.023.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Vehicle routing encompasses a whole class of complex optimization problems that target the derivation of minimum total cost routes for a number of resources (vehicles) located at a central point (depot) in order to service efficiently a number of demand points (customers). Several practical issues in the food industry, involving both production and transportation decisions are modelled as VRP instances and are hard combinatorial problems in the strong sense (NP-hard). For such problems, metaheuristics, i.e., general solution procedures that explore the solution space to identify high quality solutions and often embed some standard route construction and improvement algorithms have been proposed. This paper surveys the recent research efforts oil metaheuristic solution methodologies for the standard and most widely studied version of the Vehicle Routing Problem (VRP), i.e., the Capacitated VRP. The computational performance of each metaheuristic is presented for the 14 benchmark instances of Christofides et al. [Christofides, N., Mingozzi, A., & Toth, P. (1979). Combinatorial optimization (p. 315). Chichester: Wiley]. (c) 2004 Elsevier Ltd. All rights reserved.
Keyword:
vehicle routing problem
metaheuristics
optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.8
论文数:
1.1W
被引数:
3.3W
机构
暂无机构信息
引用论文
Organocatalyzed atom transfer radical polymerization driven by visible light可见光驱动的有机催化原子转移自由基聚合.png)
Science
OAAI
ScienceIF0
OAAI分享收藏
Metaheuristics in combinatorial optimization: Overview and conceptual comparison组合优化中的元启发式: 概述和概念比较
PREAI
分享收藏分享收藏
查看更多内容