default search action
Andreas C. Nearchou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Paraskevi Th. Zacharia, Elias K. Xidias, Andreas C. Nearchou:
The fuzzy human-robot collaboration assembly line balancing problem. Comput. Ind. Eng. 187: 109774 (2024) - [j28]Marinos Aristotelous, Andreas C. Nearchou:
An Empirical Analysis of a Set of Hybrid Heuristics for the Solution of the Resource Leveling Problem. Oper. Res. Forum 5(1): 6 (2024) - [j27]Andreas C. Nearchou, Sotiris L. Omirou:
Self-Adaptive Biased Differential Evolution for Scheduling Against Common Due Dates. Oper. Res. Forum 5(2): 53 (2024) - 2022
- [j26]Elias K. Xidias, Paraskevi Th. Zacharia, Andreas C. Nearchou:
Intelligent fleet management of autonomous vehicles for city logistics. Appl. Intell. 52(15): 18030-18048 (2022) - 2021
- [j25]Paraskevi Th. Zacharia, Andreas C. Nearchou:
The Fuzzy Assembly Line Worker Assignment and Balancing Problem. Cybern. Syst. 52(3): 221-243 (2021) - [j24]Nikolaos Charalambopoulos, Andreas C. Nearchou:
Ship Routing Using Genetic Algorithms. Oper. Res. Forum 2(3) (2021)
2010 – 2019
- 2018
- [j23]Andreas C. Nearchou:
Multicriteria scheduling optimization using an elitist multiobjective population heuristic: the h-NSDE algorithm. J. Heuristics 24(6): 817-851 (2018) - 2017
- [j22]Andreas C. Nearchou, Sotiris L. Omirou:
Assembly Line Balancing Using Differential Evolution Models. Cybern. Syst. 48(5): 436-458 (2017) - 2016
- [j21]Paraskevi Th. Zacharia, Andreas C. Nearchou:
A population-based algorithm for the bi-objective assembly line worker assignment and balancing problem. Eng. Appl. Artif. Intell. 49: 1-9 (2016) - [j20]Elias K. Xidias, Paraskevi Th. Zacharia, Andreas C. Nearchou:
Path Planning and scheduling for a fleet of autonomous vehicles. Robotica 34(10): 2257-2273 (2016) - 2014
- [j19]Andreas C. Nearchou, I. C. Giannikos, Lagodimos G. Lagodimos:
A Genetic Algorithm for the Economic manpower Shift Planning Problem. Cybern. Syst. 45(5): 439-464 (2014) - 2013
- [j18]Paraskevi Th. Zacharia, Andreas C. Nearchou:
A meta-heuristic algorithm for the fuzzy assembly line balancing type-E problem. Comput. Oper. Res. 40(12): 3033-3044 (2013) - [j17]Andreas C. Nearchou, Sotiris L. Omirou:
A Particle Swarm Optimization Algorithm for Scheduling Against Restrictive Common Due Dates. Int. J. Comput. Intell. Syst. 6(4): 684-699 (2013) - 2012
- [j16]Elias K. Xidias, Andreas C. Nearchou, Nikos A. Aspragathos:
Integrating Path Planning, Routing, and Scheduling for Logistics Operations in manufacturing Facilities. Cybern. Syst. 43(3): 143-162 (2012) - [j15]Andreas C. Nearchou:
A Hybrid Metaheuristic for the Single-Machine total Weighted tardiness Problem. Cybern. Syst. 43(8): 651-668 (2012) - [j14]Nikos Giannopoulos, Vassilis C. Moulianitis, Andreas C. Nearchou:
Multi-objective optimization with fuzzy measures and its application to flow-shop scheduling. Eng. Appl. Artif. Intell. 25(7): 1381-1394 (2012) - [j13]Paraskevi Th. Zacharia, Andreas C. Nearchou:
Multi-objective fuzzy assembly line balancing using genetic algorithms. J. Intell. Manuf. 23(3): 615-627 (2012)
2000 – 2009
- 2009
- [j12]Elias K. Xidias, Andreas C. Nearchou, Nikos A. Aspragathos:
Vehicle scheduling in 2D shop floor environments. Ind. Robot 36(2): 176-183 (2009) - 2008
- [j11]Andreas C. Nearchou:
A differential evolution approach for the common due date early/tardy job scheduling problem. Comput. Oper. Res. 35(4): 1329-1343 (2008) - 2006
- [j10]Andreas C. Nearchou, Sotiris L. Omirou:
Differential evolution for sequencing and scheduling optimization. J. Heuristics 12(6): 395-411 (2006) - 2004
- [j9]Andreas C. Nearchou:
A novel metaheuristic approach for the flow shop scheduling problem. Eng. Appl. Artif. Intell. 17(3): 289-300 (2004) - [j8]Andreas C. Nearchou:
Flow-shop sequencing using hybrid simulated annealing. J. Intell. Manuf. 15(3): 317-328 (2004) - 2002
- [j7]Phillip N. Azariadis, Andreas C. Nearchou, Nikos A. Aspragathos:
An evolutionary algorithm for generating planar developments of arbitrarily curved surfaces. Comput. Ind. 47(3): 357-368 (2002)
1990 – 1999
- 1999
- [j6]Andreas C. Nearchou:
Adaptive navigation of autonomous vehicles using evolutionary algorithms. Artif. Intell. Eng. 13(2): 159-173 (1999) - [j5]Andreas C. Nearchou:
A Genetic Navigation Algorithm for Autonomous Mobile Robots. Cybern. Syst. 30(7): 629-661 (1999) - [j4]Andreas C. Nearchou, Nikos A. Aspragathos, D. P. Sofotassios:
Reducing the Complexity of Robot's Scene for Faster Collision Detection. J. Intell. Robotic Syst. 26(1): 79-89 (1999) - 1998
- [j3]Andreas C. Nearchou, Nikos A. Aspragathos:
Collision-Free Cartesian Trajectory Generation Using Raster Scanning and Genetic Algorithms. J. Intell. Robotic Syst. 23(2-4): 351-377 (1998) - [j2]Andreas C. Nearchou:
Path planning of a mobile robot using genetic heuristics. Robotica 16(5): 575-588 (1998) - 1997
- [j1]Andreas C. Nearchou, Nikos A. Aspragathos:
A genetic path planning algorithm for redundant articulated robots. Robotica 15(2): 213-224 (1997)
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-06-25 21:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint