Solving permutational routing problems by population-based metaheuristics

Computers and Industrial Engineering

Volumn 57, Issue 1, 2009, Pages 269-276

  Bozejko, Wojciech ^a   Wodecki, Mieczysław ^b  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

Metaheuristics; Single machine problem; TSP; TSP with due dates

Indexed keywords

DUE DATES; FUNDAMENTAL PROBLEM; LOCAL OPTIMA; META HEURISTIC ALGORITHM; METAHEURISTICS; NP-HARD; ROUTING PROBLEMS; SCHEDULING PROBLEM; SEQUENCE-DEPENDENT SETUP TIME; SINGLE MACHINE PROBLEM; SINGLE MACHINE TOTAL WEIGHTED TARDINESS PROBLEM; SUBOPTIMAL SOLUTION; TOTAL-WEIGHTED TARDINESS; TSP; TSP WITH DUE DATES;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY;

TRAVELING SALESMAN PROBLEM;

EID: 67349145992     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2008.11.022     Document Type: Article

References (23)

1. Chia, Y. L., Glynn, P. W. (2007). Optimal convergence rate for random search. In Proceedings of the 2007 INFORMS simulation society research workshop, .
2. Cicirello V.A. Non-wrapping order crossover: An order preserving crossover operator that respect absolute position. Proceedings of the 8th annual genetic and evolutionary computation conference GECCO 2006 (2006), ACM Press
3. Cicirello V.A., and Smith S.F. Enhancing stochastic search performance by value-based randomization of heuristics. Journal of Heuristics 11 (2005) 5-34
4. DePuy G.W., Morga R.J., and Whitehouse G.E. Meta-RaPS: A simple and effective approach for solving the traveling salesman problem. Transportation Research Part E 41 (2005) 115-130
5. Dongarra, J. J. (1994). Performance of various computers using standard linear equations software, technical report CS-89-85, University of Tennessee.
6. Fischetti M., and Toth P. A polyhedral approach to the asymmetric traveling salesman problem. Management Science 43 11 (1997) 1520-1536
7. Gagné C., Price W.L., and Gravel M. Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. Journal of the Operational Research Society 53 (2002) 895-906
8. Hanafi S. On the convergence of tabu search. Journal of Heuristics 7 (2000) 47-58
9. Knox J. Tabu search performance on the symmetric traveling salesman problem. Computers & Operations Research (1994) 867-876
10. Lee Y.H., Bhaskaran K., and Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions 29 (1997) 45-52
11. Lenstra J.K., Rinnoy Kan A.G.H., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
12. Leung K.-S., Jin H.-D., and Xu Z.-B. An expanding self-organizing neural network for the traveling salesman problem. Neurocomputing 62 (2004) 267-292
13. Liao C.-J., and Juan H.C. An ant opimization for single-machine tardiness shceduling with sequence-dependent setups. Computers & Operations Research 34 (2007) 1899-1909
14. Lin S., and Ying K.-C. Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. International Journal of Advanced Manufacturing Technology (2006) 10.1007/s00170-006-0693-1
15. Lo C.C., and Hus C.C. Annealing framework with learning memory. IEEE Transaction on System, Man, Cybernetics, Part A 28 5 (1998) 1-13
16. Lysgaard J. Cluster based branching for the asymmetric traveling salesman problem. European Journal of Operational Research 119 2 (1999) 314325
17. Potts C.N., and Van Wassenhove L.N. Single machine tardiness sequencing heuristics. IIE Transactions 23 (1991) 346-354
18. Reinelt G. The traveling salesman: Computational solutions for TSP applications (1994), Springer, Berlin
19. Sahni S., and Teogilo G. P-complee approximation problems. Journal of the Association for Computing Machinery 23 3 (1976) 555-565
20. Tan K.C., Narasimban R., Rubin P.A., and Ragatz G.L. A comparison on four methods for minimizing total tardiness on a single procesor with sequence dependent setup times. Omega 28 (2000) 313-326
21. Tsai Ch.F., Tsai C.W., and Tseng Ch.Ch. A new hybrid heuristic approach for solving large traveling salesman problem. Information Sciences 166 (2004) 67-81
22. TSPLIB (1995). Available from: .
23. WINTUNE98 (1998). Available from: .