Skip to main content
Erschienen in: Cluster Computing 6/2019

29.03.2018

A tabu search algorithm for distribution network optimization with discrete split deliveries and soft time windows

verfasst von: Yangkun Xia, Zhuo Fu

Erschienen in: Cluster Computing | Sonderheft 6/2019

Einloggen

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

search-config
loading …

Abstract

To save the distribution network costs, the vehicle routing problem with split deliveries by order and soft time windows is studied. In this paper, the flexibility of the distribution system is enhanced via soft time windows, the requirement for non-split deliveries is loosened, and a new form of discrete split deliveries is defined. The new form of split deliveries by order is agreed for splitting. Giving considerations to split deliveries by order, soft time windows and working time constraints, a corresponding multi-objective mathematical model is constructed, and an adaptive tabu search algorithm with dynamic tabu list and multi-neighborhood structure is designed to solve the problem. The effectiveness of the new algorithm is verified by the example testing and comparison.

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 Dror, M., Trudeau, P.: Savings by split delivery routing. Transp. Sci. 23(2), 141–145 (1989)CrossRef Dror, M., Trudeau, P.: Savings by split delivery routing. Transp. Sci. 23(2), 141–145 (1989)CrossRef
2.
Zurück zum Zitat Archetti, C., Hertz, A., Speranza, M.G.: A tabu search algorithm for the split delivery vehicle routing problem. Transp. Sci. 40(1), 64–73 (2006)CrossRef Archetti, C., Hertz, A., Speranza, M.G.: A tabu search algorithm for the split delivery vehicle routing problem. Transp. Sci. 40(1), 64–73 (2006)CrossRef
3.
Zurück zum Zitat Yin, S., Nishi, T., Izuno, T.: A heuristic approach for international crude oil transportation scheduling problems. J. Adv. Mech. Des. Syst. Manuf. 6(5), 687–702 (2012)CrossRef Yin, S., Nishi, T., Izuno, T.: A heuristic approach for international crude oil transportation scheduling problems. J. Adv. Mech. Des. Syst. Manuf. 6(5), 687–702 (2012)CrossRef
4.
Zurück zum Zitat Wilck, J.H., Cavalier, T.M.: A genetic algorithm for the split delivery vehicle routing problem. Am. J. Oper. Res. 2(2), 207–216 (2012) Wilck, J.H., Cavalier, T.M.: A genetic algorithm for the split delivery vehicle routing problem. Am. J. Oper. Res. 2(2), 207–216 (2012)
5.
Zurück zum Zitat Nishi, T., Izuno, T.: Column generation heuristics for ship routing and scheduling problems in crude oil transportation with split deliveries. Comput. Chem. Eng. 60(2), 329–338 (2014)CrossRef Nishi, T., Izuno, T.: Column generation heuristics for ship routing and scheduling problems in crude oil transportation with split deliveries. Comput. Chem. Eng. 60(2), 329–338 (2014)CrossRef
6.
Zurück zum Zitat Wang, H., Du, L., Ma, S.: Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake. Transp. Res. Part E: Log. Transp. Rev. 69(3), 160–179 (2014)CrossRef Wang, H., Du, L., Ma, S.: Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake. Transp. Res. Part E: Log. Transp. Rev. 69(3), 160–179 (2014)CrossRef
7.
Zurück zum Zitat Yan, S., Chu, J.C., Hsiao, F.Y., et al.: A planning model and solution algorithm for multi-trip split-delivery vehicle routing and scheduling problems with time windows. Comput. Ind. Eng. 87, 383–393 (2015)CrossRef Yan, S., Chu, J.C., Hsiao, F.Y., et al.: A planning model and solution algorithm for multi-trip split-delivery vehicle routing and scheduling problems with time windows. Comput. Ind. Eng. 87, 383–393 (2015)CrossRef
8.
Zurück zum Zitat Han, F.W., Chu, Y.C.: A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts. Transp. Res. Part E Log. Transp. Rev. 88, 11–31 (2016)CrossRef Han, F.W., Chu, Y.C.: A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts. Transp. Res. Part E Log. Transp. Rev. 88, 11–31 (2016)CrossRef
9.
Zurück zum Zitat Rajappa, G.P., Wilck, J.H., Bell, J.E.: An ant colony optimization and hybrid metaheuristics algorithm to solve the split delivery vehicle routing problem. Int. J. Appl. Indus. Eng. 3(1), 55–73 (2016)CrossRef Rajappa, G.P., Wilck, J.H., Bell, J.E.: An ant colony optimization and hybrid metaheuristics algorithm to solve the split delivery vehicle routing problem. Int. J. Appl. Indus. Eng. 3(1), 55–73 (2016)CrossRef
10.
Zurück zum Zitat Chen, P., Golden, B., Wang, X., et al.: A novel approach to solve the split delivery vehicle routing problem. Int. Transp. Oper. Res. 24(1), 27–41 (2017)MathSciNetCrossRef Chen, P., Golden, B., Wang, X., et al.: A novel approach to solve the split delivery vehicle routing problem. Int. Transp. Oper. Res. 24(1), 27–41 (2017)MathSciNetCrossRef
11.
Zurück zum Zitat Salani, M., Vacca, I.: Branch and price for the vehicle routing problem with discrete split deliveries and time windows. Eur. J. Oper. Res. 213(3), 470–477 (2011)MathSciNetCrossRef Salani, M., Vacca, I.: Branch and price for the vehicle routing problem with discrete split deliveries and time windows. Eur. J. Oper. Res. 213(3), 470–477 (2011)MathSciNetCrossRef
13.
Zurück zum Zitat Fu, Z., Eglese, R., Li, L.Y.O.: A unified tabu search algorithm for vehicle routing problems with soft time windows. J. of the Oper. Res. Soc. 59(5), 663–673 (2008)CrossRef Fu, Z., Eglese, R., Li, L.Y.O.: A unified tabu search algorithm for vehicle routing problems with soft time windows. J. of the Oper. Res. Soc. 59(5), 663–673 (2008)CrossRef
14.
Zurück zum Zitat Ho, S.C., Haugland, D.: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. 31(12), 1947–1964 (2004)CrossRef Ho, S.C., Haugland, D.: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. 31(12), 1947–1964 (2004)CrossRef
15.
Zurück zum Zitat Lai, M., Battarra, M., Francesco, M.D., et al.: An adaptive guidance meta-heuristic for vehicle routing problem with splits and clustered backhauls. J. Oper. Res. Soc. 66(7), 1222–1236 (2015)CrossRef Lai, M., Battarra, M., Francesco, M.D., et al.: An adaptive guidance meta-heuristic for vehicle routing problem with splits and clustered backhauls. J. Oper. Res. Soc. 66(7), 1222–1236 (2015)CrossRef
16.
Zurück zum Zitat Solomon, M.M.: Algorithms for vehicle routing problem and scheduling problem with time windows constraints. Oper. Res. 35(2), 254–265 (1989)MathSciNetCrossRef Solomon, M.M.: Algorithms for vehicle routing problem and scheduling problem with time windows constraints. Oper. Res. 35(2), 254–265 (1989)MathSciNetCrossRef
17.
Zurück zum Zitat Fu, Z., Eglese, R., Li, L.Y.O.: A new tabu search heuristic for the open vehicle routing problem. J. Oper. Res. Soc. 56(3), 267–274 (2005)CrossRef Fu, Z., Eglese, R., Li, L.Y.O.: A new tabu search heuristic for the open vehicle routing problem. J. Oper. Res. Soc. 56(3), 267–274 (2005)CrossRef
19.
Zurück zum Zitat Belfiore, P., Yoshizaki, H.T.Y.: Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries. Comput. Ind. Eng. 64(2), 589–601 (2013)CrossRef Belfiore, P., Yoshizaki, H.T.Y.: Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries. Comput. Ind. Eng. 64(2), 589–601 (2013)CrossRef
20.
Zurück zum Zitat Mu, Q., Fu, Z., Lysgaard, J., et al.: Disruption management of the vehicle routing problem with vehicle breakdown. J. Oper. Res. Soc. 62(4), 742–749 (2011)CrossRef Mu, Q., Fu, Z., Lysgaard, J., et al.: Disruption management of the vehicle routing problem with vehicle breakdown. J. Oper. Res. Soc. 62(4), 742–749 (2011)CrossRef
23.
Zurück zum Zitat Wei, M., Sun, B.: Bi-level programming model for multi-modal regional bus timetable and vehicle dispatch with stochastic travel time. Clus. Comput. 20(1), 401–411 (2017)MathSciNetCrossRef Wei, M., Sun, B.: Bi-level programming model for multi-modal regional bus timetable and vehicle dispatch with stochastic travel time. Clus. Comput. 20(1), 401–411 (2017)MathSciNetCrossRef
24.
Zurück zum Zitat Nakao, Y., Nagamochi, H.: A DP-based heuristic algorithm for the discrete split delivery vehicle routing problem. J. Adv. Mech. Des. Syst. Manuf. 1(1), 217–226 (2007)CrossRef Nakao, Y., Nagamochi, H.: A DP-based heuristic algorithm for the discrete split delivery vehicle routing problem. J. Adv. Mech. Des. Syst. Manuf. 1(1), 217–226 (2007)CrossRef
25.
Zurück zum Zitat Chan, F., Shekhar, P., Tiwari, M.: Dynamic scheduling of oil tankers with splitting of cargo at pickup and delivery locations: a Multi-objective Ant Colony-based approach. Int. J. Product. 52(24), 7436–7453 (2014)CrossRef Chan, F., Shekhar, P., Tiwari, M.: Dynamic scheduling of oil tankers with splitting of cargo at pickup and delivery locations: a Multi-objective Ant Colony-based approach. Int. J. Product. 52(24), 7436–7453 (2014)CrossRef
26.
Zurück zum Zitat Shi, Y., Boudouh, T., Grunder, O.: A hybrid genetic algorithm for a home health care routing problem with time window and fuzzy demand. Expert Syst. Appl. 72, 160–176 (2017)CrossRef Shi, Y., Boudouh, T., Grunder, O.: A hybrid genetic algorithm for a home health care routing problem with time window and fuzzy demand. Expert Syst. Appl. 72, 160–176 (2017)CrossRef
Metadaten
Titel
A tabu search algorithm for distribution network optimization with discrete split deliveries and soft time windows
verfasst von
Yangkun Xia
Zhuo Fu
Publikationsdatum
29.03.2018
Verlag
Springer US
Erschienen in
Cluster Computing / Ausgabe Sonderheft 6/2019
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-018-2635-8

Weitere Artikel der Sonderheft 6/2019

Cluster Computing 6/2019 Zur Ausgabe

Premium Partner