楼主: Toyotomi
134468 1

[计划与控制] Online Storage Systems and Transportation Problems with Applications Optimizatio [推广有奖]

贵宾

大师

1%

还不是VIP/贵宾

-

TA的文库  其他...

商学院英文书籍

威望
3
论坛币
492811 个
通用积分
66.1357
学术水平
1058 点
热心指数
1455 点
信用等级
1031 点
经验
127830 点
帖子
6622
精华
5
在线时间
2849 小时
注册时间
2009-12-29
最后登录
2022-3-11

初级热心勋章 初级学术勋章 初级信用勋章 中级热心勋章 中级学术勋章 高级热心勋章 高级学术勋章 中级信用勋章 特级热心勋章 高级信用勋章 特级学术勋章

相似文件 换一批

+2 论坛币
k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群
赵安豆老师微信:zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

感谢您参与论坛问题回答

经管之家送您两个论坛币!

+2 论坛币
Applied Optimization
              Volume              912005
Online Storage Systems and Transportation Problems with ApplicationsOptimization Models and Mathematical Solutions Online Storage Systems and Transportation Problems with Applications Optimizatio Authors:
ISBN: 978-1-4020-2971-4 (Print) 978-0-387-23485-4  (Online)

About this book

This books covers the analysis and development of online algorithms involving exact optimization and heuristic techniques, and their application to solve two real life problems.
The first problem is concerned with a complex technical system: a special carousel based high-speed storage system - Rotastore. It is shown that this logistic problem leads to an NP-hard Batch PreSorting problem which is not easy to solve optimally in offline situations. The author considered a polynomial case and developed an exact algorithm for offline situations. Competitive analysis showed that the proposed online algorithm is 3/2-competitive. Online algorithms with lookahead, improve the online solutions in particular cases. If the capacity constraint on additional storage is neglected the problem has a totally unimodular polyhedron.
The second problem originates in the health sector and leads to a vehicle routing problem. Reasonable solutions for the offline case covering a whole day with a few hundred orders are constructed with a heuristic approach, as well as by simulated annealing. Optimal solutions for typical online instances are computed by an efficient column enumeration approach leading to a set partitioning problem and a set of routing-scheduling subproblems. The latter are solved exactly with a branch-and-bound method which prunes nodes if they are value-dominated by previous found solutions or if they are infeasible with respect to the capacity or temporal constraints. The branch-and-bound method developed is suitable to solve any kind of sequencing-scheduling problem involving accumulative objective functions and constraints, which can be evaluated sequentially. The column enumeration approach the author has developed to solve this hospital problem is of general nature and thus can be embedded into any decision-support system involving assigning, sequencing and scheduling.

Table of contents / Sample pages Introduction.- Batch Processing Problems I.- Batch Presorting Problems II.- Vehicle Routing Problems in Hospitals I.- Vehicle Routing Problems in Hospitals II.- Summary.- References.- Index.

From the reviews of the first edition:
"The book contains two well-performed case studies, which include thorough analysis of complexity, modelling of problems, design and implementation of solving algorithms and their verification, testing and comparison. … Real-world instances of the problems in offline and online form were used to verify and compare the individual algorithms and their combinations. The associated results are reported in the appendices to complete the studies." (Jaroslav Janácek, Zentralblatt MATH, Vol. 1083, 2006)




Online Storage Systems and Transportation Problems with Applications Optimizatio.pdf (5.26 MB, 需要: 5 个论坛币)




二维码

扫码加我 拉你入群

请注明:姓名-公司-职位

以便审核进群资格,未注明则拒绝

关键词:Applications Transportat Application Transport Problems Online first all techniques concerned

本帖被以下文库推荐

I am looking for a talent scout who may appreciate me...

>>>>>>>生产和运营管理<<<<<<<
沙发
olderp 发表于 2013-9-16 12:00:34 |只看作者 |坛友微信交流群
在线优化其实有很多值得研究的东东啊。

使用道具

您需要登录后才可以回帖 登录 | 我要注册

本版微信群
加JingGuanBbs
拉您进交流群

京ICP备16021002-2号 京B2-20170662号 京公网安备 11010802022788号 论坛法律顾问:王进律师 知识产权保护声明   免责及隐私声明

GMT+8, 2024-5-1 04:21