×

Elitist genetic algorithm for assignment problem with imprecise goal. (English) Zbl 1109.90055

Summary: The objective of this research paper is to solve a generalized assignment problem with imprecise cost(s)/time(s) instead of precise one by elitist genetic algorithm (GA). Here, the impreciseness of cost(s)/time(s) has been represented by interval valued numbers, as interval valued numbers are the best representation than others like random variable representation with a known probability distribution and fuzzy representation. To solve these types of problems, an elitist GA has been developed with interval valued fitness function. In this developed GA, the existing ideas about the order relations of interval valued numbers have been modified from the point of view of two types of decision making viz., optimistic decision making and pessimistic decision making. This modified approach has been used in the selection process for selecting better chromosomes/individuals for the next generation and in finding the best as well as the worst chromosomes/individuals in each generation. Here two new crossover schemes and two new mutation schemes have been introduced. In order to maintain the feasibility with crossover operations, a repair algorithm has been suggested. Extensive comparative computational studies based on different parameters of our developed algorithm on one illustrative example have also been reported.

MSC:

90B80 Discrete location and assignment
90C59 Approximation methods and heuristics in mathematical programming

Software:

Genocop
Full Text: DOI

References:

[1] Aickelin, U.; Dowsland, K. A., An indirect genetic algorithm for a nurse-scheduling problem, Computers and Operations Research, 31, 761-778 (2004) · Zbl 1048.90102
[2] Catrysse, D.; Van Wassenhove, L. N., A survey of algorithms for the generalized assignment problem, European Journal of Operational Research, 60, 260-272 (1992) · Zbl 0760.90071
[3] Chanas, S.; Kuchta, D., Multiobjective programming in optimization of interval objective functions—a generalized approach, European Journal of Operational Research, 94, 594-598 (1996) · Zbl 1006.90506
[4] Chu, P. C.; Beasley, J. E., A genetic algorithm for the generalised assignment problem, Computers and Operations Research, 24, 17-23 (1997) · Zbl 0881.90070
[5] Deb, K., Optimization for Engineering Design—Algorithms and Examples (1995), Prentice-Hall of India: Prentice-Hall of India New Delhi
[6] Gen, M.; Cheng, R., Genetic Algorithms and Engineering Design (1997), Wiley: Wiley New York
[7] Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning (1989), Addison-Wesley: Addison-Wesley New York · Zbl 0721.68056
[8] Harper, P. R.; de Senna, V.; Vieira, I. T.; Shahani, A. K., A genetic algorithm for the project assignment problem, Computers and Operations Research, 32, 1255-1265 (2005) · Zbl 1079.68620
[9] Holland, J. H., Adaptation of Natural and Artificial System (1975), University of Michigan Press: University of Michigan Press Ann Arbor · Zbl 0317.68006
[10] Ishibuchi, H.; Tanaka, H., Multiobjective programming in optimization of the interval objective function, European Journal of Operational Research, 48, 219-225 (1990) · Zbl 0718.90079
[11] Levine, D., Application of a hybrid genetic algorithm to airline crew-scheduling, Computers and Operations Research, 23, 547-558 (1996) · Zbl 0847.90097
[12] Lorena, L.; Narciso, M. G., Relaxation heuristics for a generalized assignment problem, European Journal of Operational Research, 91, 600-610 (1996) · Zbl 0924.90119
[13] Michalewicz, Z., Genetic Algorithms+Data Structure=Evolution Programs (1999), Springer-Verlag: Springer-Verlag Berlin
[14] Mitchell, M., An introduction to Genetic Algorithms (1996), MIT Press: MIT Press Cambridge
[15] Ross, G. T.; Soland, R. M., A branch and bound algorithm for the generalized assignment problem, Mathematical Programming, 8, 91-103 (1975) · Zbl 0308.90028
[16] Sakawa, M., Genetic Algorithms and Fuzzy Multiobjective Optimization (2002), Kluwer Academic Publishers · Zbl 1039.90102
[17] Sengupta, A.; Pal, T. K., Theory and methodology on comparing interval numbers, European Journal of Operational Research, 127, 28-43 (2000) · Zbl 0991.90080
[18] Wilson, J. M., A genetic algorithm for the generalised assignment problem, Journal of the Operational Research Society, 48, 804-809 (1997) · Zbl 0890.90145
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.