A variable iterated greedy algorithm for the traveling salesman problem with time windows

Information Sciences

Volumn 279, Issue , 2014, Pages 383-395

  Karabulut, Korhan ^a   Fatih Tasgetiren, M ^a  

^a YASAR UNIVERSITY   (Turkey)

Author keywords

Heuristic optimization; Iterated greedy algorithm; Traveling salesman problem with time windows; Variable neighborhood search

Indexed keywords

PRODUCTION CONTROL; PRODUCTION ENGINEERING; SCHEDULING ALGORITHMS;

HEURISTIC OPTIMIZATION; ITERATED GREEDY ALGORITHM; LOGISTIC OPERATIONS; NEIGHBORHOOD CHANGE; PRODUCTION SCHEDULING; SOLUTION COMPONENTS; TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS; VARIABLE NEIGHBORHOOD SEARCH;

TRAVELING SALESMAN PROBLEM;

EID: 84901847300     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2014.03.127     Document Type: Article

References (42)

1. M.W.P. Savelsbergh Local search in routing problems with time windows Ann. Oper. Res. 4 1 1985 285 305
2. N. Christofides, A. Mingozzi, and P. Toth State-space relaxation procedures for the computation of bounds to routing problems Networks 11 2 1981 145 164
3. E.K. Baker An exact algorithm for the time-constrained traveling salesman problem Oper. Res. 31 5 1983 938 945
4. A. Langevin, M. Desrochers, J. Desrosiers, S. Gelinas, and F. Soumis A two-commodity flow formulation for the traveling salesman and makespan problems with time windows Networks 23 7 1993 631 640
5. Y. Dumas, J. Desrosiers, E. Gelinas, and M.M. Solomon An optimal algorithm for the traveling salesman problem with time windows Oper. Res. 43 2 1995 367 371
6. N. Ascheuer, M. Fischetti, and M. Grotschel Solving asymmetric travelling salesman problem with time windows by branch-and-cut Math. Program. 90 2001 475 506
7. E. Balas, and N. Simonetti Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study INFORMS J. Comput. 13 1 2001 56 75
8. G. Pesant, M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau An exact constraint logic programming algorithm for the traveling salesman problem with time windows Transp. Sci. 32 1998 12 29
9. F. Focacci, A. Lodi, and M. Milano A hybrid exact algorithm for the TSPTW INFORMS J. Comput. 14 2002 403 417
10. W.B. Carlton, and J.W. Barnes Solving the traveling-salesman problem with time windows using tabu search IIE Trans. 28 1996 617 629
11. M. Gendreau, A. Hertz, G. Laporte, and M. Stan A generalized insertion heuristic for the traveling salesman problem with time windows Oper. Res. 46 1998 330 335
12. M. Gendreau, A. Hertz, and G. Laporte New insertion and post optimization procedures for the traveling salesman problem Oper. Res. 40 1992 1086 1094
13. R.W. Calvo A new heuristic for the traveling salesman problem with time windows Transp. Sci. 34 1 2000 113 124
14. J.W. Ohlmann, and B.W. Thomas A compressed-annealing heuristic for the traveling salesman problem with time windows INFORMS J. Comput. 19 1 2007 80 90
15. C.-B. Cheng, and C.-P. Mao A modified ant colony system for solving the travelling salesman problem with time windows Math. Comput. Model. 46 2007 1225 1235
16. M.L. Ibanez, and C. Blum Beam-ACO for the travelling salesman problem with time windows Comput. Oper. Res. 37 2010 1570 1583
17. R.F. Da Silva, and S. Urrutia A general VNS heuristic for the traveling salesman problem with time windows Discr. Optim. 7 2010 203 211
18. R. Ruiz, and T. Stützle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem Eur. J. Oper. Res. 177 3 2007 2033 2049
19. J.M. Framinan, and R. Leisten Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm Int. J. Prod. Res. 46 22 2008 6479 6498
20. G. Gerardo Minella, R. Ruiz, and M. Ciavotta Restarted iterated Pareto greedy algorithm for multi-objective flowshop scheduling problems Comput. Oper. Res. 38 2011 1521 1533
21. M. Fatih Tasgetiren, Q.-K. Pan, P.N. Suganthan, and H.-L. Chen Angela A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops Inf. Sci. 181 2011 3459 3475
22. Q. Qinma Kanga, H. Heb, and H. Song Task assignment in heterogeneous computing systems using an effective iterated greedy algorithm J. Syst. Softw. 84 2011 985 992
23. I. Ribas, R. Ramon Companys, and X. Tort-Martorell An iterated greedy algorithm for the flowshop scheduling problem with blocking Omega 39 2011 293 301
24. M. Fatih Tasgetiren, Q.-K. Pan, and Y.-C. Liang A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times Comput. Oper. Res. 36 2009 1900 1915
25. Q.-K. Pan, M. Fatih Tasgetiren, and Y.-C. Liang A discrete differential evolution algorithm for the permutation flowshop scheduling problem Comput. Ind. Eng. 55 2008 795 816
26. R. Ruiz, and T. Stützle An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives Eur. J. Oper. Res. 187 2008 1143 1159
27. L. Fanjul-Peyro, and R. Ruiz Iterated greedy local search methods for unrelated parallel machine scheduling Eur. J. Oper. Res. 207 2010 55 69
28. M. Lozano, D. Molina, and C. Garcia-Martinez Iterated greedy for the maximum diversity problem Eur. J. Oper. Res. 214 2011 31 38
29. K.-C. Kuo-Ching Ying, S.-W. Lin, and C.-Y. Huang Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic Expert Syst. Appl. 36 2009 7087 7092
30. K.-C. Ying, and H.-M. Cheng Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic Expert Syst. Appl. 37 2010 2848 2852
31. C. Kahraman, O. Engin, I. Kaya, and R.E. Ozturk Multiprocessor task scheduling in multistage hybrid flow-shops: a parallel greedy algorithm approach Appl. Soft Comput. 10 2010 1293 1300
32. S. Bouamama, C. Blum, and A. Boukerram A population-based iterated greedy algorithm for the minimum weight vertex cover problem Appl. Soft Comput. J. 2012 10.1016/j.asoc.2012.02.013
33. N. Mladenovic, and P. Hansen Variable neighborhood search Comput. Oper. Res. 24 1997 1097 1100
34. M. Nawaz, E.E. Enscore Jr., and I.A. Ham Heuristic algorithm for the m-machine, n-node flow shop sequencing problem Omega 11 1 1983 91 95
35. Coello Carlos A. Coello Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art Comput. Methods Appl. Mech. Eng. 191 11-12 2002 1245 1287
36. K. Deb An efficient constraint handling method for genetic algorithms Comput. Methods Appl. Mech. Eng. 186 2000 311 338
37. D.W. Coit, and A.E. Smith Penalty guided genetic search for reliability design optimization Comput. Ind. Eng. 30 4 1996 895 904
38. Mitsuo Gen, and R. Cheng Genetic Algorithms and Engineering Optimization 2000 John Wiley and Sons
39. J.-Y. Potvin, and S. Bengio The vehicle routing problem with time windows Part II: genetic search INFORMS J. Comput. 8 1996 165 172
40. M.M. Solomon Algorithms for the vehicle routing and scheduling problems with time windows constraints Oper. Res. 35 2 1987 254 265
41. Cai Xingjuan, Fan Shujing, and Tan Ying Light responsive curve selection for photosynthesis operator of APOA Int. J. Bio-Inspired Comput. 4 6 2012 373 379
42. Xie Liping, Zeng Jianchao, and Richard A. Formato Selection strategies for gravitational constant G in artificial physics optimisation based on analysis of convergence properties Int. J. Bio-Inspired Comput. 4 6 2012 380 391