首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A Lagrangean relaxation heuristic for vehicle routing
Authors:William R Stewart  Bruce L Golden
Institution:School of Business, College of William and Mary, Williamsburg, VA 23185, U.S.A.;College of Business and Management, University of Maryland, College Park, MD 20742, U.S.A.
Abstract:This paper presents a new heuristic algorithm for the vehicle routing problem (VRP) which makes use of Lagrangean relaxation to transform the VRP into a modified m-traveling salesman problem. Application of the proposed algorithm to test problems from the literature has produced new best-known solutions.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号