找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Hybrid Metaheuristics; 7th International Wo María J. Blesa,Christian Blum,Michael Sampels Conference proceedings 2010 The Editor(s) (if app

[复制链接]
楼主: Detrusor-Muscle
发表于 2025-3-25 05:53:15 | 显示全部楼层
On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An ity checks. We examine the case of the vehicle routing problem with two-dimensional loading constraints, which combines the loading of freight into the vehicles and the routing of the vehicles to satisfy the demands of the customers. The problem is solved by a variable neighborhood search for the ro
发表于 2025-3-25 10:53:20 | 显示全部楼层
Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periogeneral periodic LRP (PLRP). For this, previous successful VNS algorithms for related problems are considered and accordingly adapted as well as extended. The VNS is subsequently combined with three very large neighborhood searches (VLNS) based on integer linear programming: Two operate on whole rou
发表于 2025-3-25 12:53:05 | 显示全部楼层
发表于 2025-3-25 18:02:23 | 显示全部楼层
发表于 2025-3-25 23:43:22 | 显示全部楼层
978-3-642-16053-0The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer-Verlag GmbH, DE
发表于 2025-3-26 02:28:44 | 显示全部楼层
Hybrid Metaheuristics978-3-642-16054-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-26 06:37:49 | 显示全部楼层
0302-9743 Overview: 978-3-642-16053-0978-3-642-16054-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-26 10:21:27 | 显示全部楼层
https://doi.org/10.1007/978-3-642-16054-7Scheduling; algorithms; bioinformatics; co-operative search; design; empirical comparison; expert systems;
发表于 2025-3-26 16:15:18 | 显示全部楼层
Survey: Matheuristics for Rich Vehicle Routing Problems,This paper surveys recent developments of hybrid solution techniques for different vehicle routing problems. Only hybridizations of heuristic and exact solution techniques are considered. Most of the existing hybrid approaches are based on set-covering formulations, local branching or different decomposition techniques.
发表于 2025-3-26 18:52:19 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-11 02:35
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表