Andrzej Jaszkiewicz

Orcid: 0000-0002-8337-888X

Affiliations:
  • Poznan University of Technology, Poland


According to our database1, Andrzej Jaszkiewicz authored at least 39 papers between 1998 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On-line Quick Hypervolume Algorithm.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

2022
What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization.
Comput. Oper. Res., 2022

Greedy Decremental Quick Hypervolume Subset Selection Algorithms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Evolutionary Algorithm for Vehicle Routing with Diversity Oscillation Mechanism.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Deep Infeasibility Exploration Method for Vehicle Routing Problems.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2022

2021
What if we Increase the Number of Objectives? Theoretical and Empirical Implications for Many-objective Optimization.
CoRR, 2021

Quick extreme hypervolume contribution algorithm.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Effective recombination operators for the family of vehicle routing problems.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020
Approximate Hypervolume Calculation with Guaranteed or Confidence Bounds.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

2019
Experimental analysis of design elements of scalarizing function-based multiobjective evolutionary algorithms.
Soft Comput., 2019

Minimum spanning tree-based clustering of large pareto archives.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

2018
ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem.
IEEE Trans. Evol. Comput., 2018

Many-Objective Pareto Local Search.
Eur. J. Oper. Res., 2018

Improved quick hypervolume algorithm.
Comput. Oper. Res., 2018

2017
Experimental Analysis of Design Elements of Scalarizing Functions-based Multiobjective Evolutionary Algorithms.
CoRR, 2017

Proper balance between search towards and along Pareto front: biobjective TSP case study.
Ann. Oper. Res., 2017

2016
ND-Tree: a Fast Online Algorithm for Updating a Pareto Archive and its Application in Many-objective Pareto Local Search.
CoRR, 2016

2013
Matrix Factorization for Travel Time Estimation in Large Traffic Networks.
Proceedings of the Artificial Intelligence and Soft Computing, 2013

2012
Multiobjective Memetic Algorithms.
Proceedings of the Handbook of Memetic Algorithms, 2012

Adapting Travel Time Estimates to Current Traffic Conditions.
Proceedings of the New Trends in Databases and Information Systems, 2012

Community Traffic: A Technology for the Next Generation Car Navigation.
Proceedings of the New Trends in Databases and Information Systems, 2012

2010
Speed-up techniques for solving large-scale biobjective TSP.
Comput. Oper. Res., 2010

2009
Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem.
Eur. J. Oper. Res., 2009

Advanced OR and AI methods in transportation.
Eur. J. Oper. Res., 2009

2008
Distance Preserving Recombination Operator for Earth Observation Satellites Operations Scheduling.
J. Math. Model. Algorithms, 2008

Interactive Multiobjective Evolutionary Algorithms.
Proceedings of the Multiobjective Optimization, 2008

2006
Metaheuristics in multiple objective optimization.
Eur. J. Oper. Res., 2006

2004
On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study.
Eur. J. Oper. Res., 2004

A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm.
Ann. Oper. Res., 2004

Evaluation of Multiple Objective Metaheuristics.
Proceedings of the Metaheuristics for Multiobjective Optimisation, 2004

2003
Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem.
IEEE Trans. Evol. Comput., 2003

Genetic local search with distance preserving recombination operator for a vehicle routing problem.
Eur. J. Oper. Res., 2003

2002
On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment.
IEEE Trans. Evol. Comput., 2002

Genetic local search for multi-objective combinatorial optimization.
Eur. J. Oper. Res., 2002

2001
Performance of Multiple Objective Evolutionary Algorithms on a Distribution System Design Problem - Computational Experiment.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2001

2000
Pareto Simulated Annealing for Fuzzy Multi-Objective Combinatorial Optimization.
J. Heuristics, 2000

1999
The 'Light Beam Search' approach - an overview of methodology and applications.
Eur. J. Oper. Res., 1999

Solving multiple criteria choice problems by interactive trichotomy segmentation.
Eur. J. Oper. Res., 1999

1998
Interactive analysis of multiple-criteria project scheduling problems.
Eur. J. Oper. Res., 1998


  Loading...