找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computational Logistics; 14th International C Joachim R. Daduna,Gernot Liedtke,Stefan Voß Conference proceedings 2023 The Editor(s) (if app

[复制链接]
查看: 10674|回复: 58
发表于 2025-3-21 16:41:54 | 显示全部楼层 |阅读模式
书目名称Computational Logistics
副标题14th International C
编辑Joachim R. Daduna,Gernot Liedtke,Stefan Voß
视频videohttp://file.papertrans.cn/233/232638/232638.mp4
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Computational Logistics; 14th International C Joachim R. Daduna,Gernot Liedtke,Stefan Voß Conference proceedings 2023 The Editor(s) (if app
描述.This book constitutes the refereed proceedings of the 13th International Conference on Computational Logistics, ICCL 2023, held in Berlin, Germany, during September 6-8, 2023...The 32 full papers presented in this volume were carefully reviewed and selected from 71 submissions. .They are grouped into the following topics: ​computational logistics; maritime shipping; vehicle routing; traffic and transport; and combinatorial optimization..
出版日期Conference proceedings 2023
关键词computational logistics; maritime shipping; container terminal; vehicle routing; combinatorial optimizat
版次1
doihttps://doi.org/10.1007/978-3-031-43612-3
isbn_softcover978-3-031-43611-6
isbn_ebook978-3-031-43612-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
The information of publication is updating

书目名称Computational Logistics影响因子(影响力)




书目名称Computational Logistics影响因子(影响力)学科排名




书目名称Computational Logistics网络公开度




书目名称Computational Logistics网络公开度学科排名




书目名称Computational Logistics被引频次




书目名称Computational Logistics被引频次学科排名




书目名称Computational Logistics年度引用




书目名称Computational Logistics年度引用学科排名




书目名称Computational Logistics读者反馈




书目名称Computational Logistics读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:42:07 | 显示全部楼层
发表于 2025-3-22 02:43:19 | 显示全部楼层
https://doi.org/10.1007/978-3-031-43612-3computational logistics; maritime shipping; container terminal; vehicle routing; combinatorial optimizat
发表于 2025-3-22 06:14:01 | 显示全部楼层
发表于 2025-3-22 11:36:31 | 显示全部楼层
发表于 2025-3-22 15:12:43 | 显示全部楼层
https://doi.org/10.1007/978-3-658-33729-2drivers). Thus, the efficiency of such operating model lies in the successful matching of demand and supply, i.e., how to match the delivery tasks with suitable drivers that will result in successful assignment and completion of the tasks. We consider a Same-Day Delivery Problem (SDDP) involving a P
发表于 2025-3-22 17:15:34 | 显示全部楼层
Vorbereitung der empirischen Erhebungollecting and delivering these items within a hospital can be modeled as a Pickup and Delivery Problem with Time Windows (PDPTW). This paper proposes a hybrid dynamic optimization to address the IHL problem based on a two-step heuristic. This algorithm combines reactive and periodic optimizations to
发表于 2025-3-22 21:51:45 | 显示全部楼层
发表于 2025-3-23 02:38:54 | 显示全部楼层
发表于 2025-3-23 06:24:20 | 显示全部楼层
Angelika Schmidt-Koddenberg,Annette Mülleryage. Due to a large variety of combinatorial aspects, a scalable algorithm to solve a representative problem is yet to be found. This paper will show that deep reinforcement learning can optimize a non-trivial master bay planning problem. Our experiments show that proximal policy optimization effic
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-14 20:48
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表