default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlireza Rahimi-Vahed
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j10]Alireza Rahimi-Vahed, Teodor Gabriel Crainic
, Michel Gendreau, Walter Rei:
Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Comput. Oper. Res. 53: 9-23 (2015)- 2013
- [j9]Alireza Rahimi-Vahed, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei:
A path relinking algorithm for a multi-depot periodic vehicle routing problem. J. Heuristics 19(3): 497-524 (2013)
2000 – 2009
- 2009
- [j8]Reza Tavakkoli-Moghaddam, Alireza Rahimi-Vahed, Ali Ghodratnama, Ali Siadat:
A simulated annealing method for solving a new mathematical model of a multi-criteria cell formation problem with capital constraints. Adv. Eng. Softw. 40(4): 268-273 (2009) - 2008
- [j7]Alireza Rahimi-Vahed, Ali Hossein Mirzaei:
Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm. Soft Comput. 12(5): 435-452 (2008) - 2007
- [j6]Alireza Rahimi-Vahed, Masoud Rabbani, Reza Tavakkoli-Moghaddam, S. Ali Torabi, Fariborz Jolai:
A multi-objective scatter search for a mixed-model assembly line sequencing problem. Adv. Eng. Informatics 21(1): 85-99 (2007) - [j5]Alireza Rahimi-Vahed, Ali Hossein Mirzaei:
A hybrid multi-objective shuffled frog-leaping algorithm for a mixed-model assembly line sequencing problem. Comput. Ind. Eng. 53(4): 642-666 (2007) - [j4]Reza Tavakkoli-Moghaddam, Alireza Rahimi-Vahed, Ali Hossein Mirzaei:
A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness. Inf. Sci. 177(22): 5072-5090 (2007) - [j3]Alireza Rahimi-Vahed, S. M. Mirghorbani:
A multi-objective particle swarm for a flow shop scheduling problem. J. Comb. Optim. 13(1): 79-102 (2007) - [j2]Alireza Rahimi-Vahed, S. M. Mirghorbani, Masoud Rabbani:
A new particle swarm algorithm for a multi-objective mixed-model assembly line sequencing problem. Soft Comput. 11(10): 997-1012 (2007) - [c5]Reza Tavakkoli-Moghaddam, Alireza Rahimi-Vahed, Ali Hossein Mirzaei:
Solving a Bi-Criteria Permutation Flow Shop Problem Using Immune Algorithm. CISched 2007: 49-56 - 2006
- [j1]Reza Tavakkoli-Moghaddam, Alireza Rahimi-Vahed:
Multi-criteria sequencing problem for a mixed-model assembly line in a JIT production system. Appl. Math. Comput. 181(2): 1471-1481 (2006) - [c4]Reza Tavakkoli-Moghaddam, Alireza Rahimi-Vahed:
A Memetic Algorithm for Multi-Criteria Sequencing Problem for a Mixed-Model Assembly Line in a JIT Production System. IEEE Congress on Evolutionary Computation 2006: 2993-2998 - [c3]Alireza Rahimi-Vahed, Masoud Rabbani, Reza Tavakkoli-Moghaddam, Fariborz Jolai, Neda Manavizadeh:
Mixed-Model Assembly Line Sequencing Using Real Options. OR 2006: 161-167 - [c2]Masoud Rabbani, Alireza Rahimi-Vahed, Babak Javadi, Reza Tavakkoli-Moghaddam:
A New Approach for Mixed-Model Assembly Line Sequencing. OR 2006: 169-174 - [c1]S. M. Mirghorbani, Masoud Rabbani, Reza Tavakkoli-Moghaddam, Alireza Rahimi-Vahed:
A Multi-Objective Particle Swarm for a Mixed-Model Assembly Line Sequencing. OR 2006: 181-186
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-04-24 23:18 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:
