A Simulated Annealing Algorithm for the Multi Resource Generalized Assignment Problem with Eligibility Constraint

Erten, Kumsal; Saraç, Tuğba; Özçelik, Feriştah

doi:10.29109/gujsc.919665

Gazi Üniversitesi Fen Bilimleri Dergisi Part C: Tasarım Ve Teknoloji

2021

DOI: 10.29109/gujsc.919665

|View full text |Cite

A Simulated Annealing Algorithm for the Multi Resource Generalized Assignment Problem with Eligibility Constraint

Kumsal Erten

Tuğba Saraç

Feriştah Özçelik

Abstract: Bi-objective MRGAP with eligibility restrictions is considered • The objective of minimizing the total number of agents has been discussed for the first time in the MRGAP literature • A simulated annealing algorithm has been developed for considered problem.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Relationship

Self Cite0

Independent0

Authors

Journals

Cited by 0 publications

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

No citations

Set email alert for when this publication receives citations?

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

hi@scite.ai

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

Henderson, NV 89052, USA

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 Simulated Annealing Algorithm for the Multi Resource Generalized Assignment Problem with Eligibility Constraint

Abstract: Bi-objective MRGAP with eligibility restrictions is considered • The objective of minimizing the total number of agents has been discussed for the first time in the MRGAP literature • A simulated annealing algorithm has been developed for considered problem.

Cited by 0 publications

References 29 publications

No citations

Contact Info

Product

Resources

About