MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
RAIRO-Oper. Res., 42 1 (2008) 3-33
Published online: 2008-02-21
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Multi- and many-objective path-relinking: A taxonomy and decomposition approach
Islame F.C. Fernandes, Elizabeth F.G. Goldbarg, Silvia M.D.M. Maia and Marco C. GoldbargComputers & Operations Research 133 105370 (2021)
https://doi.org/10.1016/j.cor.2021.105370
Business and Consumer Analytics: New Ideas
Pablo Moscato and Luke MathiesonBusiness and Consumer Analytics: New Ideas 545 (2019)
https://doi.org/10.1007/978-3-030-06222-4_13
Handbook of Metaheuristics
Michel Gendreau and Jean-Yves PotvinInternational Series in Operations Research & Management Science, Handbook of Metaheuristics 272 37 (2019)
https://doi.org/10.1007/978-3-319-91086-4_2
A gradual weight-based ant colony approach for solving the multiobjective multidimensional knapsack problem
Imen Ben Mansour, Ines Alaya and Moncef TaginaEvolutionary Intelligence 12 (2) 253 (2019)
https://doi.org/10.1007/s12065-019-00222-9
Software Technologies
Imen Ben Mansour, Ines Alaya and Moncef TaginaCommunications in Computer and Information Science, Software Technologies 868 210 (2018)
https://doi.org/10.1007/978-3-319-93641-3_10
163 (2017)
https://doi.org/10.1109/ICCP.2017.8116999
A COMPARATIVE STUDY OF CROSSOVER OPERATORS FOR GENETIC ALGORITHMS TO SOLVE TRAVELLING SALESMAN PROBLEM
Wafaa Mustafa Hameed and Asan Baker KanbarInternational Journal of Research -GRANTHAALAYAH 5 (2) 284 (2017)
https://doi.org/10.29121/granthaalayah.v5.i2.2017.1740
An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics
George Mavrotas, Kostas Florios and José Rui FigueiraApplied Mathematics and Computation 270 25 (2015)
https://doi.org/10.1016/j.amc.2015.08.018
Hybridization of Decomposition and Local Search for Multiobjective Optimization
Liangjun Ke, Qingfu Zhang and Roberto BattitiIEEE Transactions on Cybernetics 44 (10) 1808 (2014)
https://doi.org/10.1109/TCYB.2013.2295886
Greedy algorithms for a class of knapsack problems with binary weights
Jochen Gorski, Luís Paquete and Fábio PedrosaComputers & Operations Research 39 (3) 498 (2012)
https://doi.org/10.1016/j.cor.2011.02.010
The multiobjective multidimensional knapsack problem: a survey and a new approach
Thibaut Lust and Jacques TeghemInternational Transactions in Operational Research 19 (4) 495 (2012)
https://doi.org/10.1111/j.1475-3995.2011.00840.x
Evolutionary Multi-Criterion Optimization
Thibaut Lust, Jacques Teghem and Daniel TuyttensLecture Notes in Computer Science, Evolutionary Multi-Criterion Optimization 6576 254 (2011)
https://doi.org/10.1007/978-3-642-19893-9_18
Multiple crossover genetic algorithm for the multiobjective traveling salesman problem
Semya Elaoud, Jacques Teghem and Taïcir LoukilElectronic Notes in Discrete Mathematics 36 939 (2010)
https://doi.org/10.1016/j.endm.2010.05.119