Using Modeling to Solve Warehousing Problems PDF Download

Author: Maida Napolitano
Publisher:
ISBN:
Category : Warehouses
Languages : en
Pages :

View

Book Description

Author: Iman Niroomand
Publisher:
ISBN:
Category :
Languages : en
Pages : 0

View

Book Description
The Capacitated Warehouse Location consists of determining the number and locations of capacitated warehouses on a set of potential sites such that demands of predefined customers are met. Two typical assumptions in modeling this problem are: the capacity of warehouses is constant and that warehouses are able to truly satisfy customer demands. However, while these kinds of assumptions define a well structured problem from the mathematical modeling perspective, they are not realistic. In this thesis we relaxed such constraints based on the fact that warehouses can be built in various sizes and also warehouses can put in orders for unsatisfied customers' demand directly to the manufacturing plant with additional costs. This flexibility can lead to best decision making ability for managers and supply chain specialists to decide between higher capacity level with higher fixed and variable costs at the warehouse or direct ordering from the manufacturing plant. A new non linear integer programming formulation with staircase costs for multiple commodities in supply chain network is presented, and new method for linearizing the model is described. Computational results indicate that reasonably good solution can be obtained by the proposed linear model. Also for solving larger problems we developed a Tabu Search algorithm. The comparisons of the result between nonlinear/linear model and the Tabu Search algorithm are also presented.

Author: Li Pan
Publisher: Open Dissertation Press
ISBN: 9781361311349
Category :
Languages : en
Pages :

View

Book Description
This dissertation, "Mathematical Modeling for Warehouse Logistics: Stock Loading and Order Picking" by Li, Pan, 潘莉, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. Abstract: Logistics makes extensive use of human and material resources to achieve a target level of customer service at the lowest possible cost. It has been recognized as a major key to success in commerce and industry, and continues to evolve radically and grow in importance in recent years. Warehousing, as one of the most costly elements of logistics, is often the central operation in most logistics networks. Its successful management is critical in terms of both cost and service. In this thesis, two problem areas in warehouse logistics are studied: stock loading and order picking. Stock loading is an essential operation in modern logistics. Improvement on container capacity utilization and loading efficiency significantly reduces costs. For a given set of boxes in different sizes and an unlimited number of identical containers, the basic cargo loading problem is to determine the minimum number of containers required. The problem is proven NP-hard. To tackle this problem, a Tabu search optimization with a tree-based cargo loading algorithm as its inner heuristic is proposed. This approach has flexibility in taking different box conditions into consideration, and can find better solutions on average than other recent meta- or heuristic algorithms. Decreasing order sizes and increasing fuel costs provide a strong incentive for the inner-city truck loading operation to utilize container space more efficiently in transporting goods to multiple clients during one trip. This considers not only traditional loading constraints, but also multi-drop requirements. A wallbuilding heuristics based on a binary tree data structure is proposed to handle these side constraints. A dynamic space decomposition approach, together with a repacking and space amalgamation strategy, permits an efficient and effective loading plan. Order picking, one of the most critical warehousing operations, is the second problem studied in this thesis. An analytical approximation model is proposed based on probability modeling and queueing network theory applied to a synchronized zone picker-to-part order picking system with different routing and ABC-class inventory storage policies. The numerical results are compared and validated via simulation. The resulting model can therefore be usefully applied in the design and selection process of order picking systems. The routing versus storage issues are further investigated with a simulation model. This extends the existing research by evaluating multiple routing and storage policies under varying operating conditions. Results show that the midpoint, return and traversal routing policies generally perform best when paired with perimeter, across-aisle and within-aisle storage strategies, respectively. Yet performance is indeed dependent on demand patterns, zone sizes, batch sizes and order sizes. At first glance, order picking and stock loading operation seem to pursue different objectives. However, they are two related operations conducted sequentially from internal to the outbound side of warehousing. An efficient order picking system is a precondition for an effective loading operation at the sh

Author: Nita H. Shah
Publisher: Springer Nature
ISBN: 9811396981
Category : Business & Economics
Languages : en
Pages : 470

View

Book Description
This book discusses inventory models for determining optimal ordering policies using various optimization techniques, genetic algorithms, and data mining concepts. It also provides sensitivity analyses for the models’ robustness. It presents a collection of mathematical models that deal with real industry scenarios. All mathematical model solutions are provided with the help of various optimization techniques to determine optimal ordering policy. The book offers a range of perspectives on the implementation of optimization techniques, inflation, trade credit financing, fuzzy systems, human error, learning in production, inspection, green supply chains, closed supply chains, reworks, game theory approaches, genetic algorithms, and data mining, as well as research on big data applications for inventory management and control. Starting from deterministic inventory models, the book moves towards advanced inventory models. The content is divided into eight major sections: inventory control and management – inventory models with trade credit financing for imperfect quality items; environmental impact on ordering policies; impact of learning on the supply chain models; EOQ models considering warehousing; optimal ordering policies with data mining and PSO techniques; supply chain models in fuzzy environments; optimal production models for multi-items and multi-retailers; and a marketing model to understand buying behaviour. Given its scope, the book offers a valuable resource for practitioners, instructors, students and researchers alike. It also offers essential insights to help retailers/managers improve business functions and make more accurate and realistic decisions.

Author: E. Kay
Publisher: Elsevier
ISBN: 1483139581
Category : Business & Economics
Languages : en
Pages : 91

View

Book Description
A Mathematical Model for Handling in a Warehouse presents the formulation of a mathematical model for goods handling in a warehouse. This 11-chapter text specifically serves as a guide in decision-making in terms of the capacity, shape, and layout of a warehouse for a variety of available handling equipment under minimized total cost. The first seven chapters cover the overview, purpose, and applicability of the model; the role of stock distributions in movement within the warehouse; the problem of order picking; and the effect of time dependent storage policies on the model. The following chapters outline a formula for building cost and its link to handling effort, followed by a discussion on the use of the model when considering warehouse automation. These chapters also examine the mathematical aspects of the model. The concluding chapter provides some numerical examples to illustrate the use and applicability of the model in a specific warehouse handling condition. Mathematician and researchers in the related subjects of goods handling in a warehouse will find this work invaluable.

Author: Kerstin Baumgartner
Publisher: Kölner Wissenschaftsverlag
ISBN: 3937404821
Category : Business logistics
Languages : en
Pages : 157

View

Book Description

Author: John R. Vacca
Publisher: Elsevier
ISBN: 012816817X
Category : Political Science
Languages : en
Pages : 820

View

Book Description
Solving Urban Infrastructure Problems Using Smart City Technologies is the most complete guide for integrating next generation smart city technologies into the very foundation of urban areas worldwide, showing how to make urban areas more efficient, more sustainable, and safer. Smart cities are complex systems of systems that encompass all aspects of modern urban life. A key component of their success is creating an ecosystem of smart infrastructures that can work together to enable dynamic, real-time interactions between urban subsystems such as transportation, energy, healthcare, housing, food, entertainment, work, social interactions, and governance. Solving Urban Infrastructure Problems Using Smart City Technologies is a complete reference for building a holistic, system-level perspective on smart and sustainable cities, leveraging big data analytics and strategies for planning, zoning, and public policy. It offers in-depth coverage and practical solutions for how smart cities can utilize resident's intellectual and social capital, press environmental sustainability, increase personalization, mobility, and higher quality of life. - Brings together experts from academia, government and industry to offer state-of- the-art solutions for urban system problems, showing how smart technologies can be used to improve the lives of the billions of people living in cities across the globe - Demonstrates practical implementation solutions through real-life case studies - Enhances reader comprehension with learning aid such as hands-on exercises, questions and answers, checklists, chapter summaries, chapter review questions, exercise problems, and more

Author: Titaporn Karnsakulthon
Publisher:
ISBN:
Category :
Languages : en
Pages : 61

View

Book Description
This thesis considers problems of warehouse design and optimization under the assumptions of class-based storage policy and life cycle picking patterns. For this class of problems, Manzini et.al., (2015) present solution for determining storage capacity of each storage class based on new approach of life cycle picking patterns. The paper introduces a rolling measure of popularity which represents the number of accesses to specific product in a period of time. With some collected examples from this new measurement, the finding shows significantly differ value in a period of time. The paper suggests that this could result in different variable logistic cost due to picking and storage. In addition, a continuous mixed-integer linear programming model is developed, and the model is tested by using a numerical example, inspired by a publishing business. Based on this reference, the aim of this thesis is to simplify the existing mixed-integer programming formulation and to replicate the findings with a different set of data from a different industry. A mathematical programming language (AMPL) is used to translate this model into a computer-readable model that can be used to solve the problem. After testing the model, it shows that the original reference model from Manzini et al., (2015) can also be applied to the dataset from a different industry. Moreover, the results from the simplified model show that it is more economical to entirely select the manual storage system if the reassignment cost exits. However, if there is no cost for the re-assignment activity, it is more economical to adopt both manual storage system and also the system which offers a bit more automation system.

Author: mohammed khalil chikha
Publisher: kalil chika
ISBN:
Category : Technology & Engineering
Languages : en
Pages : 149

View

Book Description
this book explain how to model contents in a warehouse and take advanatge of the existing space in a warehouse

Author: Julia Kallrath
Publisher: Springer Science & Business Media
ISBN: 0387234853
Category : Mathematics
Languages : en
Pages : 230

View

Book Description
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.