Online Storage Systems And Transportation Problems With Applications: Optimization Models - Couverture rigide

Kallrath, Julia

Couverture rigide

ISBN 10 : 1402029713 ISBN 13 : 9781402029714

Editeur : Springer-Verlag New York Inc., 2004

Synopsis

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.

A propos du livre

À propos de la quatrième de couverture

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.

Détails de l'édition

• Éditeur: Springer-Verlag New York Inc.
• Date d'édition: 2004
• Langue: anglais
• ISBN 10: 1402029713
• ISBN 13: 9781402029714
• Reliure: Relié
• Nombre de pages: 222
• Coordonnées du fabricant: ProductSafety@springernature.com; ProductSafety@springernature.com; ; Europaplatz 3; Heidelberg; 69115; Allemagne