The green vehicle routing problem: A heuristic based exact solution approach.

Applied Soft Computing(2016)

引用 158|浏览118
暂无评分
摘要
•We develop a solution approach to solve the green vehicle routing problem.•We propose a simulated annealing heuristic to improve the quality of solutions.•We present a new formulation having fewer variable and constraints.•We evaluate the algorithm in terms of the several performance criterions.•Our algorithm is able to optimally solve 22 of 40 benchmark instances.
更多
查看译文
关键词
The green vehicle routing problem,Mixed integer programming formulation,Branch-and-cut algorithm,Simulated annealing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要