Search

Your search keyword '"de Souza, Sérgio Ricardo"' showing total 41 results
Start Over Author "de Souza, Sérgio Ricardo"
41 results on '"de Souza, Sérgio Ricardo"'

12. An Adaptive VNS and Skewed GVNS Approaches for School Timetabling Problems

Author

Teixeira, Ulisses Rezende, Souza, Marcone Jamilson Freitas, de Souza, Sérgio Ricardo, Coelho, Vitor Nazário, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Sifaleras, Angelo, editor, Salhi, Said, editor, and Brimberg, Jack, editor

Published
2019
Full Text
View/download PDF

13. A Variable Neighborhood Search Approach for Solving the Multidimensional Multi-Way Number Partitioning Problem

Author

Faria, Alexandre Frias, de Souza, Sérgio Ricardo, Souza, Marcone Jamilson Freitas, Silva, Carlos Alexandre, Nazário Coelho, Vitor, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Sifaleras, Angelo, editor, Salhi, Said, editor, and Brimberg, Jack, editor

Published
2019
Full Text
View/download PDF

14. A VNS-Based Algorithm with Adaptive Local Search for Solving the Multi-Depot Vehicle Routing Problem

Author

Nunes Bezerra, Sinaide, Souza, Marcone Jamilson Freitas, de Souza, Sérgio Ricardo, Nazário Coelho, Vitor, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Sifaleras, Angelo, editor, Salhi, Said, editor, and Brimberg, Jack, editor

Published
2019
Full Text
View/download PDF

23. An Adaptive Genetic Algorithm to the Single Machine Scheduling Problem with Earliness and Tardiness Penalties

Author

Ribeiro, Fábio Fernandes, Souza, Marcone Jamilson Freitas, de Souza, Sérgio Ricardo, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, da Rocha Costa, Antônio Carlos, editor, Vicari, Rosa Maria, editor, and Tonidandel, Flavio, editor

Published
2010
Full Text
View/download PDF

27. The hypervolume indicator as a performance measure in dynamic optimization

Author

Oliveira, Sabrina, Wanner, Elizabeth Fialho, de Souza, Sérgio Ricardo, Bezerra, Leonardo, and Stützle, Thomas

Subjects
Multi-objective optimization, Performance assessment, Dynamic optimization, Informatique générale, Informatique mathématique
Abstract

In many real world problems the quality of solutions needs to be evaluated at least according to a bi-objective non-dominated front, where the goal is to optimize solution quality using as little computational resources as possible. This is even more important in the context of dynamic optimization, where quickly addressing problem changes is critical. In this work, we relate approaches for the performance assessment of dynamic optimization algorithms to the existing literature on bi-objective optimization. In particular, we introduce and investigate the use of the hypervolume indicator to compare the performance of algorithms applied to dynamic optimization problems. As a case study, we compare variants of a state-of-the-art dynamic ant colony algorithm on the traveling salesman problem with dynamic demands (DDTSP). Results demonstrate that our proposed approach accurately measures the desirable characteristics one expects from a dynamic optimizer and provides more insights than existing alternatives., SCOPUS: cp.k, info:eu-repo/semantics/published

Published
2019

32. An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem.

Author

de Siqueira, Eduardo Camargo, Souza, Marcone Jamilson Freitas, and de Souza, Sérgio Ricardo

Subjects
FLOW shop scheduling, FLOW shops, GENETIC algorithms, ALGORITHMS
Abstract

This paper addresses the multiobjective hybrid flow shop (MOHFS) scheduling problem. In the MOHFS problem considered here, we have a set of jobs that must be performed in a set of stages. At each stage, we have a set of unrelated parallel machines. Some jobs may skip stages. The evaluation criteria are the minimizations of makespan, the weighted sum of the tardiness, and the weighted sum of the earliness. For solving it, an algorithm based on the multiobjective general variable neighborhood search (MO‐GVNS) metaheuristic, named adapted MO‐GVNS, is proposed. This work also presents and compares the results obtained by the adapted MO‐GVNS with those of four other algorithms: multiobjective reduced variable neighborhood search, nondominated sorting genetic algorithm II (NSGA‐II), and NSGA‐III, and another MO‐GVNS from the literature. The results were evaluated based on the Hypervolume, Epsilon, and Spacing metrics, and statistically validated by the Levene test and confidence interval charts. The results showed the efficiency of the proposed algorithm for solving the MOHFS problem. [ABSTRACT FROM AUTHOR]

Published
2020
Full Text
View/download PDF

33. On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics.

Author

Quilliot, Alain, Figueiredo, Rosa, Morais dos Reis, Daniel, Goulart, Natã, Noronha, Thiago F., and de Souza, Sérgio Ricardo

Subjects
WAVELENGTH division multiplexing, OPTICAL devices, GREEDY algorithms, HEURISTIC, WAVELENGTH assignment, LINEAR programming
Abstract

The Fiber Installation Problem (FIP) in Wavelength Division Multiplexing (WDM) optical networks consists in routing a set of lightpaths (all-optical connections) such that the cost of the optical devices necessary to operate the network is minimized. Each of these devices is worth hundreds of thousands of dollars. In consequence, any improvement in the lightpath routing may save millions of dollars for the network operator. All the works in the literature for solving this problem are based on greedy heuristics and genetic algorithms. No information is known on how good are the solutions provided by these heuristics compared to the optimal solution. Besides, no proof that the problem is NP-Hard can be found. In this paper, we prove that FIP is NP-Hard and also present an Integer Linear Programming (ILP) formulation for the problem. In addition, we propose an implementation of the Iterated Local Search (ILS) metaheuristic to solve large instances of the problem. Computational experiments carried out on 21 realistic instances showed that the CPLEX solver running with our ILP formulation was able to solve 11 out of the 21 instances to optimality in less than two minutes. These results also showed that the ILS heuristic has an average optimality gap of 1% on the instances for which the optimal solution is known. For the other instances, the results showed that the proposed heuristic outperforms the best heuristic in the literature by 7%. [ABSTRACT FROM AUTHOR]

Published
2019
Full Text
View/download PDF

36. Variable Neighborhood Descent Branching applied to the Multi-Way Number Partitioning Problem.

Author

Silva, Carlos Alexandre, Faria, Alexandre Frias, de Souza, Sérgio Ricardo, and Martins de Sá, Elisangela

Subjects
MATHEMATICAL models, TIME management, NEIGHBORHOODS, COMBINATORIAL optimization
Abstract

This paper presents an application of the Variable Neighborhood Descent Branching method to solve the Multi-Way Number Partitioning Problem. This problem consists of distributing the elements of a given sequence into k disjoint subsets such that the sums of each subset elements fit in the shortest interval. It shows a new method to decompose the MWNPP in n− 1 subproblems using local branching constraints. This decomposing justifies the neighborhood structure used in the proposed algorithm. The study of parameter settings defines the operation of the proposed algorithm. The results shows that there is no statistically significant difference of objective value between proposed algorithm and mathematical model solved by CPLEX, but the time used by both methods are significantly different. [ABSTRACT FROM AUTHOR]

Published
2019
Full Text
View/download PDF

40. Entre el Consejo de Solón y el de Clístenes:¿Heliea en época de Pisístrato?

Author

Pinto, Aguinaldo Alves and de Souza, Sérgio Ricardo

Subjects
lcsh:Ancient history, citizenship, Historia antigua, peisistratids, Peisistratids, lcsh:Archaeology, Citizenship, lcsh:CC1-960, heliaia continuity, lcsh:D51-90, Heliaia continuity
Abstract

Neste artigo ´e tratado o Problema de Roteamento de Veículos com Janela de Tempo. O objetivo é atender um conjunto de clientes geograficamente distribuídos com um número de veículos limitado. É considerado um único depósito, onde os veículos partem e retornam após visitar todos os clientes de sua respectiva rota. Há uma janela de tempo associada ao depósito, que indica seu peróodo de funcionamento, além de uma janela de tempo pertencente a cada cliente, que indica o intervalo de tempo para iniciar o atendimento. Todos os veículos possuem a mesma capacidade de carga e há uma demanda correspondente a cada cliente. O algoritmo proposto combina a meta-heurística Greedy Randomized Adaptive Search Procedure (GRASP) e a Push-Forward Insertion Heuristic (PFIH) para gerar a solução inicial e é aplicado uma busca local para refinar a solução gerada através da meta-heurística Variable Neighborhood Descent (VND). Posteriormente, esta solução é refinada pela meta-heurística Iterated Greedy Search (IGS) de forma iterativa. A análise de resultados consiste em comparar as 56 instâncias propostas por Solomon (1987) com os melhores resultados da literatura.Keywords: Problema de Roteamento de Veículos com Janela de Tempo, GRASP, IGS, VND

Published
2003

41. An Adaptive Genetic Algorithm to the Single Machine Scheduling Problem with Earliness and Tardiness Penalties.

Author

Ribeiro, Fábio Fernandes, Souza, Marcone Jamilson Freitas, and de Souza, Sérgio Ricardo

Abstract

This paper deals with the Single Machine Scheduling Problem with Earliness and Tardiness Penalties, considering distinct due windows and sequence-dependent setup time. Due to its complexity, an adaptive genetic algorithm is proposed for solving it. Many search operators are used to explore the solution space where the choice probability for each operator depends on the success in a previous search. The initial population is generated by the combination between construct methods based on greedy, random and GRASP techniques. For each job sequence generated, a polynomial time algorithm is used for determining the processing initial optimal date to each job. During the evaluation process, the best individuals produced are added to a special group, called elite group. The individuals of this group are submitted to refinement, aiming to improve their quality. Three variations of this algorithm are submitted to computational test. The results show the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Published
2011
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results