Téléchargez le livre : Online Storage Systems and Transportation Problems with Applications

Online Storage Systems and Transportation Problems with Applications

Optimization Models and Mathematical Solutions

Éditeur :

Springer

Paru le : 2006-07-25

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 Da...
Voir tout
Ce livre est accessible aux handicaps Voir les informations d'accessibilité
Ebook téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Compatible lecture en ligne (streaming)
94,94 €
Ajouter à ma liste d'envies
Téléchargement immédiat
Dès validation de votre commande
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

badge apple Application Louise Reader
badge Android Application Louise Reader

Description du livre

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.

À propos

Auteur
Julia Kallrath
Éditeur
Springer
Collection
n.c
Parution
2006-07-25
Pages
222 pages
EAN papier
9781402029714

Auteur(s) du livre


Defaut-Illustration Julia Kallrath

Caractéristiques détaillées - droits

EAN PDF
9780387234854
Prix
94,94 €
Nombre pages copiables
2
Nombre pages imprimables
22
Taille du fichier
5376 Ko
Ce livre est accessible aux handicaps informations d'accessibilité

Suggestions personnalisées