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


On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
Authors:Herbert F Lewis  Thomas R Sexton
Institution:College of Business, Stony Brook University, 319 Harriman Hall, Stony Brook University, Stony Brook, NY 11794-3775, USA
Abstract:The tour partitioning heuristic for the vehicle routing problem assumes an unlimited supply of vehicles. If the number of vehicles is fixed, this heuristic may produce infeasible solutions. We modify the heuristic to guarantee feasibility in this situation and we analyze the worst-case performance of the modified heuristic.
Keywords:Vehicle routing problem  Analysis of algorithms  Heuristic algorithm
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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