找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Computational Logistics; 10th International C Carlos Paternina-Arboleda,Stefan Vo? Conference proceedings 2019 Springer Nature Switzerland

[復制鏈接]
樓主: Obsolescent
21#
發(fā)表于 2025-3-25 04:07:58 | 只看該作者
0302-9743 ombia, in September/October 2019. ..The 27 papers included in this book were carefully reviewed and selected from 49 submissions. They were organized in topical sections named: freight transportation and urban logistics; maritime and port logistics; vehicle routing problems; network design and distr
22#
發(fā)表于 2025-3-25 08:08:56 | 只看該作者
23#
發(fā)表于 2025-3-25 14:19:13 | 只看該作者
24#
發(fā)表于 2025-3-25 19:17:45 | 只看該作者
Optimal Solutions for the Vehicle Routing Problem with Split Demands integer solutions. Computational results on benchmark instances show the performance of the algorithm compared with other approaches found in the literature. In particular, the new algorithm is able to solve a testbed SDVRP instance that was unsolved in the literature.
25#
發(fā)表于 2025-3-25 22:35:17 | 只看該作者
A Two-Pheromone Trail Ant Colony System Approach for the Heterogeneous Vehicle Routing Problem with omone to minimize routing cost and vehicle fleet size. Experiments conducted using instances from the literature show that the proposed approach provides competitive solutions in relatively short computational times.
26#
發(fā)表于 2025-3-26 04:10:51 | 只看該作者
27#
發(fā)表于 2025-3-26 05:02:35 | 只看該作者
Caribbean Ports, Inland Logistics, and the Panama Canal Expansion: A Mode and Port Choice Analysistive purpose and its usability to carry sensitivity analyses of scenarios. The overriding outcome is that the model could guide governmental decisions on the infrastructures domain by demonstrating their effect in the logistic realm.
28#
發(fā)表于 2025-3-26 09:08:16 | 只看該作者
29#
發(fā)表于 2025-3-26 13:02:15 | 只看該作者
https://doi.org/10.1007/978-1-4615-5665-7of test instances available in the literature. The results obtained are compared with the optimal solutions of the test instances. According to this comparison, the proposed method provides optimal solutions or solutions very close to the optimal solution with a reasonable computational effort compared to that required by an exact solution method.
30#
發(fā)表于 2025-3-26 18:59:56 | 只看該作者
Human–Computer Interaction Seriesing time is minimized, often solutions achieving also a minimum number of relocations are found. Based on our analysis, the consideration of alternative objectives like crane working time is recommended.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-12 14:37
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復 返回頂部 返回列表
汶上县| 潞城市| 泉州市| 彭阳县| 保康县| 漠河县| 辽宁省| 饶阳县| 崇信县| 阜康市| 如皋市| 宾阳县| 弥渡县| 潮安县| 武平县| 白河县| 肇源县| 松潘县| 富顺县| 彰化县| 清流县| 加查县| 额济纳旗| 连山| 葫芦岛市| 古丈县| 清原| 安多县| 溆浦县| 临汾市| 凌云县| 新宁县| 白朗县| 温宿县| 永川市| 赤水市| 会泽县| 方城县| 历史| 获嘉县| 镇远县|