• Tidak ada hasil yang ditemukan

Global Logistics Management

N/A
N/A
Nguyễn Gia Hào

Academic year: 2023

Membagikan "Global Logistics Management"

Copied!
316
0
0

Teks penuh

MathWorks does not guarantee the accuracy of the text or exercises in this book. This book's use or discussion of MATLAB® software or related products does not constitute endorsement or sponsorship by The MathWorks of a particular pedagogical approach or particular use of MATLAB® software. The authors and publishers have attempted to trace the copyright holders of all material reproduced in this publication and apologize to the copyright holders if permission to publish in this form has not been obtained.

If any copyright material has not been acknowledged, please write and let us know so we can correct it in any future reprint. Copyright law, no part of this book may be reprinted, reproduced, transmitted or used in any form by any electronic, mechanical or other means, now known or hereafter invented, including photocopying, microfilming and recording, or stored in any information or recycling system, without written permission from the publishers. For permission to photocopy or use material from this work electronically, please go to www.copyright.

Visit the Taylor & Francis website at http://www.taylorandfrancis.com and the CRC Press website at http://www.crcpress.com. This book is dedicated to my dear husband Kadri, my lovely daughters Sıla and Maya, and my dear father İmdat, who has always been the inspiration of my life.

Preface

Editors

He earned BS and MS in industrial engineering from Middle East Technical University in 1982 and 1984, respectively. He is also on the editorial board of a number of scientific journals in the fields of industrial engineering and operations research. He is a member of the Institute of Industrial Engineering, Institute for Operations Research, Management Sciences and the Simulation Society.

He is also a member of the Council of Chairs of Academic Departments of Industrial Engineering (CIEADH) and various other professional and society committees. Roth Professor and Chair of the Department of Industrial Engineering at the University of Pittsburgh. He was previously Chairman of the Council of Heads of Academic Departments for Industrial Engineering (CIEADH) and also a member of the Board of Directors of the Institute of Industrial Engineers.

Bidanda is a fellow of the Institute of Industrial Engineers and is currently a commissioner on the ABET Engineering Accreditation Commission. In 2012, he received the John Imhoff Award for Global Excellence in Industrial Engineering from the American Society for Engineering Education.

Contributors

Ghorbani-Totkaleh Department of Industrial

Amin Nayeri

Sheikh Sajadieh Department of Industrial

Introduction

Introduction

In light of these observations, in this chapter we investigate tripartite logistic network optimization and provide a practical hybrid metaheuristic method. The model supports decision-making at the tactical level for daily planning and inventory management in the presence of demand variance. To deal with this problem, we extend our strategic approach to include some decisions at the operational level.

In particular, we address the multi-vehicle routing problem (M-VRP) while considering inventory management issues. By taking into account the dynamics of demand and warehouse stocks, we try to provide a practical approach that can innovatively solve everyday planning problems. Next, to examine some of the effects of demand variance on inventory levels, we conducted a parametric study on reorder points.

The ultimate goal of this study is to develop an integrated information and decision support system (DSS) that can dynamically manage relevant product resource and demand databases (see Figure 1.1). To realize this goal, additional work needs to be done, such as introducing variations of the basic idea and using parallel computing to increase the speed of finding solutions and improve information retrieval and visualization of results on a real map.

Problem Statements .1 Background of the Study

A recent review of articles published on supply chain management within the last decade has revealed a lack of models that capture dynamic aspects relevant to real-world applications and has emphasized the need for extensive research on this topic (Melo et al., 2009). Therefore, the number of studies is still growing due to the excellent advancements in both computer software and computer hardware. A popular problem studied at this level is called the vehicle routing problem (VRP; Yeun et al., 2008).

Recently, many researchers are interested in VRP with different collection and delivery configurations, as it is the most practical and appropriate way to consider reverse logistics (Min, 1989; Catay, 2010; Goksal et al., 2013). Instances of VRPSPD problem are common in the distribution system of bottled beverages, groceries, liquefied propane gas tanks, hotel laundry services, etc. Due to the difficulty of solving such problems, only small cases of VRP are solved to test its effectiveness. validate the approximations.

To solve the VRP in terms of the Ton-Kilo basis, we developed a hybrid approach consisting of a modified parsing method and modified tabu search (Shimizu, 2011b,c). Thus, it becomes necessary to resolve the inconsistency in cost accounting while facing the inherent rigidity of the problem.

Figure 1.1Global overview of a DSS for logistics planning.
Figure 1.1Global overview of a DSS for logistics planning.

Problem Formulation

At this level it is necessary to consider connections with both the upper (strategic) level and the lower (operational) level. In such problems, decisions about allocations to the depot are considered in addition to VRP. However, it is common to use the Ton-Kilo base at the strategic level and the Kilo base at the operational level.

Qj: Maximum capacity in warehouse j Sj: Maximum inventory in warehouse j Wv: Maximum capacity of vehicle v Index set.

DC J: Depot

  • Daily Decision Associated with Inventory Conditions .1 Multilevel Approach Incorporating Vehicle-Routing Problem
  • Numerical Experiments .1 Setup of Test Problem
  • Prospects for Further Applications .1 Variants of the Modified Savings Method
  • Conclusion
  • Introduction
  • Literature Review
  • Proposed Solution Methodology
  • Numerical Study
  • Conclusion
  • Introduction
  • Model Development
  • Model Analysis
  • Numerical Experimentation
  • Conclusions
  • Motivation
  • Related Work
  • Model Description
  • Solution Methodology
  • Case Study
  • Conclusions and Further Research Directions
  • Introduction
  • Route Selection Problem in the Arctic Region
  • Methodology .1 Linguistic Variable
  • GF-AHP Design and Application for Track Selection
  • Conclusion
  • Introduction
  • Problem Definition
  • Proposed Mathematical Models
  • Computational Results
  • Conclusion
  • Introduction
  • Quality Function Deployment
  • DEMATEL Method
  • Fusion of Fuzzy Information
  • MCDM Model for Supplier Evaluation
  • Case Study
  • Conclusion
  • Introduction and Problem Definition
  • Literature Review
  • Complexity Analysis
  • Mathematical Model

As noted in Anon (n.d.), general RM practices are classified into quantity-based RM and price-based RM. By constraint set (4.7), the number of vessels assigned to a berth at a given time is limited to 1. This study is part of a research project funded by TUBITAK (The Scientific and Technological Research Council of Turkey): 1001— Program Support Program for scientific and technological research projects grant no.

Figure 1.3  Flow chart of the solution procedure.
Figure 1.3 Flow chart of the solution procedure.

Gambar

Figure 1.1Global overview of a DSS for logistics planning.
Figure 1.2  Family tree of logistics optimization problems.
Figure 1.3  Flow chart of the solution procedure.
Figure 1.4  Example of an MCF graph. Note: Each digit refers to suffix in Table 1.1.
+7

Referensi

Dokumen terkait

Elevating Nomenclature Indices and Sets NLtype Number of line types Ωsb/Nsb Set/number of the existing and proposed substations Nsbtype Number of substation types ΩL/NL

Therefore, AC powerflow-based models may not be suitable for large-scale systems with considerable uncertainties of Nomenclature Sets&Indices i Index for network buses l Index for

Table 1: Detail of indices and sources of data Country Index Abbreviation Source of data used in paper India CNX S&P NIFTY 50 NIFTY www.nseindia.com Japan NIKKEI 225 NIKKEI

Symbol Description A Set of areas S Set of sites P Set of places P=A[S U Set of UAV-SCs T Set of Time Slots TSs ⌦, Source and sink nodes N Set of nodes N= P⇥T[{⌦}[{ } LMOV Set of

Nomenclature Indices i,j indices of buses k indices for binary variables Sets Ωb set of all buses Constants ai,bi,ci cost coefficients of active power generation at bus i$/MW2h,

1539 Indices 𝑖 Suppliers 𝑗 Customers 𝑘 Vehicle 𝐶𝐷 Cross-docking center Sets 𝑆 {1,2, …, 𝑛𝑠|𝑛𝑠 is number of suppliers} 𝐶 {1,2, …, 𝑛𝑠|𝑛𝑠 is number of customers} 𝑉 {1,2, …, 𝑛𝑠|𝑛𝑠 is

Nomenclature Indices i Product index,i=1, 2, · · ·, n j Workstation index,j=1, 2, · · ·, m k Machine index,k=1, 2,· · ·, mj t Time index,t=1, 2,· · ·,T p Simulated product index,p=1,