The oil drilling model and iterative deepening genetic annealing algorithm for the traveling salesman problem
In this work, we liken the solving of combinatorial optimization problems under a prescribed computational budget as hunting for oil in an unexplored ground. Using this generic model, we instantiate an iterative deepening genetic annealing (IDGA) algorithm, which is a variant of memetic algorithms....
Saved in:
Main Authors: | LAU, Hoong Chuin, XIAO, Fei |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2008
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/240 https://ink.library.smu.edu.sg/context/sis_research/article/1239/viewcontent/OilDrillingModelTSP_2008_afv.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
An efficient hybrid genetic algorithm for the quadratic traveling salesman problem
by: PHAM, Quang Anh, et al.
Published: (2023) -
Towards an intelligent meta-heuristics development framework
by: LAU, Hoong Chuin, et al.
Published: (2007) -
Graph convolutional neural networks for the travelling salesman problem
by: Joshi, Chaitanya Krishna
Published: (2019) -
Enhancing the Speed and Accuracy of Automated Parameter Tuning in Heuristic Design
by: LAU, Hoong Chuin, et al.
Published: (2009) -
On using genetic algorithms to support post-solution deliberation in the generalized assignment problem
by: KIMBROUGH, Steven O., et al.
Published: (2009)