On single-source capacitated facility location with cost and fairness objectives

C Filippi, G Guastaroba, MG Speranza - European Journal of Operational …, 2021 - Elsevier
We consider a location problem where a planner has to decide where to open facilities
which have to be reached by customers at their own cost. The planner has two objectives …

A heuristic framework for the bi-objective enhanced index tracking problem

C Filippi, G Guastaroba, MG Speranza - Omega, 2016 - Elsevier
The index tracking problem is the problem of determining a portfolio of assets whose
performance replicates, as closely as possible, that of a financial market index chosen as …

An imprecise multi-objective genetic algorithm for uncertain constrained multi-objective solid travelling salesman problem

S Maity, A Roy, M Maiti - Expert Systems With Applications, 2016 - Elsevier
In this paper, an imprecise Multi-Objective Genetic Algorithm (iMOGA) is developed to solve
Constrained Multi-Objective Solid Travelling Salesman Problems (CMOSTSPs) in crisp …

Threshold robustness in discrete facility location problems: a bi-objective approach

E Carrizosa, A Ushakov, I Vasilyev - Optimization Letters, 2015 - Springer
The two best studied facility location problems are the p p-median problem and the
uncapacitated facility location problem (Daskin, Network and discrete location: models …

An Improved Augmented -Constraint and Branch-and-Cut Method to Solve the TSP With Profits

SA Bouziaren, B Aghezzaf - IEEE Transactions on Intelligent …, 2018 - ieeexplore.ieee.org
In this paper, a novel approach is presented to solve the traveling salesman problem with
profits (TSPP). This problem is an extension of the famous traveling salesman problem …

A rough multi-objective genetic algorithm for uncertain constrained multi-objective solid travelling salesman problem

S Maity, A Roy, M Maiti - Granular Computing, 2019 - Springer
This paper addresses a rough multi-objective genetic algorithm (R-MOGA) to solve
constrained multi-objective solid travelling salesman problems (CMOSTSPs) in rough, fuzzy …

Maximizing the profit per unit time for the travelling salesman problem

M Kaspi, M Zofi, R Teller - Computers & Industrial Engineering, 2019 - Elsevier
This paper deals with a new extension of the Travelling Salesman Problem (TSP) in which
the objective is to maximize the profit per unit time. A travelling salesman has to complete a …

Bi-objective orienteering for personal activity scheduling

P Matl, PC Nolz, U Ritzinger, M Ruthmair… - Computers & Operations …, 2017 - Elsevier
We propose and solve a rich, bi-objective extension of the orienteering problem with time
windows (OPTW) to model a combined routing and scheduling problem. Our research is …

Discrete representation of the non-dominated set for multi-objective optimization problems using kernels

C Bazgan, F Jamain, D Vanderpooten - European Journal of Operational …, 2017 - Elsevier
In this paper, we are interested in producing discrete and tractable representations of the set
of non-dominated points for multi-objective optimization problems, both in the continuous …

Evaluation of a multi-objective EA on benchmark instances for dynamic routing of a vehicle

S Meisel, C Grimme, J Bossek, M Wölck… - Proceedings of the …, 2015 - dl.acm.org
We evaluate the performance of a multi-objective evolutionary algorithm on a class of
dynamic routing problems with a single vehicle. In particular we focus on relating algorithmic …