A Modified Teaching-Learning-Based Optimization Algorithm for Traveling Salesman Problem

Maji, Somnath; Mondal, Santanu; Maity, Samir; Giri, Debasis; Maiti, Manoranjan

doi:10.1007/978-981-19-5403-0_25

Human-Centric Smart Computing

2022

DOI: 10.1007/978-981-19-5403-0_25

|View full text |Cite

A Modified Teaching-Learning-Based Optimization Algorithm for Traveling Salesman Problem

Somnath Maji

Santanu Mondal

Samir Maity

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Canonical and Non-Canonical Approaches of the Discrete Teaching Learning Based Optimization

Rathod,

Yadav,

Rathore

2024

Int. j. math. eng. manag. sci.

View full text Add to dashboard Cite

Manufacturing plays a crucial role in robust economies, and effective optimization of manufacturing processes ensures competitive viability. Multi-hole drilling is a fundamental process in manufacturing, especially in the mass production of boilerplates, food processing separators, drum and trammel screens, and printed circuit boards, where optimizing drill tool paths is crucial for cost competitiveness. Multi-hole drill tool path sequencing is often framed as Traveling Salesman Problems, known for their NP-hard complexity. Researchers employed evolutionary algorithms to tackle the challenges associated with these NP-hard complexities. The recently proposed Discrete Teaching Learning Based Optimization (DTLBO) can address the intricacies of multi-hole drill tool path sequencing. This study proposes the use of DTLBO for multi-hole drill tool path sequencing optimization and highlights the critical distinctions between Canonical and Non-Canonical approaches of the DTLBO. Further, it assesses their performances through a comparative analysis using test problems, investigating the merits and demerits of these approaches. The findings of this investigation provide a foundation for refining the algorithms and improving their practical effectiveness, which will be pursued as future research. Notably, no prior research in the literature has undertaken such a comprehensive comparison.

show abstract

Canonical and Non-Canonical Approaches of the Discrete Teaching Learning Based Optimization

Rathod,

Yadav,

Rathore

2024

Int. j. math. eng. manag. sci.

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A Modified Teaching-Learning-Based Optimization Algorithm for Traveling Salesman Problem

Cited by 1 publication

References 9 publications

Canonical and Non-Canonical Approaches of the Discrete Teaching Learning Based Optimization

Canonical and Non-Canonical Approaches of the Discrete Teaching Learning Based Optimization

Contact Info

Product

Resources

About