Luiz Satoru Ochi

Orcid: 0000-0002-5007-4513

Affiliations:
  • Fluminense Federal University, Brazil


According to our database1, Luiz Satoru Ochi authored at least 111 papers between 1997 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A two-phase multi-objective metaheuristic for a green UAV grid routing problem.
Optim. Lett., December, 2023

Using adaptive memory in GRASP to find minimum conflict-free spanning trees.
Soft Comput., 2023

2022
On the Performance of GRASP-Based Feature Selection for CPS Intrusion Detection.
IEEE Trans. Netw. Serv. Manag., 2022

A Systematic Literature Review on Distributed Machine Learning in Edge Computing.
Sensors, 2022

UAVs routes optimization on smart cities and regions.
RAIRO Oper. Res., 2022

Finding the Maximum Multi Improvement on neighborhood exploration.
Optim. Lett., 2022

Wireless multipath video transmission: when IoT video applications meet networking - a survey.
Multim. Syst., 2022

An extended assessment of metaheuristics-based feature selection for intrusion detection in CPS perception layer.
Ann. des Télécommunications, 2022

On Conflict-Free Spanning Tree: Algorithms and Complexity.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021
An ils-based heuristic applied to the car renter salesman problem.
RAIRO Oper. Res., 2021

Microaggregation heuristic applied to statistical disclosure control.
Inf. Sci., 2021

A new approach for the traveling salesperson problem with hotel selection.
EURO J. Transp. Logist., 2021

The biclique partitioning polytope.
Discret. Appl. Math., 2021

A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection.
Comput. Oper. Res., 2021

Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes.
Proceedings of the Combinatorial Optimization and Applications, 2021

Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case.
Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020
Mobility, Citizens, Innovation and Technology in Digital and Smart Cities.
Future Internet, 2020

Efficient approaches for the Flooding Problem on graphs.
Ann. Oper. Res., 2020

GRASP-based Feature Selection for Intrusion Detection in CPS Perception Layer.
Proceedings of the 4th Conference on Cloud and Internet of Things, 2020

2019
A hybrid metaheuristic for the minimum labeling spanning tree problem.
Eur. J. Oper. Res., 2019

A polyhedral approach to the generalized minimum labeling spanning tree problem.
EURO J. Comput. Optim., 2019

Solving the minimum labeling global cut problem by mathematical programming.
CoRR, 2019

A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet.
Ann. Oper. Res., 2019

Traveling Salesperson Problem with Hotel Selection: A systematic review of the literature.
Proceedings of the XV Brazilian Symposium on Information Systems, 2019

LibBFT: A High-Performace Timed Automata Library Collection for Byzantine Fault Tolerance.
Proceedings of the 31st International Symposium on Computer Architecture and High Performance Computing, 2019

Multipath Selection Mechanism for Wireless Video-Surveillance Systems.
Proceedings of the 9th Latin American Network Operations and Management Symposium, 2019

A Multi-objective Metaheuristic for a Green UAV Grid Routing Problem.
Proceedings of the Variable Neighborhood Search - 7th International Conference, 2019

An Efficient Heuristic to the Traveling Salesperson Problem with Hotel Selection.
Proceedings of the Hybrid Metaheuristics - 11th International Workshop, 2019

Local Search Methods for the MRCPSP-Energy.
Proceedings of the Hybrid Metaheuristics - 11th International Workshop, 2019

Locality Sensitive Algotrithms for Data Mule Routing Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

When CI and Decentralized Systems Effectively Meet Smart Cities and Grids.
Proceedings of the Smart and Digital Cities, 2019

Introduction.
Proceedings of the Smart and Digital Cities, 2019

2018
A matheuristic for the cell formation problem.
Optim. Lett., 2018

Exploring parallel multi-GPU local search strategies in a metaheuristic framework.
J. Parallel Distributed Comput., 2018

Fractal triangular search: a metaheuristic for image content search.
IET Image Process., 2018

A study on exponential-size neighborhoods for the bin packing problem with conflicts.
J. Heuristics, 2018

Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads.
Eur. J. Oper. Res., 2018

Efficient heuristics for the minimum labeling global cut problem.
Electron. Notes Discret. Math., 2018

General Variable Neighborhood Search for the Data Mule Scheduling Problem.
Electron. Notes Discret. Math., 2018

Green Vehicle Routing and Scheduling Problem with Split Delivery.
Electron. Notes Discret. Math., 2018

A Neighborhood Exploration Approach with Multi-start for Extend Generalized Block-modeling.
Electron. Notes Discret. Math., 2018

Iterated Local Search for RGB Image Steganography.
Proceedings of the 25th International Conference on Systems, Signals and Image Processing, 2018

Logistics SLA optimization service for transportation in smart cities.
Proceedings of the 2018 International Joint Conference on Neural Networks, 2018

Less Is More: The Neighborhood Guided Evolution Strategies Convergence on Some Classic Neighborhood Operators.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

Implementation of a RVND, VNS, ILS Heuristic for the Traveling Car Renter Problem.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

2017
A performance study on multi improvement neighborhood search strategy.
Electron. Notes Discret. Math., 2017

A multi-objective green UAV routing problem.
Comput. Oper. Res., 2017

New heuristics for the Bicluster Editing Problem.
Ann. Oper. Res., 2017

2016
Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits.
Transp. Sci., 2016

Efficient algorithms for cluster editing.
J. Comb. Optim., 2016

A parallel hybrid metaheuristic for bicluster editing.
Int. Trans. Oper. Res., 2016

An efficient hybrid algorithm for the Traveling Car Renter Problem.
Expert Syst. Appl., 2016

On solving manufacturing cell formation via Bicluster Editing.
Eur. J. Oper. Res., 2016

A Hybrid Heuristic based on Iterated Local Search for Multivehicle Inventory Routing Problem.
Electron. Notes Discret. Math., 2016

A Benchmark on Multi Improvement Neighborhood Search Strategies in CPU/GPU Systems.
Proceedings of the 2016 International Symposium on Computer Architecture and High Performance Computing Workshops, 2016

2015
A new hybrid heuristic for replica placement and request distribution in content distribution networks.
Optim. Lett., 2015

Heuristics for the Periodic Mobile Piston Pump Unit Routing Problem.
Int. J. Nat. Comput. Res., 2015

A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem.
Expert Syst. Appl., 2015

An iterated local search heuristic for the split delivery vehicle routing problem.
Comput. Oper. Res., 2015

A variable neighborhood search heuristic for the traveling salesman problem with hotel selection.
Proceedings of the 2015 Latin American Computing Conference, 2015

2013
Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery.
Optim. Lett., 2013

A dynamic resource constrained project scheduling problem.
Int. J. Data Min. Model. Manag., 2013

A discrete search algorithm for finding the structure of protein backbones and side chains.
Int. J. Bioinform. Res. Appl., 2013

An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem.
J. Heuristics, 2013

A hybrid algorithm for a class of vehicle routing problems.
Comput. Oper. Res., 2013

GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem.
Comput. Oper. Res., 2013

2012
Exact and heuristic approaches for the set cover with pairs problem.
Optim. Lett., 2012

A GRASP-based approach to the generalized minimum spanning tree problem.
Expert Syst. Appl., 2012

A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem.
Eur. J. Oper. Res., 2012

A simple and effective metaheuristic for the Minimum Latency Problem.
Eur. J. Oper. Res., 2012

Hybrid Metaheuristic for Bicluster Editing Problem.
Electron. Notes Discret. Math., 2012

A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups.
Electron. Notes Discret. Math., 2012

The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics.
Comput. Oper. Res., 2012

Strong bounds with cut and column generation for class-teacher timetabling.
Ann. Oper. Res., 2012

GARP: A New Genetic Algorithm for the Unrelated Parallel Machine Scheduling Problem with Setup Times.
Proceedings of the 31st International Conference of the Chilean Computer Science Society, 2012

Metaheuristic GRASP with Path-Relinking to the Solution of the Graph Partitioning Problem with Capacity and Connexity Constraints.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2012, 2012

The Single Vehicle Routing Problem with Deliveries and Selective Pickups in a CPU-GPU Heterogeneous Environment.
Proceedings of the 14th IEEE International Conference on High Performance Computing and Communication & 9th IEEE International Conference on Embedded Software and Systems, 2012

2011
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery.
Oper. Res. Lett., 2011

Agrupamento de Sistemas Orientados a Objetos com Metaheurísticas Evolutivas.
Proceedings of the 7th Brazilian Symposium on Information Systems, 2011

Real Time Pathfinding with Genetic Algorithm.
Proceedings of the 2011 Brazilian Symposium on Games and Digital Entertainment, 2011

2010
Effective heuristics for the Set Covering with Pairs Problem.
Int. Trans. Oper. Res., 2010

An iterative local search approach applied to the optimal stratification problem.
Int. Trans. Oper. Res., 2010

A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem.
Expert Syst. Appl., 2010

Solving Replica Placement and Request Distribution in Content Distribution Networks.
Electron. Notes Discret. Math., 2010

A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery.
Comput. Oper. Res., 2010

Near-optimal solutions for the generalized max-controlled set problem.
Comput. Oper. Res., 2010

New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

2009
New sequential and parallel algorithm for Dynamic Resource Constrained Project Scheduling Problem.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008
The Generalized Max-Controlled Set Problem.
Electron. Notes Discret. Math., 2008

Image registration using genetic algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

2007
New heuristics for the maximum diversity problem.
J. Heuristics, 2007

A hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

2006
Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem.
Neurocomputing, 2006

2005
A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem.
ACM J. Exp. Algorithmics, 2005

Hybrid Adaptive Memory Programming Using GRASP and Path Relinking for the Scheduling Workover Rigs for Onshore Oil Production.
Proceedings of the 5th International Conference on Hybrid Intelligent Systems (HIS 2005), 2005

GRASP with Path-Relinking for the SONET Ring Assignment Problem.
Proceedings of the 5th International Conference on Hybrid Intelligent Systems (HIS 2005), 2005

A GRASP with Adaptive Memory for a Period Vehicle Routing Problem.
Proceedings of the 2005 International Conference on Computational Intelligence for Modelling Control and Automation (CIMCA 2005), 2005

Hybrid evolutionary static scheduling for heterogeneous systems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005

2004
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

An Efficient Tabu Search Heuristic for the School Timetabling Problem.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003
Efficient evolutionary algorithms for the clustering problem in directed graphs.
Proceedings of the IEEE Congress on Evolutionary Computation, 2003

2002
Distributed Parallel Metaheuristics based on GRASP and VNS for Solving the Traveling Purchaser Problem.
Proceedings of the 9th International Conference on Parallel and Distributed Systems, 2002

2001
An asynchronous parallel metaheuristic for the period vehicle routing problem.
Future Gener. Comput. Syst., 2001

Reduction Rules for the Covering Tour Problem.
Electron. Notes Discret. Math., 2001

2000
A New Hybrid Evoltionary Algorithm for the Vehicle Routing and Scheduling Problems.
Proceedings of the ISCA 9th International Conference on Intelligent Systems, 2000

1999
A Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem.
Proceedings of the Parallel and Distributed Processing, 1999

1998
A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet.
Future Gener. Comput. Syst., 1998

A New Self-Organizing Strategy Based on Elastic Networks for Solving the Euclidean Traveling Salesman Problem.
Proceedings of the Tasks and Methods in Applied Artificial Intelligence, 1998

An Evolutionary Hybrid Metaheuristic for Solving the Vehicle Routing Problem with Heterogeneous Fleet.
Proceedings of the Genetic Programming, First European Workshop, 1998

1997
Design and implementation of a parallel genetic algorithm for the travelling purchaser problem.
Proceedings of the 1997 ACM symposium on Applied Computing, 1997


  Loading...