Skip to main content
Top

2016 | OriginalPaper | Chapter

A Constraint Based Heuristic for Vehicle Routing Problem with Time Windows

Authors : G. Poonthalir, R. Nadarajan, S. Geetha

Published in: Digital Connectivity – Social Impact

Publisher: Springer Nature Singapore

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

search-config
loading …

Abstract

Vehicle Routing Problem with Time Windows (VRPTW) is a well known combinatorial optimization problem. Many solution strategies are proposed to solve VRPTW. In this work, a constraint based (COB) heuristic approach is proposed to solve VRPTW. The algorithm uses two stages to solve. In the first stage, priority based decomposition is introduced that partitions the customers based on spatial constraints with a devised priority metric. In the second stage, an urgency based orientation is introduced based on temporal constraints to direct the customers along the route. The routes obtained are improved for optimality. The proposed algorithm is tested on Solomon’s benchmark data sets and implemented using MATLAB 7.0.1. The results obtained are found to be competitive with other well known methods.

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!

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!

Literature
1.
go back to reference Azi, N., et al.: An exact algorithm for single vehicle routing problem with time window. Eur. J. Oper. Res. 178(3), 755–766 (2007)MathSciNetCrossRefMATH Azi, N., et al.: An exact algorithm for single vehicle routing problem with time window. Eur. J. Oper. Res. 178(3), 755–766 (2007)MathSciNetCrossRefMATH
2.
go back to reference Solomon, M.: Algorithms for vehicle routing and scheduling problem with time window constraints. Oper. Res. 35(2), 254–265 (1987)MathSciNetCrossRefMATH Solomon, M.: Algorithms for vehicle routing and scheduling problem with time window constraints. Oper. Res. 35(2), 254–265 (1987)MathSciNetCrossRefMATH
3.
go back to reference Ioannou, G., et al.: A greedy look-ahead heuristic for the vehicle routing problem with time windows. J. Oper. Res. Soc. 52, 523–537 (2001)CrossRefMATH Ioannou, G., et al.: A greedy look-ahead heuristic for the vehicle routing problem with time windows. J. Oper. Res. Soc. 52, 523–537 (2001)CrossRefMATH
4.
go back to reference Chiang, W., Russell, R.A.: A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J. Comput. 9(4), 417–430 (1997)CrossRefMATH Chiang, W., Russell, R.A.: A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J. Comput. 9(4), 417–430 (1997)CrossRefMATH
5.
go back to reference Lin, S.W., et al.: Vehicle routing problems with time windows using simulated annealing. In: IEEE International Conference on Systems, Man and Cybernetics SMC 2006, pp. 8–11 (2006) Lin, S.W., et al.: Vehicle routing problems with time windows using simulated annealing. In: IEEE International Conference on Systems, Man and Cybernetics SMC 2006, pp. 8–11 (2006)
6.
go back to reference Alvarenga, G.B., et al.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. 34(6), 1561–1584 (2007)CrossRefMATH Alvarenga, G.B., et al.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. 34(6), 1561–1584 (2007)CrossRefMATH
7.
go back to reference Yu, B., et al.: A hybrid algorithm for vehicle routing problem with time windows. Expert Syst. Appl. 38, 435–441 (2011)CrossRef Yu, B., et al.: A hybrid algorithm for vehicle routing problem with time windows. Expert Syst. Appl. 38, 435–441 (2011)CrossRef
8.
go back to reference Ai, T.J., Kachitvichyanukul, V.: A particle swarm optimization for vehicle routing problem with time windows. Int. J. Oper. Res. 6(4), 519–537 (2009)CrossRefMATH Ai, T.J., Kachitvichyanukul, V.: A particle swarm optimization for vehicle routing problem with time windows. Int. J. Oper. Res. 6(4), 519–537 (2009)CrossRefMATH
9.
go back to reference Caseau, Y., Laburthe, S.: Heuristics for large constrained vehicle routing problems. J. Heurist. 5, 281–303 (1999)CrossRefMATH Caseau, Y., Laburthe, S.: Heuristics for large constrained vehicle routing problems. J. Heurist. 5, 281–303 (1999)CrossRefMATH
10.
go back to reference Potvin, J.Y., Bengio, S.: The vehicle routing problem with time windows part II: genetic search. INFORMS J. Comput. 8(2), 165–172 (1996)CrossRefMATH Potvin, J.Y., Bengio, S.: The vehicle routing problem with time windows part II: genetic search. INFORMS J. Comput. 8(2), 165–172 (1996)CrossRefMATH
11.
go back to reference Taillard, É., et al.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31(2), 170–186 (1997)CrossRefMATH Taillard, É., et al.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31(2), 170–186 (1997)CrossRefMATH
12.
go back to reference Schulze, J., Fahle, T.: A parallel algorithm for the vehicle routing problem with time window constraints. Ann. Oper. Res. 86, 585–607 (1999)MathSciNetCrossRefMATH Schulze, J., Fahle, T.: A parallel algorithm for the vehicle routing problem with time window constraints. Ann. Oper. Res. 86, 585–607 (1999)MathSciNetCrossRefMATH
13.
go back to reference Lau, H.C., et al.: Vehicle routing problem with time windows and a limited number of vehicles. Eur. J. Oper. Res. 148(3), 559–569 (2003)MathSciNetCrossRefMATH Lau, H.C., et al.: Vehicle routing problem with time windows and a limited number of vehicles. Eur. J. Oper. Res. 148(3), 559–569 (2003)MathSciNetCrossRefMATH
14.
go back to reference Tan, K.C., et al.: A hybrid multi-objective evolutionary algorithm for solving vehicle routing problem with time windows. Comput. Optim. Appl. 34(1), 115–151 (2006)MathSciNetCrossRefMATH Tan, K.C., et al.: A hybrid multi-objective evolutionary algorithm for solving vehicle routing problem with time windows. Comput. Optim. Appl. 34(1), 115–151 (2006)MathSciNetCrossRefMATH
Metadata
Title
A Constraint Based Heuristic for Vehicle Routing Problem with Time Windows
Authors
G. Poonthalir
R. Nadarajan
S. Geetha
Copyright Year
2016
Publisher
Springer Nature Singapore
DOI
https://doi.org/10.1007/978-981-10-3274-5_9

Premium Partner