Author:
Roy Arindam,Chakraborty Goutam,Khan Indadul,Maity Samir,Maiti Manoranjan
Reference22 articles.
1. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The traveling salesman problem: G. E. Re Guided tour of combinatorial optimization. Wiley, New York (1985)
2. Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the TSPTW. Inform. J. Comput. 14(4), 403–417 (2002)
3. Chang, T., Wan, Y., Tooi, W.: A stochastic dynamic travelling salesman problem with hard time windows. Eur. J. Op. Res. 198(3), 748–759 (2009)
4. Petersen, H.L., Madsen, O.B.G.: The double travelling salesman problem with multiple stack—formulation heuristic solution approaches. Eur. J. Op. Res. 198, 339–347 (2009)
5. Majumder, A.K., Bhunia, A.K.: Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J. Comput. Appl. Math. 235(9), 3063–3078 (2011)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献