找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Evolutionary Computation in Combinatorial Optimization; 8th European Confere Jano Hemert,Carlos Cotta Conference proceedings 2008 Springer-

[复制链接]
楼主: Buren
发表于 2025-4-1 03:40:07 | 显示全部楼层
,Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignmen random instances. We analyze the properties of several instances in detail and propose an improved construction heuristic to handle ‘problematic’ instances. Our iterated local search finds the optimum for most instances.
发表于 2025-4-1 08:09:09 | 显示全部楼层
Improving Metaheuristic Performance by Evolving a Variable Fitness Function,ple objectives can be defined through evolutionary changes in the search direction. We show that the VFF significantly improves performance of constructive and VNS approaches on training problems, and “learn” problem features which enhance the performance on unseen test problem instances.
发表于 2025-4-1 11:57:50 | 显示全部楼层
发表于 2025-4-1 15:36:44 | 显示全部楼层
发表于 2025-4-1 21:32:11 | 显示全部楼层
发表于 2025-4-1 23:49:00 | 显示全部楼层
发表于 2025-4-2 05:51:28 | 显示全部楼层
发表于 2025-4-2 08:45:56 | 显示全部楼层
Efficient Local Search Limitation Strategies for Vehicle Routing Problems, routing problem deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation costs. The examined strategies are applied to three standard neighborhoods and implemented in a recently suggested powerful mem
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-26 23:22
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表