A new hybrid heuristic approach for solving green traveling salesman problem

41st International Conference on Computers and Industrial Engineering 2011

Volumn , Issue , 2011, Pages 202-207

  Özceylan, Eren ^a   Kiran, Mustafa Servet ^a   Atasagun, Yakup ^a  

^a SELCUK UNIVERSITY   (Turkey)

Author keywords

Ant colony optimization; Artificial bee colony; Green travelling salesman problem; Hybrid; Nonlinear mixed integer programming

Indexed keywords

ANT COLONY OPTIMIZATION (ACO); ARTIFICIAL BEE COLONIES; ARTIFICIAL BEE COLONIES (ABC); COMPUTATIONAL EXPERIMENT; HYBRID; NON-LINEAR MIXED INTEGER PROGRAMMING; TRAVELLING SALESMAN PROBLEM; TRAVELLING SALESMAN PROBLEM (TSP);

ALGORITHMS; ANT COLONY OPTIMIZATION; CARBON DIOXIDE; HEURISTIC METHODS; INDUSTRIAL ENGINEERING; MATHEMATICAL MODELS; TRAVELING SALESMAN PROBLEM;

PROBLEM SOLVING;

EID: 84886875656     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Allwright, J.R.A., Carpenter, D.B., 1989. A distributed implementation of simulated annealing for the traveling salesman problem. Parallel Computing 10(3), 335-338.
2. Anderson, D.R., Sweeney, D.J., Williams, T.A., Martin, K., 2008. An introduction to management science: quantitative approaches to decision making. 12th Edition, Thomson Corporation, 407-408.
3. Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J., 2007. The traveling salesman problem: a computational study. Princeton Series in Applied Mathematics. Princeton University Press. ISBN 978-0-691- 12993-8.
4. Banharnsakun, A., Achalakul, T., Sirinaovakul, B., 2010. ABC-GSX: a hybrid method for solving the traveling salesman problem. Second World Congress on Nature and Biologically Inspired Computing, 7-12.
5. Baraglia, R., Hidalgo, J.I., Perego, R., 2001. A hybrid heuristic for the traveling salesman problem. IEEE Transactions on Evolutionary Computation 5(6), 613-622.
6. Bektaş, T., 2006. The multiple traveling salesman problems: an overview of formulations and solution procedures. Omega 34(3), 209-219.
7. Bektaş, T., Laporte, G., 2011. The pollution routing problem. Transportation Research Part B. doi:10.1016/j.trb.2011.02.004.
8. Dorigo, M., Gambardella, L.M., 1997. Ant colonies for travelling salesman problem. BioSystems 43, 73-81.
9. th WSEAS International Conference on Artificial Intelligence, 206-210.
10. Forkenbrock, D.J., 1999. External costs of intercity truck freight transportation. Transportation Research Part A 33, 505-526.
11. Gomez-Cabrero, D., Armero, C., Ranasinghe, D.N., 2007. The traveling salesman's problem: a self-adapting PSO-ACS algorithm. Second International Conference on Industrial and Information Systems, 479-484.
12. Kara, I., Kara, B.Y., Yetiş, M.K., 2007. Energy minimizing vehicle routing problem. Combinatorial Optimization and Applications. Lecture Notes in Computer Science 4616, 62-71.
13. Karaboǧa, D., 2005. An idea based on honeybee swarm for numerical optimization. Technical Report TR06.
14. Erciyes University. Engineering Faculty. Computer Engineering Department.
15. Karaboǧa, D., Görkemli, B., 2011. A combinatorial artificial bee colony algorithm for traveling salesman problem. International Symposium on Innovations in Intelligent Systems and Applications. Istanbul. Turkey.
16. Knox, J., 1994. Tabu search performance on the symmetric traveling salesman problem. Computers and Operations Research 21(8), 867-876.
17. Majumdar, J., Bhunia, A.K., 2011. Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. Journal of Computational and Applied Mathematics 235(9), 3063-3078.
18. Palmer, A., 2007. The development of an integrated routing and carbon dioxide emissions model for goods vehicles. PhD Thesis. Cranfield University. School of Management. https://dspace.lib.cranfield.ac.uk/bitstream/1826/2547/1/ Palmer%20A%20PhD.pdf. Access date: 13.07.2011.
19. Rego, C., Gamboa, D., Glover, F., Osterman, C., 2011. Traveling salesman problem heuristics: leading methods, implementations and latest advances. European Journal of Operational Journal 211(3), 427-441.
20. Takahashi, R., 2009. A hybrid method of genetic algorithms and ant colony optimization to solve the traveling salesman problem. International Conference on Machine Learning and Applications, 81-88.
21. Uǧur, A., Aydin, D., 2009. An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms. Advances in Engineering Software 40, 341-349.
22. 2 tours within a traveling salesman problem. in Di Chio et al. (Eds.). Evo Applications, 421-430.
23. Zhong, W.-L., Zhang, J., Chen, W.-N., 2007. A novel discrete particle swarm optimization to solve traveling salesman problem. IEEE Congress on Evolutionary Computation, 3283-3287.
24. Wong, L.P., Low, M.Y.H., Chong, C.S., 2008. A bee colony optimization algorithm for traveling salesman problem. Second Asia International Conference on Modeling and Simulation, 818-823.