A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
Author:
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Subject
General Engineering
Link
https://pubsonline.informs.org/doi/pdf/10.1287/ijoc.11.2.161
Reference19 articles.
1. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
2. Set partitioning based heuristics for interactive routing
3. Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
4. Bases for Vehicle Fleet Scheduling
Cited by 46 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows;INFORMS Journal on Computing;2023-01
2. Evaluation of Using Genetic Algorithm and ArcGIS for Determining the Optimal-Time Path in the Optimization of Vehicle Routing Applications;Mathematical Problems in Engineering;2022-09-27
3. An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem;Mathematical Programming Computation;2022-07-02
4. Multi-objective optimization of costs and energy efficiency associated with autonomous industrial processes for sustainable growth;Technological Forecasting and Social Change;2021-12
5. Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting;International Journal on Artificial Intelligence Tools;2020-06
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3