Cantitate/Preț
Produs
Total produse
Vezi coșul
Online Storage Systems and Transportation Problems with Applications: Optimization Models and Mathematical Solutions de Julia Kallrath

Online Storage Systems and Transportation Problems with Applications: Optimization Models and Mathematical Solutions: Applied Optimization, cartea 91

Autor Julia Kallrath
en Limba Engleză Paperback – 21 noi 2014
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 86411 lei  6-8 săpt.
  Springer Us – 21 noi 2014 86411 lei  6-8 săpt.
Hardback (1) 63083 lei  6-8 săpt.
  Springer Us – 18 noi 2004 63083 lei  6-8 săpt.

Din seria Applied Optimization

Preț: 86411 lei

Preț vechi: 105379 lei
-18% Nou

Puncte Express: 1296
Preț estimativ în valută:
16542€ • 17220$ • 13618£

Carte tipărită la comandă

Livrare economică 01-15 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781489981059
ISBN-10: 1489981055
Pagini: 240
Ilustrații: XIV, 222 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.34 kg
Ediția:2005
Editura: Springer Us
Colecția Springer
Seria Applied Optimization

Locul publicării:New York, NY, United States

Public țintă

Professional/practitioner

Cuprins

Batch Presorting Problems. I Models and Solution Approaches.- Batch Presorting Problems. II Applications in Inventory Logistics.- Vehicle Routing Problems in Hospital Transportation. I Models and Solution Approaches.- Vehicle Routing Problems in Hospital Transportation. II Applications and Case Studies.- Summary.

Recenzii

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)

Textul de pe ultima copertă

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.

Caracteristici

Unique way in which challenging real world problems are solved by exploiting the advantages of several solution techniques which are usually not used simultaneously The algorithms developed are inspiring to solve other real world problems Includes supplementary material: sn.pub/extras