Andreas Nearchou | University of Patras (original) (raw)
Papers by Andreas Nearchou
Engineering Applications of Artificial Intelligence, Mar 1, 2016
Bookmarks Related papers MentionsView impact
The International Journal of Advanced Manufacturing Technology, May 11, 2023
Bookmarks Related papers MentionsView impact
Cybernetics and Systems, Oct 1, 1999
ABSTRACT The use of genetic algorithms GAs for solving the navigation problem of mobile robots is... more ABSTRACT The use of genetic algorithms GAs for solving the navigation problem of mobile robots is explored in this paper. Without using any logical model of the robot's world, the proposed approach evolves feasible robot paths by performing an adaptive search on populations of candidate robot actions. Unlike standard GAs, the proposed approach uses variable length chromosome structures and a set of special genetic operators. More importantly, the genetic navigation algorithm GNA can adapt its behavior for dealing with different types of static or changing simulated environments. The performance of the algorithm is examined through a plethora of computersimulated robot navigation experiments carried out on various types of planar grid environments. Furthermore, experimental comparisons between the GNA and two other heuristics are provided showing a substantially better performance for the GNA.
Bookmarks Related papers MentionsView impact
Cybernetics and Systems, Nov 9, 2020
Bookmarks Related papers MentionsView impact
The International Journal of Advanced Manufacturing Technology, Apr 11, 2023
Bookmarks Related papers MentionsView impact
Engineering Computations, 2021
PurposeThis paper considers the assembly line worker assignment and balancing problem of type-2 (... more PurposeThis paper considers the assembly line worker assignment and balancing problem of type-2 (ALWABP-2) with fuzzy task times. This problem is an extension of the (simple) SALBP-2 in which task times are worker-dependent and concurrently uncertain. Two criteria are simultaneously considered for minimization, namely, fuzzy cycle time and fuzzy smoothness index.Design/methodology/approachFirst, we show how fuzzy concepts can be used for managing uncertain task times. Then, we present a multiobjective genetic algorithm (MOGA) to solve the problem. MOGA is devoted to the search for Pareto-optimal solutions. For facilitating effective trade-off decision-making, two different MO approaches are implemented and tested within MOGA: a weighted-sum based approach and a Pareto-based approach.FindingsExperiments over a set of fuzzified test problems show the effect of these approaches on the performance of MOGA while verifying its efficiency in terms of both solution and time quality.Original...
Bookmarks Related papers MentionsView impact
IMA Journal of Management Mathematics, 2018
Consideration is given to a personnel planning problem occurring in multisite projects. In this p... more Consideration is given to a personnel planning problem occurring in multisite projects. In this problem a set of facilities (different sites) need to complete a given work load over a planning horizon of several days. The workforce is skilled and can work on any facility and it is employed to work on a basis of workday shifts. A fixed set-up cost associated with each facility is incurred each time a facility starts operating. The problem seeks to determine when each facility should be operated as well as the manpower needed at each shift to complete the workload targets of all the facilities within the planning horizon at a minimum cost. First, a formulation of the new problem as a mixed-integer linear programme is given. Then, since the problem is shown to be NP-hard, a novel genetic algorithm (GA) is presented for its solution which incorporates a problem-specific coding together with new special merging rules for creating offspring that exploits the structure of the problem. Usin...
Bookmarks Related papers MentionsView impact
The International Journal of Advanced Manufacturing Technology
Bookmarks Related papers MentionsView impact
Ocean Engineering, Apr 1, 2023
Bookmarks Related papers MentionsView impact
European Journal of Industrial Engineering, 2013
Bookmarks Related papers MentionsView impact
Engineering Optimization, Jan 3, 2014
Bookmarks Related papers MentionsView impact
International Journal of Production Research, Jan 20, 2010
Bookmarks Related papers MentionsView impact
Ima Journal of Management Mathematics, Sep 26, 2016
Bookmarks Related papers MentionsView impact
Robotics and Computer-integrated Manufacturing, Apr 1, 2007
ABSTRACT A machining strategy for milling a particular set of surfaces, obtained by the technique... more ABSTRACT A machining strategy for milling a particular set of surfaces, obtained by the technique of cross-sectional design is proposed. The surfaces considered are formed by sliding a Bezier curve (profile curve) along another Bezier curve (trajectory curve). The curves are located in perpendicular planes. The method employs a three-axis CNC milling machine equipped with suitable ball-end cutter and is based on the locus-tracing concept. The algorithm described, utilizes a real-time CNC interpolator providing the highest possible accuracy, of which the milling machine is capable. The surface quality is controlled by keeping the distance between scallops within a programmed value. Finally, the whole machining task can be programmed in a single block of the part program.
Bookmarks Related papers MentionsView impact
Engineering Applications of Artificial Intelligence, Apr 1, 2004
... Author Keywords: Flow shop scheduling; Meta-heuristics; Hybridization; Simulated annealing. R... more ... Author Keywords: Flow shop scheduling; Meta-heuristics; Hybridization; Simulated annealing. References. ... 236244. Yamada, T., Reeves, C., 1997. Permutation flowshop scheduling by genetic local search. ... An ant colony system for permutation flow-shop sequencing. ...
Bookmarks Related papers MentionsView impact
Computers & Operations Research, Apr 1, 2008
Bookmarks Related papers MentionsView impact
The International Journal of Advanced Manufacturing Technology, Nov 8, 2006
ABSTRACT Evolutionary algorithms such as genetic algorithms have been applied on a variety of com... more ABSTRACT Evolutionary algorithms such as genetic algorithms have been applied on a variety of complex combinatorial optimization problems (COPs) with high success. However, in relation to other classes of COPs, there is little reported experimental work concerning the application of these heuristics on large size assembly line balancing problems (ALBPs). Moreover, very few works in the literature report comparative results on public benchmark instances of ALBPs for which upper bounds on the optimal objective function value exist. This paper considers the simple ALBP of type 2 (SALBP-2), which consists of optimally partitioning the tasks’ operations in an assembly line among the workstations with objective the minimization of the cycle time of the line. SALBP-2 is known to be intractable, and therefore the right way to proceed is through the use of heuristic techniques. To that purpose, a novel approach based on the differential evolution method has been developed and tested over public available benchmarks ALBPs. These benchmarks include test instances for several precedence graphs (representing the assembly restrictions) with up to 297 tasks. Extended comparisons with other previously published evolutionary computation methods showed a superior performance for the proposed approach.
Bookmarks Related papers MentionsView impact
Research Square (Research Square), Mar 2, 2023
Bookmarks Related papers MentionsView impact
Ocean Engineering
Bookmarks Related papers MentionsView impact
IMA Journal of Management Mathematics, 2016
Bookmarks Related papers MentionsView impact
Engineering Applications of Artificial Intelligence, Mar 1, 2016
Bookmarks Related papers MentionsView impact
The International Journal of Advanced Manufacturing Technology, May 11, 2023
Bookmarks Related papers MentionsView impact
Cybernetics and Systems, Oct 1, 1999
ABSTRACT The use of genetic algorithms GAs for solving the navigation problem of mobile robots is... more ABSTRACT The use of genetic algorithms GAs for solving the navigation problem of mobile robots is explored in this paper. Without using any logical model of the robot's world, the proposed approach evolves feasible robot paths by performing an adaptive search on populations of candidate robot actions. Unlike standard GAs, the proposed approach uses variable length chromosome structures and a set of special genetic operators. More importantly, the genetic navigation algorithm GNA can adapt its behavior for dealing with different types of static or changing simulated environments. The performance of the algorithm is examined through a plethora of computersimulated robot navigation experiments carried out on various types of planar grid environments. Furthermore, experimental comparisons between the GNA and two other heuristics are provided showing a substantially better performance for the GNA.
Bookmarks Related papers MentionsView impact
Cybernetics and Systems, Nov 9, 2020
Bookmarks Related papers MentionsView impact
The International Journal of Advanced Manufacturing Technology, Apr 11, 2023
Bookmarks Related papers MentionsView impact
Engineering Computations, 2021
PurposeThis paper considers the assembly line worker assignment and balancing problem of type-2 (... more PurposeThis paper considers the assembly line worker assignment and balancing problem of type-2 (ALWABP-2) with fuzzy task times. This problem is an extension of the (simple) SALBP-2 in which task times are worker-dependent and concurrently uncertain. Two criteria are simultaneously considered for minimization, namely, fuzzy cycle time and fuzzy smoothness index.Design/methodology/approachFirst, we show how fuzzy concepts can be used for managing uncertain task times. Then, we present a multiobjective genetic algorithm (MOGA) to solve the problem. MOGA is devoted to the search for Pareto-optimal solutions. For facilitating effective trade-off decision-making, two different MO approaches are implemented and tested within MOGA: a weighted-sum based approach and a Pareto-based approach.FindingsExperiments over a set of fuzzified test problems show the effect of these approaches on the performance of MOGA while verifying its efficiency in terms of both solution and time quality.Original...
Bookmarks Related papers MentionsView impact
IMA Journal of Management Mathematics, 2018
Consideration is given to a personnel planning problem occurring in multisite projects. In this p... more Consideration is given to a personnel planning problem occurring in multisite projects. In this problem a set of facilities (different sites) need to complete a given work load over a planning horizon of several days. The workforce is skilled and can work on any facility and it is employed to work on a basis of workday shifts. A fixed set-up cost associated with each facility is incurred each time a facility starts operating. The problem seeks to determine when each facility should be operated as well as the manpower needed at each shift to complete the workload targets of all the facilities within the planning horizon at a minimum cost. First, a formulation of the new problem as a mixed-integer linear programme is given. Then, since the problem is shown to be NP-hard, a novel genetic algorithm (GA) is presented for its solution which incorporates a problem-specific coding together with new special merging rules for creating offspring that exploits the structure of the problem. Usin...
Bookmarks Related papers MentionsView impact
The International Journal of Advanced Manufacturing Technology
Bookmarks Related papers MentionsView impact
Ocean Engineering, Apr 1, 2023
Bookmarks Related papers MentionsView impact
European Journal of Industrial Engineering, 2013
Bookmarks Related papers MentionsView impact
Engineering Optimization, Jan 3, 2014
Bookmarks Related papers MentionsView impact
International Journal of Production Research, Jan 20, 2010
Bookmarks Related papers MentionsView impact
Ima Journal of Management Mathematics, Sep 26, 2016
Bookmarks Related papers MentionsView impact
Robotics and Computer-integrated Manufacturing, Apr 1, 2007
ABSTRACT A machining strategy for milling a particular set of surfaces, obtained by the technique... more ABSTRACT A machining strategy for milling a particular set of surfaces, obtained by the technique of cross-sectional design is proposed. The surfaces considered are formed by sliding a Bezier curve (profile curve) along another Bezier curve (trajectory curve). The curves are located in perpendicular planes. The method employs a three-axis CNC milling machine equipped with suitable ball-end cutter and is based on the locus-tracing concept. The algorithm described, utilizes a real-time CNC interpolator providing the highest possible accuracy, of which the milling machine is capable. The surface quality is controlled by keeping the distance between scallops within a programmed value. Finally, the whole machining task can be programmed in a single block of the part program.
Bookmarks Related papers MentionsView impact
Engineering Applications of Artificial Intelligence, Apr 1, 2004
... Author Keywords: Flow shop scheduling; Meta-heuristics; Hybridization; Simulated annealing. R... more ... Author Keywords: Flow shop scheduling; Meta-heuristics; Hybridization; Simulated annealing. References. ... 236244. Yamada, T., Reeves, C., 1997. Permutation flowshop scheduling by genetic local search. ... An ant colony system for permutation flow-shop sequencing. ...
Bookmarks Related papers MentionsView impact
Computers & Operations Research, Apr 1, 2008
Bookmarks Related papers MentionsView impact
The International Journal of Advanced Manufacturing Technology, Nov 8, 2006
ABSTRACT Evolutionary algorithms such as genetic algorithms have been applied on a variety of com... more ABSTRACT Evolutionary algorithms such as genetic algorithms have been applied on a variety of complex combinatorial optimization problems (COPs) with high success. However, in relation to other classes of COPs, there is little reported experimental work concerning the application of these heuristics on large size assembly line balancing problems (ALBPs). Moreover, very few works in the literature report comparative results on public benchmark instances of ALBPs for which upper bounds on the optimal objective function value exist. This paper considers the simple ALBP of type 2 (SALBP-2), which consists of optimally partitioning the tasks’ operations in an assembly line among the workstations with objective the minimization of the cycle time of the line. SALBP-2 is known to be intractable, and therefore the right way to proceed is through the use of heuristic techniques. To that purpose, a novel approach based on the differential evolution method has been developed and tested over public available benchmarks ALBPs. These benchmarks include test instances for several precedence graphs (representing the assembly restrictions) with up to 297 tasks. Extended comparisons with other previously published evolutionary computation methods showed a superior performance for the proposed approach.
Bookmarks Related papers MentionsView impact
Research Square (Research Square), Mar 2, 2023
Bookmarks Related papers MentionsView impact
Ocean Engineering
Bookmarks Related papers MentionsView impact
IMA Journal of Management Mathematics, 2016
Bookmarks Related papers MentionsView impact