Paulo Morelato França

According to our database1, Paulo Morelato França authored at least 32 papers between 1994 and 2015.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems.
J. Heuristics, 2015

2014
Global optimization using a genetic algorithm with hierarchically structured population.
J. Comput. Appl. Math., 2014

A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem.
Comput. Oper. Res., 2014

A redistricting problem applied to meter reading in power distribution networks.
Comput. Oper. Res., 2014

2013
GRASP with evolutionary path-relinking for the capacitated arc routing problem.
Comput. Oper. Res., 2013

A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging.
Comput. Oper. Res., 2013

An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks.
Comput. Oper. Res., 2013

Genetic algorithm, MIP and improvement heuristic applied to the MLCLP with backlogging.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
A Memetic Framework for Solving the Lot Sizing and Scheduling Problem in Soft Drink Plants.
Proceedings of the Variants of Evolutionary Algorithms for Real-World Applications, 2012

2011
A linear optimization approach to the combined production planning model.
J. Frankl. Inst., 2011

The open capacitated arc routing problem.
Comput. Oper. Res., 2011

Tabu search to solve the synchronized and integrated two-level lot sizing and scheduling problem.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

A hybrid heuristic approach to solve the multi level capacitated lot sizing problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2011

2010
The open Capacitated Arc Routing Problem: Complexity and algorithms.
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010

2008
Heuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: a comparison study.
Proceedings of the Metaheuristics for Scheduling in Industrial and Manufacturing Applications, 2008

Multiobjective service restoration in electric distribution networks using a local search based heuristic.
Eur. J. Oper. Res., 2008

Evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

Meta-heuristic approaches for a soft drink industry problem.
Proceedings of 13th IEEE International Conference on Emerging Technologies and Factory Automation, 2008

2007
Evolutionary Approaches to Solve an Integrated Lot Scheduling Problem in the Soft Drink Industry.
Proceedings of the 7th International Conference on Hybrid Intelligent Systems, 2007

2006
The combined cutting stock and lot-sizing problem in industrial processes.
Eur. J. Oper. Res., 2006

A parallel memetic algorithm applied to the total tardiness machine scheduling problem.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005
Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups.
Comput. Ind. Eng., 2005

Metaheuristic Approaches for the Multilevel Resource-Constrained lot-sizing Problem with setup and lead times.
Asia Pac. J. Oper. Res., 2005

Gene Ordering in Microarray Data Using Parallel Memetic Algorithms.
Proceedings of the 34th International Conference on Parallel Processing Workshops (ICPP 2005 Workshops), 2005

2004
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem.
J. Heuristics, 2004

2003
Applying Memetic Algorithms to the Analysis of Microarray Data.
Proceedings of the Applications of Evolutionary Computing, 2003

2002
Population Studies for the Gate Matrix Layout Problem.
Proceedings of the Advances in Artificial Intelligence, 2002

Makespan minimization on parallel processors: an immune-based approach.
Proceedings of the 2002 Congress on Evolutionary Computation, 2002

2001
A memetic algorithm for the total tardiness single machine scheduling problem.
Eur. J. Oper. Res., 2001

1997
A heuristic method for lot-sizing in multi-stage systems.
Comput. Oper. Res., 1997

1995
The <i>m</i>-Traveling Salesman Problem with Minmax Objective.
Transp. Sci., 1995

1994
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective.
Comput. Oper. Res., 1994


  Loading...