144
Views
20
CrossRef citations to date
0
Altmetric
General Paper

Competitive travelling salesmen problem: A hyper-heuristic approach

&
Pages 208-216 | Received 01 Mar 2011, Accepted 01 Feb 2012, Published online: 21 Dec 2017

References

  • ApplegateDBixbyRChvátalVCookWThe Travelling Salesman Problem: A Computational Study2006
  • BaiRBurkeEKendallGHeuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocationJournal of the Operational Research Society200859101387139710.1057/palgrave.jors.2602463
  • BektasTThe multiple traveling salesman problem: An overview of formulations and solution proceduresOmega200634320921910.1016/j.omega.2004.10.004
  • BurkeEKendallGSoubeigaEA tabu-search hyperheuristic for timetabling and rosteringJournal of Heuristics20039645147010.1023/B:HEUR.0000012446.94732.b6
  • Burke E, Kendall G, Newall J, Hart E, Ross P and Schulenburg S (2003b). Hyper-heurisitics: An emerging direction in modern search technology. In: Glover G and Kochenberger K (eds). Handbook of Metaheuristics. Chapter 16, Kluwer Academic Publishers: The Netherlands, pp 457–474.
  • BurkeEMcCollumBMeiselsAPetrovicSQuRA graph-based hyper-heuristic for educational timetabling problemsEuropean Journal of Operational Research2005176117719210.1016/j.ejor.2005.08.012
  • Burke EK, Hyde MR and Kendall G (2006). Evolving bin packing heuristics with genetic programming. In: Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN 2006). Lecture Notes in Computer Science, Vol. 4193, pp 860–869.
  • BurkeEHydeMKendallGOchoaGOzcanEWoodwardJExploring hyperheuristic methodologies with genetic programmingCollaborative Computational Intelligence2009177201
  • BurkeEHydeMKendallGWoodwardJA genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristicsIEEE Transactions on Evolutionary Computation201014694295810.1109/TEVC.2010.2041061
  • BurkeEHydeMKendallGOchoaGOzcanEWoodwardJA classification of hyper-heuristic approachesHandbook of Meta-Heuristics2010449468
  • Cowling P, Kendall G and Soubeiga E (2000). A hyperheuristic approach to scheduling a sales summit. Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling, PATAT 2000; Konstanz, Germany, pp 176–190.
  • GarridoPRiffMDVRP: A hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristicJournal of Heuristics200716679583410.1007/s10732-010-9126-2
  • GendreauMPotvinJMetaheuristics in combinatorial optimizationAnnals of Operations Research2005140118921310.1007/s10479-005-3971-7
  • GutinGPunnenAThe Travelling Salesman Problem and Its Variations2002
  • LaporteGA concise guide to the traveling salesman problemJournal of Operational Research Society2010611354010.1057/jors.2009.76
  • LawlerELenstraJKanAShmoysDThe Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization1986
  • NashJNoncooperative gamesAnnals of Mathematics195154228629510.2307/1969529
  • OsborneMRubinsteinAA course in Game Theory1999
  • Papadimitriou C and Roughgarden T (2005). Computing equilibria in multi-player games. In: Proceedings of 16th ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, pp 82–91.
  • PisingerDRopkeSA general heuristic for vehicle routing problemsComputers and Operations Research20073482403243510.1016/j.cor.2005.09.012
  • Ross P (2005). Hyper-heuristics. In: Burke EK and Kendall G (eds). Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer Science+Business Media, LLC, pp 529–556.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.