Skip to main content

2019 | OriginalPaper | Buchkapitel

A Model for the Multi-depot Online Vehicle Routing Problem with Soft Deadlines

verfasst von : Álvaro Silva, Luís Pinto Ferreira, Maria Teresa Pereira, Fábio Neves-Moreira

Erschienen in: Innovation, Engineering and Entrepreneurship

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In many companies in the automotive industry there are challenges in some key processes in their logistic departments, mainly in internal logistics. These challenges happen due to poorly defined rules for the transportation of goods, resulting in a great cost associated with the time lost in the process. Also, the optimization of these processes, incrementing the efficiency of internal logistics can bring competitive advantages to the companies. For that matter, this study was developed at a major tire manufacturing company and proposes a model for the optimization of in-bound logistics, viewed as an online vehicle routing problem with soft deadlines (OVRPSD), using multiple depots. The main goal of this study is the increase of efficiency in logistic, optimizing the number of vehicles to supply the machines in order to reduce the stopping time of machines due to the lack of tires to consume.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

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!

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!

Literatur
1.
Zurück zum Zitat Amberg, A., Voss, S.: A hierarchical relaxations lower bond for the capacitated arc routing problem. In: 35th Hawaii International Conference on System Sciences, Hawaii (2002) Amberg, A., Voss, S.: A hierarchical relaxations lower bond for the capacitated arc routing problem. In: 35th Hawaii International Conference on System Sciences, Hawaii (2002)
2.
Zurück zum Zitat 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. 2018(2012), 1–6 (2012)MathSciNetCrossRef 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. 2018(2012), 1–6 (2012)MathSciNetCrossRef
4.
Zurück zum Zitat Toth, P., Vigo, D.: The Vehicle Routing Problem, pp. 1–4. Society for Industrial and Applied Mathematics, Philadelphia (2002)MATH Toth, P., Vigo, D.: The Vehicle Routing Problem, pp. 1–4. Society for Industrial and Applied Mathematics, Philadelphia (2002)MATH
5.
Zurück zum Zitat Toth, P., Vigo, D.: The Vehicle Routing Problem, pp. 5–8. Society for Industrial and Applied Mathematics, Philadelphia (2002)CrossRef Toth, P., Vigo, D.: The Vehicle Routing Problem, pp. 5–8. Society for Industrial and Applied Mathematics, Philadelphia (2002)CrossRef
6.
Zurück zum Zitat Lacomme, P., Prins, C., Randame, W.: Competitive memetic algorithms for arc routing problems. Ann. Oper. Res. 131, 159–185 (2004)MathSciNetCrossRef Lacomme, P., Prins, C., Randame, W.: Competitive memetic algorithms for arc routing problems. Ann. Oper. Res. 131, 159–185 (2004)MathSciNetCrossRef
7.
Zurück zum Zitat Pearn, W.L.: Augment-insert algorithms for the capacitated arc routing problem. Comput. Oper. Res. 18(2), 189–198 (1991)CrossRef Pearn, W.L.: Augment-insert algorithms for the capacitated arc routing problem. Comput. Oper. Res. 18(2), 189–198 (1991)CrossRef
8.
Zurück zum Zitat Longo, H., Poggi de Aragão, M., Uchoa, E.: Solving capacitated arc routing problems using a transformation to the CVRP. Comput. Oper. Res. 33(2006), 1823–1837 (2006)CrossRef Longo, H., Poggi de Aragão, M., Uchoa, E.: Solving capacitated arc routing problems using a transformation to the CVRP. Comput. Oper. Res. 33(2006), 1823–1837 (2006)CrossRef
9.
Zurück zum Zitat Assad, A., Golden, B.L., Pearn, W.: The capacitated Chinese postman problem: lower bounds and solvable cases. Am. J. Math. Manag. Sci. 7(1–2), 63–88 (1987)MathSciNetMATH Assad, A., Golden, B.L., Pearn, W.: The capacitated Chinese postman problem: lower bounds and solvable cases. Am. J. Math. Manag. Sci. 7(1–2), 63–88 (1987)MathSciNetMATH
10.
Zurück zum Zitat Chabot, T., Lahyani, R., Coelho, L., Renaud, J.: order picking problems under weight, fragility and category constraints. CIRRELT-2015-49, September 2015 Chabot, T., Lahyani, R., Coelho, L., Renaud, J.: order picking problems under weight, fragility and category constraints. CIRRELT-2015-49, September 2015
11.
Zurück zum Zitat Chabot, T., Coelho, L., Renaud, J., Côté, J.: Mathematical models, heuristic and exact method for order picking in 3D-Narrow aisles. CIRRELT-2015-49, June 2015 Chabot, T., Coelho, L., Renaud, J., Côté, J.: Mathematical models, heuristic and exact method for order picking in 3D-Narrow aisles. CIRRELT-2015-49, June 2015
12.
Zurück zum Zitat Farahani, R.Z., Rezapour, S., Kardan, L.: Logistics Operations and Management: Concepts and Models, 1st edn. Elsevier, Waltham (2001) Farahani, R.Z., Rezapour, S., Kardan, L.: Logistics Operations and Management: Concepts and Models, 1st edn. Elsevier, Waltham (2001)
13.
Zurück zum Zitat Kovacs, A.A., Parragh, S.N., Hartl, R.F.: The multi-objective generalized consistent vehicle routing problem. Eur. J. Oper. Res. 247, 441–458 (2015)MathSciNetCrossRef Kovacs, A.A., Parragh, S.N., Hartl, R.F.: The multi-objective generalized consistent vehicle routing problem. Eur. J. Oper. Res. 247, 441–458 (2015)MathSciNetCrossRef
14.
Zurück zum Zitat Lipmann, M.: On-line Routing. PhD Thesis, Technical University of Eindhoven (2003) Lipmann, M.: On-line Routing. PhD Thesis, Technical University of Eindhoven (2003)
Metadaten
Titel
A Model for the Multi-depot Online Vehicle Routing Problem with Soft Deadlines
verfasst von
Álvaro Silva
Luís Pinto Ferreira
Maria Teresa Pereira
Fábio Neves-Moreira
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-319-91334-6_112