Online Storage Systems and Transportation Problems with Applications

Name: Online Storage Systems and Transportation Problems with Applications
Brand: Springer-Verlag New York Inc.
SKU: 9781489981059
Price: 755.81 RON
Availability: InStock

Optimization Models and Mathematical Solutions

Autor: Julia Kallrath

Limbă:

Legare: Carte broșată

Editura: Springer-Verlag New York Inc.

Disponibilitate: În depozitul extern

Expediem în 5-8 zile

755.81 lei

Appendices A Rotastore A. l Tabular Results for Different Models A. 2 Tabular Results for Different...

Informații despre carte

Autor

Julia Kallrath

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

2014

Pagini

222

EAN

9781489981059

ISBN

9781489981059

Enbook ID

09128294

Editura

Springer-Verlag New York Inc.

Greutate

373

Dimensiuni

155 x 13 x 14

Descriere completă

Appendices A Rotastore A. l Tabular Results for Different Models A. 2 Tabular Results for Different Algorithms B OptiTrans B. l Input Data B. l. l Input Data Common to all Solution Approaches B. 1. 2 Specific Input Data for the MILP Model and the Column Enumeration Approach B. 1. 3 Specific Input Data for the Heuristic Methods B. 1. 3. 1 Penalty Criteria B. 1. 3. 2 Control Parameters of the OptiTrans Software B. 2 Tabular Results B. 2. 1 Tabular Results for the MILP Model B. 2. 2 Tabular Results for the Heuristic Methods B. 2. 2. 1 Input Data for a Whole Day - Offline Analysis B. 2. 2. 2 Results for CIH and SA References Index Preface This book covers the analysis and development of online algorithms involving exact optimization and heuristic techniques, and their appli- tion 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 Pr- lem (BPSP) which is not easy to solve optimally in offline situations. We consider a polynomial case and develope an exact algorithm for offline situations. Competitive analysis showed that the proposed online - gorithm is 312-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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Online Storage Systems and Transportation Problems with Applications

Optimization Models and Mathematical Solutions

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și