找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Hybrid Metaheuristics; 9th International Wo Maria J. Blesa,Christian Blum,Stefan Vo? Conference proceedings 2014 Springer International Pub

[復制鏈接]
樓主: 變成小松鼠
21#
發(fā)表于 2025-3-25 03:24:50 | 只看該作者
Hybrid Metaheuristics978-3-319-07644-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
22#
發(fā)表于 2025-3-25 10:36:50 | 只看該作者
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/h/image/430136.jpg
23#
發(fā)表于 2025-3-25 12:13:57 | 只看該作者
Iterative Probabilistic Tree Search for the Minimum Common String Partition Problem,we propose an iterative probabilistic tree search algorithm for tackling this problem. By means of an extensive experimental evaluation we show the superiority of our approach in comparison to a standard greedy algorithm and a metaheuristic based on ant colony optimization from the related literature.
24#
發(fā)表于 2025-3-25 17:48:25 | 只看該作者
Conference proceedings 20142014. The 14 revised full papers presented were carefully reviewed and selected from 22 submissions. The selected papers cover both theoretical and experimental results, including new paradigmatic hybrid solvers and automatic design approaches as well as applications to logistics and public transport.
25#
發(fā)表于 2025-3-25 21:21:25 | 只看該作者
26#
發(fā)表于 2025-3-26 02:10:27 | 只看該作者
27#
發(fā)表于 2025-3-26 04:44:59 | 只看該作者
A Hybrid Metaheuristic to Solve the Resource Allocation Problem in Bike Sharing Systems,entals, however, leads to imbalances in the distribution of bikes causing full or empty stations..The resource allocation problem tackles imbalances at a tactical planning level by means of bike allocation and relocation. We propose a MIP formulation of an extended dynamic service network design mod
28#
發(fā)表于 2025-3-26 11:17:34 | 只看該作者
29#
發(fā)表于 2025-3-26 12:41:20 | 只看該作者
A Local Search Approach for Binary Programming: Feasibility Search,f feasible solutions. The method explicitly considers the structure of the problem as a conflict graph and uses a systematic neighbor generation procedure to jump from one feasible solution to another using chains of movements. Computational experiments comparing with two open source integer program
30#
發(fā)表于 2025-3-26 20:22:04 | 只看該作者
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-6 11:13
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
榆林市| 永吉县| 广安市| 化州市| 孟津县| 五台县| 钟祥市| 东兰县| 泾阳县| 泸溪县| 西畴县| 潍坊市| 清河县| 平阴县| 长丰县| 上栗县| 辽源市| 当雄县| 自贡市| 商城县| 农安县| 阳信县| 德清县| 伊通| 临泽县| 长寿区| 太湖县| 柯坪县| 永州市| 邯郸市| 垦利县| 黄石市| 台北市| 确山县| 措美县| 平陆县| 进贤县| 龙游县| 舒兰市| 阿尔山市| 明光市|