Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Information Sharing and Risk Management Read chapter Read first chapter

2017 | OriginalPaper | Chapter

4. Hybrid Manufacturing Distributed Inventory Management with Sharing Logistics

Authors : Xinbao Liu, Jun Pei, Lin Liu, Hao Cheng, Mi Zhou, Panos M. Pardalos

Published in: Optimization and Management in Manufacturing Engineering

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Manufacturing companies cannot focus only on tradition manufacturing modes if they want to ensure profitability and competitiveness. Business process reengineering (BPR) is helpful for manufacturing companies who hope to benefit from new approaches to business. Manufacturers are confronted by two problems: defining what technology is important to the manufacturing company for reconstructing their processes and improving their mode and how to improve their management method to maximizing the benefit of the new mode. In this chapter, we highlight a new manufacturing mode, hybrid manufacturing, and propose a coordination management model that takes into consideration inventory and transportation as part of the comprehensive goal. We emphasize the innovational role of the IoT in these areas.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Dynamic Coordinated Supply Chain Scheduling in an IoT Environment
next chapter Cutting Stock Problem with the IoT
Literature
104.
Wible, B., Mervis, J., Wigginton, N.S.: Rethinking the global supply chain. Science. 344, 1100–1103 (2014)CrossRef
105.
Mason, A., Shaw, A., Al-Shamma’a, A.: Peer-to-peer inventory management of returnable transport items: a design science approach. Comput. Ind. 63, 265–274 (2012)CrossRef
106.
107.
Shang, W., Ha, A.Y., Tong, S.: Information sharing in a supply chain with a common retailer. Manag. Sci. 62, 245–263 (2015)
108.
109.
Dell’Amico, M., Righini, G., Salani, M.: A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transp. Sci. 40, 235–247 (2006)CrossRef
110.
Salhi, S., Nagy, G.: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J. Oper. Res. Soc. 50, 1034–1042 (1999)CrossRefMATH
111.
Gajpal, Y., Abad, P.: Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery. J. Oper. Res. Soc. 61, 1498–1509 (2010)CrossRefMATH
112.
Tasan, A.S., Gen, M.: A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Comput. Ind. Eng. 62, 755–761 (2012)CrossRef
113.
Subramanian, A., Drummond, L.M.D.A., Bentes, C., Ochi, L.S., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37, 1899–1911 (2010)CrossRefMATH
114.
Gajpal, Y., Abad, P.: An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Comput. Oper. Res. 36, 3215–3223 (2009)CrossRefMATH
115.
Liu, R., Xie, X., Augusto, V., Rodriguez, C.: Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. Eur. J. Oper. Res. 230, 475–486 (2013)MathSciNetCrossRefMATH
116.
Wang, C., Mu, D., Zhao, F., Sutherland, J.W.: A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup–delivery and time windows. Comput. Ind. Eng. 83, 111–122 (2015)CrossRef
117.
118.
Gendreau, M., Laporte, G., Séguin, R.: An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transp. Sci. 29, 143–155 (1995)CrossRefMATH
119.
Gendreau, M., Laporte, G., Séguin, R.: A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. 44, 469–477 (1996)CrossRefMATH
120.
Mendoza, J.E., Rousseau, L.-M., Villegas, J.G.: A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints. J. Heuristics 1–28 (2015)
121.
Mendoza, J.E., Villegas, J.G.: A multi-space sampling heuristic for the vehicle routing problem with stochastic demands. Optim. Lett. 7, 1503–1516 (2013)MathSciNetCrossRefMATH
122.
Powell, W.B., Sheffi, Y., Nickerson, K.S., Butterbaugh, K., Atherton, S.: Maximizing profits for North American Van Lines’ truckload division: a new framework for pricing and operations. Interfaces. 18, 21–41 (1988)CrossRef
123.
Kim, S., Lewis, M.E., White, C.C.: Optimal vehicle routing with real-time traffic information. IEEE Trans. Intell. Transp. Syst. 6, 178–188 (2005)CrossRef
124.
Secomandi, N., Margot, F.: Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. 57, 214–230 (2009)CrossRefMATH
125.
Novoa, C., Storer, R.: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 196, 509–515 (2009)CrossRefMATH
126.
Secomandi, N.: Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 27, 1201–1225 (2000)CrossRefMATH
127.
Goodson, J.C., Thomas, B.W., Ohlmann, J.W.: Restocking-based rollout policies for the vehicle routing problem with stochastic demand and duration limits. Transp. Sci. 50, 591–607 (2015)CrossRef
128.
Archetti, C., Bertazzi, L., Laporte, G., Speranza, M.G.: A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transp. Sci. 41, 382–391 (2007)CrossRef
129.
Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T.: An integrated local search method for inventory and routing decisions. Expert Syst. Appl. 36, 10239–10248 (2009)CrossRef
130.
Popović, D., Vidović, M., Radivojević, G.: Variable neighborhood search heuristic for the inventory routing problem in fuel delivery. Expert Syst. Appl. 39, 13390–13398 (2012)CrossRef
131.
Park, Y.-B., Yoo, J.-S., Park, H.-S.: A genetic algorithm for the vendor-managed inventory routing problem with lost sales. Expert Syst. Appl. 53, 149–159 (2016)CrossRef
132.
Chen, Y.M., Lin, C.-T.: A coordinated approach to hedge the risks in stochastic inventory-routing problem. Comput. Ind. Eng. 56, 1095–1112 (2009)CrossRef
133.
Bertazzi, L., Bosco, A., Laganà, D.: Managing stochastic demand in an inventory routing problem with transportation procurement. Omega. 56, 112–121 (2015)CrossRef
134.
135.
Toriello, A., Nemhauser, G., Savelsbergh, M.: Decomposing inventory routing problems with approximate value functions. Nav. Res. Logist. (NRL). 57, 718–727 (2010)MathSciNetCrossRefMATH
136.
Adulyasak, Y., Cordeau, J.-F., Jans, R.: Benders decomposition for production routing under demand uncertainty. Oper. Res. 63, 851–867 (2015)MathSciNetCrossRefMATH
137.
Bertazzi, L., Bosco, A., Guerriero, F., Lagana, D.: A stochastic inventory routing problem with stock-out. Transp. Res. Part C Emerg. Technol. 27, 89–107 (2013)CrossRef
138.
Hvattum, L.M., Løkketangen, A.: Using scenario trees and progressive hedging for stochastic inventory routing problems. J. Heuristics. 15, 527–557 (2009)CrossRefMATH
139.
Nolz, P.C., Absi, N., Feillet, D.: A stochastic inventory routing problem for infectious medical waste collection. Networks. 63, 82–95 (2014)MathSciNetCrossRefMATH
140.
Yu, Y., Chu, C., Chen, H., Chu, F.: Large scale stochastic inventory routing problems with split delivery and service level constraints. Ann. Oper. Res. 197, 135–158 (2012)MathSciNetCrossRefMATH
141.
Coelho, L.C., Cordeau, J.-F., Laporte, G.: Heuristics for dynamic and stochastic inventory-routing. Comput. Oper. Res. 52, 55–67 (2014)MathSciNetCrossRefMATH
142.
Juan, A.A., Grasman, S.E., Caceres-Cruz, J., Bektaş, T.: A simheuristic algorithm for the single-period stochastic inventory-routing problem with stock-outs. Simul. Model. Pract. Theory. 46, 40–52 (2014)CrossRef
143.
Liu, S.-C., Chung, C.-H.: A heuristic method for the vehicle routing problem with backhauls and inventory. J. Intell. Manuf. 20, 29–42 (2009)CrossRef
144.
Li, Y., Lu, M., Liu, B.: A two-stage algorithm for the closed-loop location-inventory problem model considering returns in e-commerce. Math. Probl. Eng. (2014)
145.
Van Anholt, R.G., Coelho, L.C., Laporte, G., Vis, I.F.: An inventory-routing problem with pickups and deliveries arising in the replenishment of automated teller machines. Transp. Sci. (2016)
146.
Brinkmann, J., Ulmer, M.W., Mattfeld, D.C.: Short-term strategies for stochastic inventory routing in bike sharing systems. Transp. Res. Procedia. 10, 364–373 (2015)CrossRef
147.
Soysal, M.: Closed-loop Inventory Routing Problem for returnable transport items. Transp. Res. Part D: Transp. Environ. 48, 31–45 (2016)CrossRef
148.
Pisinger, D., Ropke, S.: Large neighborhood search. In: Handbook of Metaheuristics, pp. 399–419. Springer, Place Published (2010)
149.
Shaw, P.: A New Local Search Algorithm Providing High Quality Solutions to Vehicle Routing Problems. APES Group, Dept of Computer Science, University of Strathclyde, Glasgow (1997)
150.
Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows. Transp. Sci. 38, 515–530 (2004)CrossRef
151.
152.
Hong, L.: An improved LNS algorithm for real-time vehicle routing problem with time windows. Comput. Oper. Res. 39, 151–163 (2012)CrossRefMATH
153.
Drexl, M.: Applications of the vehicle routing problem with trailers and transshipments. Eur. J. Oper. Res. 227, 275–283 (2013)MathSciNetCrossRef
154.
Lee, J., Kim, B.-I., Johnson, A.L., Lee, K.: The nuclear medicine production and delivery problem. Eur. J. Oper. Res. 236, 461–472 (2014)MathSciNetCrossRefMATH
155.
Goel, V., Furman, K.C., Song, J.-H., El-Bakry, A.S.: Large neighborhood search for LNG inventory routing. J. Heuristics. 18, 821–848 (2012)CrossRef
156.
Song, J.-H., Furman, K.C.: A maritime inventory routing problem: practical approach. Comput. Oper. Res. 40, 657–665 (2013)CrossRefMATH
157.
Liu, S.-C., Lu, M.-C., Chung, C.-H.: A hybrid heuristic method for the periodic inventory routing problem. Int. J. Adv. Manuf. Technol. 1–8 (2016)
158.
Lei, H., Laporte, G., Guo, B.: The capacitated vehicle routing problem with stochastic demands and time windows. Comput. Oper. Res. 38, 1775–1783 (2011)MathSciNetCrossRefMATH
159.
Lei, H., Laporte, G., Guo, B.: The vehicle routing problem with stochastic demands and split deliveries. INFOR Inf. Syst. Oper. Res. 50, 59–71 (2012)MathSciNet
160.
Azi, N., Gendreau, M., Potvin, J.-Y.: An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput. Oper. Res. 41, 167–173 (2014)MathSciNetCrossRefMATH
161.
Luo, Z., Qin, H., Zhang, D., Lim, A.: Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost. Transp. Res. Part E Logist. Transp. Rev. 85, 69–89 (2016)CrossRef
162.
Aksen, D., Kaya, O., Salman, F.S., Tüncel, Ö.: An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. Eur. J. Oper. Res. 239, 413–426 (2014)MathSciNetCrossRefMATH
163.
Hemmati, A., Stålhane, M., Hvattum, L.M., Andersson, H.: An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping. Comput. Oper. Res. 64, 274–282 (2015)MathSciNetCrossRefMATH
164.
Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568–581 (1964)CrossRef
165.
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455–472 (2006)CrossRef
166.
Augerat, P., Belenguer, J., Benavent, E., Corberán, A., Naddef, D., Rinaldi, G.: Computational results with a branch and cut code for the capacitated vehicle routing problem. Rapport de recherche- IMAG (1995)
Metadata
Title
Hybrid Manufacturing Distributed Inventory Management with Sharing Logistics
Authors
Xinbao Liu
Jun Pei
Lin Liu
Hao Cheng
Mi Zhou
Panos M. Pardalos
Copyright Year
2017
Book
Optimization and Management in Manufacturing Engineering

Print ISBN: 978-3-319-64567-4

Electronic ISBN: 978-3-319-64568-1

Copyright Year: 2017

DOI
https://doi.org/10.1007/978-3-319-64568-1_4