default search action
Inès Alaya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c14]Samia Sammoud
, Inès Alaya
A New Ant Population Based Improvement Heuristic for Solving Large Scale TSP. ICCCI (CCIS Volume) 2023: 495-507 - 2022
- [j3]Mouna Bouzid, Inès Alaya, Moncef Tagina:
A new artificial bee colony algorithm using a gradual weight method for the bi-objective traveling salesman problems. Evol. Intell. 15(3): 2077-2088 (2022) - [c13]Samia Sammoud
A new Ant colony optimization metaheuristic based on pheromone guided local search instead of constructive approach. GECCO 2022: 13-21 - 2021
- [c12]Mouna Bouzid, Inès Alaya, Moncef Tagina:
Guided Bee Colony Algorithm Applied to the Daily Car Pooling Problem. ICSOFT 2021: 465-472 - [c11]Imen Ben Mansour, Inès Alaya, Moncef Tagina:
Indicator Weighted Based Multi-Objective Approach using Self-Adaptive Neighborhood Operator. KES 2021: 338-347 - 2020
- [c10]Jamila Sassi, Inès Alaya, Moncef Tagina:
Bee-route: A Bee Algorithm for the Multi-objective Vehicle Routing Problem. ICSOFT 2020: 307-318 - [c9]Mouna Bouzid, Inès Alaya, Moncef Tagina:
A Bee Colony Optimization Algorithm for the Long-Term Car Pooling Problem. ICSOFT 2020: 319-327
2010 – 2019
- 2019
- [j2]Imen Ben Mansour
A gradual weight-based ant colony approach for solving the multiobjective multidimensional knapsack problem. Evol. Intell. 12(2): 253-272 (2019) - [c8]Wiem Zouari
A new hybrid ant colony algorithms for the traveling thief problem. GECCO (Companion) 2019: 95-96 - 2017
- [c7]Wiem Zouari
A Hybrid Ant Colony Algorithm with a Local Search for the Strongly Correlated Knapsack Problem. AICCSA 2017: 527-533 - [c6]Imen Ben Mansour
Chebyshev-based iterated local search for multi-objective optimization. ICCP 2017: 163-170 - [c5]Imen Ben Mansour
A Min-Max Tchebycheff Based Local Search Approach for MOMKP. ICSOFT 2017: 140-150 - [c4]Imen Ben Mansour
Solving Multiobjective Knapsack Problem Using Scalarizing Function Based Local Search. ICSOFT (Selected Papers) 2017: 210-228 - 2015
- [c3]Imen Ben Mansour
Indicator Based Ant Colony Optimization for Multi-objective Knapsack Problem. KES 2015: 448-457 - [c2]Wafa Nakbi, Inès Alaya
A Hybrid Lagrangian Search Ant Colony Optimization Algorithm for the Multidimensional Knapsack Problem. KES 2015: 1109-1119
2000 – 2009
- 2009
- [b1]Inès Alaya:
Optimisation multi-objectif par colonies de fourmis : cas des problèmes de sac à dos. (Multi-objective ant colony optimization : case of knapsack problems). Claude Bernard University Lyon 1, France, 2009 - 2007
- [j1]Inès Alaya, Christine Solnon, Khaled Ghédira:
Optimisation par colonies de fourmis pour le problème du sac à dos multidimensionnel. Tech. Sci. Informatiques 26(3-4): 371-390 (2007) - [c1]Inès Alaya
Ant Colony Optimization for Multi-Objective Optimization Problems. ICTAI (1) 2007: 450-457
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: