Skip to main content

Routing Analysis and Improvement for the Pick-up Service of Raw Material for a Company Specialized in Plastic Injection

  • Conference paper
  • First Online:
Applied Computer Sciences in Engineering (WEA 2017)

Abstract

For all organizations in the manufacturing and service sectors, transportation has become an important topic for the economic decision-making process. This is due to the high quality and versatility standards that today the industries have established to follow a strict guideline focused on Just-In-Time (JIT). In this context, the present paper extends on the analysis and improvement of a real-world routing problem of a Mexican company dedicated to the manufacturing of plastic products. The value chain of the company has its origin at the gathering (picking-up) of raw materials and components from different suppliers located in the United States. Currently, a third-party company (carrier) has been hired to perform the pickup process, however there is uncertainty regarding the optimality of its routes and their associated costs. The present research analyses the current routing scheme that is performed by the carrier to verify compliance of the requirements of the company which are minimization of costs and travel times. Then, the Capacitated Vehicle Routing Problem (CVRP) is performed for improvement of the current routing scheme. In addition, a new location for a depot (or collection center) is proposed to allow the company to manage its own raw material, avoiding the need to consider a third-party company for the picking-up services by means of the p-Median Problem (PMP). Optimization for the CVRP and PMP was performed with a specialized software and the results obtained by this research present an improved cost-efficient routing scheme for the picking-up process of the plastic company.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Baldacci, R., Mingozzi, A., Roberti, R.: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218, 1–6 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568–581 (1964)

    Google Scholar 

  3. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6, 80–91 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Desrosiers, J., Soumis, F., Desrochers, M.: Routing with time windows by column generation. Networks 14(4), 545–565 (1984)

    Article  MATH  Google Scholar 

  5. Díaz, A., Aguilera, V.: Matemáticas financieras, 4th edn. McGraw Hill, Mexico (2008)

    Google Scholar 

  6. Fisher, M.L., Jaikumar, R.: A decomposition algorithm for large-scale vehicle routing. Working Paper No. 78-11-05, Department of Decision Sciences, University of Pennsylvania, pp. 1–27 (1978)

    Google Scholar 

  7. Gillett, B.E., Miller, L.: A heuristic algorithm for the vehicle dispatch problem. Oper. Res. 2, 340–349 (1974)

    Article  MATH  Google Scholar 

  8. Hiller, S., Lieberman, G.: Introducción a la Investigación de Operaciones, 9th edn. McGraw-Hill, Mexico (2006)

    Google Scholar 

  9. Kir, S., Yazgan, H.R., Tüncel, E.: A novel heuristic algorithm for capacitated vehicle routing. J. Industrial Eng. Int. 57, 1–8 (2017)

    Google Scholar 

  10. Kumar, S., Panneerselvam, R.: A survey on the vehicle routing problem and its variants. Intell. Inf. Manage. 4, 66–74 (2012)

    Google Scholar 

  11. Daskin, M., Maass, K.: The p-Median problem. In: Laporte, et al. (eds.) Location Science, pp. 21–45. Springer International Publishing, New York (2015)

    Google Scholar 

  12. Montoya, M., Bernabé, M., González, R., Martínez, J., Bautista, H., Sánchez, A., Macias, F.: A solution proposal for the capacitated P-median problem with Tabu search. Res. Comput. Sci. 121, 59–67 (2016)

    Google Scholar 

  13. Piccolo, C.: Mathematical models to support territorial reorganization decisions in the public sector. Ph.D. Dissertation, University of Naples Federico II (2014)

    Google Scholar 

  14. Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl. Math. 123(1–3), 487–512 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Zuñiga, J., López, A., Lozano, Y.: Vehicle routing problem [VRP] and its applications in Colombian medium-sized companies. Ingenium 10(27), 29–36 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sánchez-Partida Diana .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Diana, SP., Karen, Z., Santiago-Omar, CM., Luis, MF.J. (2017). Routing Analysis and Improvement for the Pick-up Service of Raw Material for a Company Specialized in Plastic Injection. In: Figueroa-García, J., López-Santana, E., Villa-Ramírez, J., Ferro-Escobar, R. (eds) Applied Computer Sciences in Engineering. WEA 2017. Communications in Computer and Information Science, vol 742. Springer, Cham. https://doi.org/10.1007/978-3-319-66963-2_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66963-2_47

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66962-5

  • Online ISBN: 978-3-319-66963-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics