机译:带有强制回程的双目标车辆路径问题的改进的节省启发法和遗传算法
Department of Mechanical Engineering, Amrita School of Engineering, Amrita Vishwa Vidyapeetham, Ettimadai, Coimbatore 641105, Tamil Nadu, India;
Global Business Services - Global Delivery, IBM India Private Limited, Bandra East, Mumbai 400051, Maharashtra, India;
Logistics and Supply Chain Management (LSCM) Research Centre, Management School, The University of Sheffield, 9 Mappin Street, Sheffield SI 4DT, UK;
University of Bordeaux, IMS-LAPS-CRAI - UMR 5218 CNRS, 351 cours de la Liberation, 33405 Talence cedex, France;
genetic algorithms; bi-objective vehicle routing problem with; forced backhauls; modified savings heuristics; bank industry;
机译:与FIFO假设的回程的时间依赖的车辆路由问题:可变邻域搜索和MAT-启发式变量邻域搜索算法
机译:基于禁忌搜索的带回程的车辆路径问题的启发式算法
机译:具有回程和时间窗的车辆路径问题的高级混合元启发式算法
机译:带回程的多类型车辆路径问题的混合遗传算法研究
机译:带回程的车辆路径问题的一种新算法
机译:基于克拉克-赖特算法的启发式方法求解开放车辆路径问题
机译:基于禁忌搜索带回程车辆路径问题的启发式算法