A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem
dc.contributor.author | Dengiz, B. | en_US |
dc.contributor.author | Alabaş-Uslu, Ç. | en_US |
dc.contributor.author | Sabuncuoğlu, İhsan | en_US |
dc.coverage.spatial | Nashville, TN, USA | en_US |
dc.date.accessioned | 2016-02-08T11:34:39Z | |
dc.date.available | 2016-02-08T11:34:39Z | |
dc.date.issued | 2009 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description | Date of Conference: 2 April-30 March 2009 | en_US |
dc.description | Conference Name: IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 | en_US |
dc.description.abstract | In this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these heuristics are quite effective to solve the problem, they suffer from the need to optimize parameters. The proposed heuristic, named STLS, has a single self-tuning parameter which is calculated and updated dynamically based on both the response surface information of the problem field and the performance measure of the method throughout the search process. Especially, application simplicity of the algorithm is attractive for the users. Results of the experimental study show that STLS generates high quality solutions and outperforms the basic tabu search, simulated annealing, and record-to-record travel algorithms which are well-known local search based metaheuristics. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T11:34:39Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2009 | en |
dc.identifier.doi | 10.1109/SCIS.2009.4927016 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/26748 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/SCIS.2009.4927016 | en_US |
dc.source.title | Proceedings of the IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 | en_US |
dc.subject | Experimental studies | en_US |
dc.subject | High-quality solutions | en_US |
dc.subject | Local search | en_US |
dc.subject | Local search heuristic | en_US |
dc.subject | Meta heuristics | en_US |
dc.subject | Metaheuristic | en_US |
dc.subject | Np-completeness | en_US |
dc.subject | Performance measure | en_US |
dc.subject | Permutation flow-shop scheduling | en_US |
dc.subject | Record-to-record travels | en_US |
dc.subject | Response surface | en_US |
dc.subject | Search process | en_US |
dc.subject | Selftuning | en_US |
dc.subject | Computational complexity | en_US |
dc.subject | Heuristic algorithms | en_US |
dc.subject | Heuristic methods | en_US |
dc.subject | Simulated annealing | en_US |
dc.subject | Tabu search | en_US |
dc.subject | Tuning | en_US |
dc.subject | Problem solving | en_US |
dc.title | A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem.pdf
- Size:
- 519.33 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version