IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v177y2007i2p684-692.html
   My bibliography  Save this article

Elitist genetic algorithm for assignment problem with imprecise goal

Author

Listed:
  • Majumdar, J.
  • Bhunia, A.K.

Abstract

No abstract is available for this item.

Suggested Citation

  • Majumdar, J. & Bhunia, A.K., 2007. "Elitist genetic algorithm for assignment problem with imprecise goal," European Journal of Operational Research, Elsevier, vol. 177(2), pages 684-692, March.
    • Handle: RePEc:eee:ejores:v:177:y:2007:i:2:p:684-692
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00936-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ishibuchi, Hisao & Tanaka, Hideo, 1990. "Multiobjective programming in optimization of the interval objective function," European Journal of Operational Research, Elsevier, vol. 48(2), pages 219-225, September.
    2. Sengupta, Atanu & Pal, Tapan Kumar, 2000. "On comparing interval numbers," European Journal of Operational Research, Elsevier, vol. 127(1), pages 28-43, November.
    3. Lorena, Luiz Antonio N. & Narciso, Marcelo G., 1996. "Relaxation heuristics for a generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 600-610, June.
    4. Cattrysse, Dirk G. & Van Wassenhove, Luk N., 1992. "A survey of algorithms for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 60(3), pages 260-272, August.
    5. Chanas, Stefan & Kuchta, Dorota, 1996. "Multiobjective programming in optimization of interval objective functions -- A generalized approach," European Journal of Operational Research, Elsevier, vol. 94(3), pages 594-598, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sujeet Kumar Singh & Deepika Rani, 2019. "A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 56(3), pages 1007-1023, September.
    2. Bao-Jun Tang & Yu-Jie Hu, 2019. "How to Allocate the Allowance for the Aviation Industry in China’s Emissions Trading System," Sustainability, MDPI, vol. 11(9), pages 1-18, May.
    3. P. K. De & Bharti Yadav, 2012. "A General Approach for Solving Assignment Problems Involving with Fuzzy Cost Coefficients," Modern Applied Science, Canadian Center of Science and Education, vol. 6(3), pages 1-2, March.
    4. Xu, Jiuping & Yang, Xin & Tao, Zhimiao, 2015. "A tripartite equilibrium for carbon emission allowance allocation in the power-supply industry," Energy Policy, Elsevier, vol. 82(C), pages 62-80.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Abhijit Baidya & Uttam Kumar Bera & Manoranjan Maiti, 2016. "The grey linear programming approach and its application to multi-objective multi-stage solid transportation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 53(3), pages 500-522, September.
    2. Wei Wang & Yaofeng Xu & Liguo Hou, 2019. "Optimal allocation of test times for reliability growth testing with interval-valued model parameters," Journal of Risk and Reliability, , vol. 233(5), pages 791-802, October.
    3. Zhou, Feng & Huang, Gordon H. & Chen, Guo-Xian & Guo, Huai-Cheng, 2009. "Enhanced-interval linear programming," European Journal of Operational Research, Elsevier, vol. 199(2), pages 323-333, December.
    4. Wu, Hsien-Chung, 2009. "The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions," European Journal of Operational Research, Elsevier, vol. 196(1), pages 49-60, July.
    5. Norina Szander & Lorenzo Ros-McDonnell & María Victoria De-la-Fuente-Aragón & Robert Vodopivec, 2018. "Sustainable Urban Homecare Delivery with Different Means of Transport," Sustainability, MDPI, vol. 10(2), pages 1-12, February.
    6. Sarat Sivaprasad & Cameron A. MacKenzie, 2018. "The Hurwicz Decision Rule’s Relationship to Decision Making with the Triangle and Beta Distributions and Exponential Utility," Decision Analysis, INFORMS, vol. 15(3), pages 139-153, September.
    7. P. Kumar & A. K. Bhurjee, 2022. "Multi-objective enhanced interval optimization problem," Annals of Operations Research, Springer, vol. 311(2), pages 1035-1050, April.
    8. Sevastjanov, P.V. & Róg, P., 2003. "Fuzzy modeling of manufacturing and logistic systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 63(6), pages 569-585.
    9. Oliveira, Carla & Antunes, Carlos Henggeler, 2007. "Multiple objective linear programming models with interval coefficients - an illustrated overview," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1434-1463, September.
    10. Jiang, C. & Zhang, Z.G. & Zhang, Q.F. & Han, X. & Xie, H.C. & Liu, J., 2014. "A new nonlinear interval programming method for uncertain problems with dependent interval variables," European Journal of Operational Research, Elsevier, vol. 238(1), pages 245-253.
    11. H. Edwin Romeijn & Dolores Romero Morales, 2001. "Generating Experimental Data for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 49(6), pages 866-878, December.
    12. T. Antczak, 2018. "Exactness Property of the Exact Absolute Value Penalty Function Method for Solving Convex Nondifferentiable Interval-Valued Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 176(1), pages 205-224, January.
    13. Subhendu Ruidas & Mijanur Rahaman Seikh & Prasun Kumar Nayak, 2020. "An EPQ model with stock and selling price dependent demand and variable production rate in interval environment," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(2), pages 385-399, April.
    14. Jiang, C. & Han, X. & Liu, G.R. & Liu, G.P., 2008. "A nonlinear interval number programming method for uncertain optimization problems," European Journal of Operational Research, Elsevier, vol. 188(1), pages 1-13, July.
    15. Xu, Zeshui & Chen, Jian, 2008. "Some models for deriving the priority weights from interval fuzzy preference relations," European Journal of Operational Research, Elsevier, vol. 184(1), pages 266-280, January.
    16. Mrinal Jana & Geetanjali Panda, 2018. "$$\chi$$ χ -Optimal solution of single objective nonlinear optimization problem with uncertain parameters," OPSEARCH, Springer;Operational Research Society of India, vol. 55(1), pages 165-186, March.
    17. Fang-Xuan Hong & Deng-Feng Li, 2017. "Nonlinear programming method for interval-valued n-person cooperative games," Operational Research, Springer, vol. 17(2), pages 479-497, July.
    18. Narciso, Marcelo G. & Lorena, Luiz Antonio N., 1999. "Lagrangean/surrogate relaxation for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 114(1), pages 165-177, April.
    19. Diaz, Juan A. & Fernandez, Elena, 2001. "A Tabu search heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 132(1), pages 22-38, July.
    20. Jafar Rezaei & Negin Salimi, 2015. "Optimal ABC inventory classification using interval programming," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(11), pages 1944-1952, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:177:y:2007:i:2:p:684-692. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.