A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours
Author:
Publisher
Elsevier BV
Subject
General Engineering,General Computer Science
Reference39 articles.
1. An improved branch-and-cut algorithm for the capacitated vehicle routing problem;Achuthan;Transportation Science,2003
2. Network hub location problems: The state of the art;Alumur;European Journal of Operational Research,2008
3. Applying genetic algorithm to a new location and routing model of hazardous materials;Ardjmand;International Journal of Production Research,2015
4. Integrated facility location and vehicle routing models: Recent work and future prospects;Balakrishnan;American Journal of Mathematical and Management Sciences,1987
5. A branch-and-cut method for the capacitated location-routing problem;Belenguer;Computers & Operations Research,2011
Cited by 32 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Road-Rail Intermodal Hubs Site Selection Based on Road Freight Demand Mining – A Case from Beijing-Tianjin-Hebei Region;Promet - Traffic&Transportation;2024-06-20
2. Discrete Facility Location Problems;International Series in Operations Research & Management Science;2024
3. An enhanced Modelling approach for warehouse sharing platform system designing problem;Asian Transport Studies;2024
4. Multi-period single-allocation hub location-routing: Models and heuristic solutions;European Journal of Operational Research;2023-10
5. Routing and scheduling decisions for a single-hub same-day delivery network;Journal of Engineering Research;2023-09
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3