A new hybrid heuristic approach for solving large traveling salesman problem
From MaRDI portal
Publication:1886765
DOI10.1016/j.ins.2003.11.008zbMath1076.90063OpenAlexW1983172855MaRDI QIDQ1886765
Ching-Chang Tseng, Cheng-Fa Tsai, Chun-Wei Tsai
Publication date: 19 November 2004
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2003.11.008
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
Discrete heat transfer search for solving travelling salesman problem ⋮ Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem ⋮ A novel bio-inspired approach based on the behavior of mosquitoes ⋮ Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem ⋮ Path planning on a cuboid using genetic algorithms ⋮ A two-storage multi-item inventory model with hybrid number and nested price discount via hybrid heuristic algorithm ⋮ A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times ⋮ A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem ⋮ Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems ⋮ Metaheuristic applications on discrete facility location problems: a survey
Uses Software
Cites Work
This page was built for publication: A new hybrid heuristic approach for solving large traveling salesman problem
