Advertisement

Hybrid Manufacturing Distributed Inventory Management with Sharing Logistics

  • Xinbao Liu
  • Jun Pei
  • Lin Liu
  • Hao Cheng
  • Mi Zhou
  • Panos M. Pardalos
Chapter
Part of the Springer Optimization and Its Applications book series (SOIA, volume 126)

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.

References

  1. 104.
    Wible, B., Mervis, J., Wigginton, N.S.: Rethinking the global supply chain. Science. 344, 1100–1103 (2014)CrossRefGoogle Scholar
  2. 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)CrossRefGoogle Scholar
  3. 106.
    Zhou, W.: RFID and item-level information visibility. Eur. J. Oper. Res. 198, 252–258 (2009)MathSciNetCrossRefMATHGoogle Scholar
  4. 107.
    Shang, W., Ha, A.Y., Tong, S.: Information sharing in a supply chain with a common retailer. Manag. Sci. 62, 245–263 (2015)Google Scholar
  5. 108.
    Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6, 80–91 (1959)MathSciNetCrossRefMATHGoogle Scholar
  6. 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)CrossRefGoogle Scholar
  7. 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)CrossRefMATHGoogle Scholar
  8. 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)CrossRefMATHGoogle Scholar
  9. 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)CrossRefGoogle Scholar
  10. 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)CrossRefMATHGoogle Scholar
  11. 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)CrossRefMATHGoogle Scholar
  12. 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)MathSciNetCrossRefMATHGoogle Scholar
  13. 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)CrossRefGoogle Scholar
  14. 117.
    Bertsimas, D.J.: A vehicle routing problem with stochastic demand. Oper. Res. 40, 574–585 (1992)MathSciNetCrossRefMATHGoogle Scholar
  15. 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)CrossRefMATHGoogle Scholar
  16. 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)CrossRefMATHGoogle Scholar
  17. 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)Google Scholar
  18. 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)MathSciNetCrossRefMATHGoogle Scholar
  19. 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)CrossRefGoogle Scholar
  20. 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)CrossRefGoogle Scholar
  21. 124.
    Secomandi, N., Margot, F.: Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. 57, 214–230 (2009)CrossRefMATHGoogle Scholar
  22. 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)CrossRefMATHGoogle Scholar
  23. 126.
    Secomandi, N.: Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 27, 1201–1225 (2000)CrossRefMATHGoogle Scholar
  24. 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)CrossRefGoogle Scholar
  25. 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)CrossRefGoogle Scholar
  26. 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)CrossRefGoogle Scholar
  27. 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)CrossRefGoogle Scholar
  28. 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)CrossRefGoogle Scholar
  29. 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)CrossRefGoogle Scholar
  30. 133.
    Bertazzi, L., Bosco, A., Laganà, D.: Managing stochastic demand in an inventory routing problem with transportation procurement. Omega. 56, 112–121 (2015)CrossRefGoogle Scholar
  31. 134.
    Adelman, D.: A price-directed approach to stochastic inventory/routing. Oper. Res. 52, 499–514 (2004)MathSciNetCrossRefMATHGoogle Scholar
  32. 135.
    Toriello, A., Nemhauser, G., Savelsbergh, M.: Decomposing inventory routing problems with approximate value functions. Nav. Res. Logist. (NRL). 57, 718–727 (2010)MathSciNetCrossRefMATHGoogle Scholar
  33. 136.
    Adulyasak, Y., Cordeau, J.-F., Jans, R.: Benders decomposition for production routing under demand uncertainty. Oper. Res. 63, 851–867 (2015)MathSciNetCrossRefMATHGoogle Scholar
  34. 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)CrossRefGoogle Scholar
  35. 138.
    Hvattum, L.M., Løkketangen, A.: Using scenario trees and progressive hedging for stochastic inventory routing problems. J. Heuristics. 15, 527–557 (2009)CrossRefMATHGoogle Scholar
  36. 139.
    Nolz, P.C., Absi, N., Feillet, D.: A stochastic inventory routing problem for infectious medical waste collection. Networks. 63, 82–95 (2014)MathSciNetCrossRefMATHGoogle Scholar
  37. 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)MathSciNetCrossRefMATHGoogle Scholar
  38. 141.
    Coelho, L.C., Cordeau, J.-F., Laporte, G.: Heuristics for dynamic and stochastic inventory-routing. Comput. Oper. Res. 52, 55–67 (2014)MathSciNetCrossRefMATHGoogle Scholar
  39. 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)CrossRefGoogle Scholar
  40. 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)CrossRefGoogle Scholar
  41. 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)Google Scholar
  42. 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)Google Scholar
  43. 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)CrossRefGoogle Scholar
  44. 147.
    Soysal, M.: Closed-loop Inventory Routing Problem for returnable transport items. Transp. Res. Part D: Transp. Environ. 48, 31–45 (2016)CrossRefGoogle Scholar
  45. 148.
    Pisinger, D., Ropke, S.: Large neighborhood search. In: Handbook of Metaheuristics, pp. 399–419. Springer, Place Published (2010)Google Scholar
  46. 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)Google Scholar
  47. 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)CrossRefGoogle Scholar
  48. 151.
    Goel, A., Gruhn, V.: A general vehicle routing problem. Eur. J. Oper. Res. 191, 650–660 (2008)MathSciNetCrossRefMATHGoogle Scholar
  49. 152.
    Hong, L.: An improved LNS algorithm for real-time vehicle routing problem with time windows. Comput. Oper. Res. 39, 151–163 (2012)CrossRefMATHGoogle Scholar
  50. 153.
    Drexl, M.: Applications of the vehicle routing problem with trailers and transshipments. Eur. J. Oper. Res. 227, 275–283 (2013)MathSciNetCrossRefGoogle Scholar
  51. 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)MathSciNetCrossRefMATHGoogle Scholar
  52. 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)CrossRefGoogle Scholar
  53. 156.
    Song, J.-H., Furman, K.C.: A maritime inventory routing problem: practical approach. Comput. Oper. Res. 40, 657–665 (2013)CrossRefMATHGoogle Scholar
  54. 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)Google Scholar
  55. 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)MathSciNetCrossRefMATHGoogle Scholar
  56. 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)MathSciNetGoogle Scholar
  57. 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)MathSciNetCrossRefMATHGoogle Scholar
  58. 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)CrossRefGoogle Scholar
  59. 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)MathSciNetCrossRefMATHGoogle Scholar
  60. 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)MathSciNetCrossRefMATHGoogle Scholar
  61. 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)CrossRefGoogle Scholar
  62. 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)CrossRefGoogle Scholar
  63. 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)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Xinbao Liu
    • 1
  • Jun Pei
    • 1
  • Lin Liu
    • 1
  • Hao Cheng
    • 1
  • Mi Zhou
    • 1
  • Panos M. Pardalos
    • 2
  1. 1.School of ManagementHefei University of TechnologyHefeiChina
  2. 2.Department of Industrial and Systems EngineeringUniversity of FloridaGainesvilleUSA

Personalised recommendations