C.E. Andrade, S. Ahmed, G.L. Nemhauser, Y. Shao.
A hybrid primal heuristic for finding
feasible solutions to mixed integer programs.
European Journal of Operational Research, volume 263,
issue 1, pages 62-71, 2017.
[Official version]
M.C. Lopes, C.E. Andrade, T.A. Queiroz,
M.G.C. Resende, F.K. Miyazawa.
Heuristics for a Hub Location-Routing
Problem.
Networks, volume 68, number 1, pages 54-90, 2016.
[Official
version]
C.E. Andrade, F.K. Miyazawa, M.C.G Resende,
R.F. Toso.
Biased Random-Key Genetic Algorithms for the
Winner Determination Problem in Combinatorial Auctions.
Evolutionary Computation, volume 23, number 2, pages 279-307, 2015.
[Preprint][Official version]
Full papers in conferences
C.E. Andrade, S.D. Byers, V. Gopalakrishnan,
E. Halepovic, M. Majmundar, D.J. Poole, L.K. Tran, C.T. Volinsky.
Managing massive firmware-over-the-air
updates for connected cars in cellular networks.
Proceedings of the 2nd ACM International Workshop on Connected and
Automated Vehicle Mobility (CarSys 2017) (a workshop of MobiCom 2017).
Snowbird, USA, 2017.
[Official version]
C.E. Andrade, S.D. Byers, V. Gopalakrishnan,
E. Halepovic, D.J. Poole, L.K. Tran, C.T. Volinsky.
Connected cars in a cellular network: A
measurement study.
Proceedings of the 17th ACM Internet Measurement Conference
(IMC 2017), London, 2017.
[Official version]
C.E. Andrade, M.C.G. Resende, W. Zhang, R.C.
Sinha, K.C. Reichmann, R.D. Doverspike, F.K. Miyazawa.
A Biased Random-key
Genetic Algorithm for Wireless Backhaul Network Design. 11th
Metaheuristics International Conference (MIC 2015), Agadir, Morocco,
2015. (category: high-quality manuscripts that have recently, within the
last six months, been submitted or accepted for journal publication).
C.E. Andrade, M.C.G Resende. H.J. Karloff,
F.K. Miyazawa.
Evolutionary Algorithms for Overlapping
Correlation Clustering.
Proceedings of the Sixteen International Conference on
Genetic and Evolutionary Computation (GECCO 2014). Pages 405-412, New
York, NY, USA, 2014.
[Official version]
M.L. Lucena, C.E. Andrade, M.C.G. Resende,
F.K. Miyazawa.
Some extensions of biased random-key genetic
algorithms.
Proceedings of XLVI Brazilian Symposium of Operational Research
(SBPO' 14), Salvador, Bahia, Brazil. Pages 2469-2480, 2014.
[Official version]
C.E. Andrade, F.K. Miyazawa, M.C.G Resende.
Evolutionary Algorithm for the
k-Interconnected Multi-Depot Multi-Traveling Salesmen
Problem.
Proceedings of the Fifteen
International Conference on Genetic and Evolutionary Computation (GECCO' 13).
Pages 463-470, New York, NY, USA, 2013.
[Official version]
C.E. de Andrade, F.K. Miyazawa, and E.C.
Xavier. Um algoritmo exato para o Problema de Empacotamento Bidimensional em
Faixas. In Proceedings of XXXVIII Brazilian Symposium of Operational
Research, pages 1701-1712, 2006.
[Official Version in Portuguese]
Book chapters
M.C. Lopes, T.A. de Queiroz, C.E. de
Andrade, F.K. Miyazawa.
Solving a variant of the (hub)
location-routing problem.
Z. Zhang, Z. M. Shen, J. Zhang e R. Zhang
(editors), LISS 2014. Springer Berlin Heidelberg, pages 395-400, 2015.
[Official version]
Abstracts and extended abstracts
C.E. Andrade, S.D. Byers, V.
Gopalakrishnan, E. Halepovic, D.J. Poole, L.K. Tran, C.T. Volinsky.
Scheduling software updates for connected
cars with limited availability.
INFORMS Annual Meeting, Houston, TX, USA,
October, 2017.
C.E. Andrade.
Large scale scheduling problems
on Internet of Things.
INFORMS Annual Meeting, Nashville, TN, USA,
November, 2016.
C.E. Andrade.
Heuristics for the Wireless
Backhaul Network Design Problem.
INFORMS Optimization Society Conference, Pricenton, NJ, USA,
March, 2015.
C.E. Andrade, G.L. Nemhauser, S. Ahmed,
Y. Shao.
A Learning Framework for Feasibility Pump.
INFORMS Annual Meeting, Philadelphia, PA, USA, November, 2015.
M.C. Lopes, T.A. de Queiroz, C.E. Andrade,
F.K. Miyazawa.
Solving a variant of the (hub)
location-routing problem.
Proceedings of International Conference on Logistics, Informatics, and
Services Sciences (LISS' 2014). Berkeley, CA, USA, July, 2014.
M.C.G. Resende, C.E. Andrade, F.K. Miyazawa,
R.D. Doverspike, K. Reichmann, R.K. Sinha, W. Zhang.
A biased random-key
genetic algorithm for a prize-collecting directed Steiner forest network
design problem.
12th INFORMS Telecommunications Conference, Lisbon,
Portugal, 2014.
C.E. Andrade, M.C.G. Resende, H.J. Karloff,
F.K. Miyazawa.
Solving the Overlapping Correlation
Clustering using an Evolutionary Approach.
INFORMS Annual Meeting, Minneapolis, MN,
USA, October, 2013.
C.E. Andrade, F.K. Miyazawa, M.C.G. Resende,
R.F. Toso.
Solving the Winner Determination Problem by
Biased Random-Key Genetic Algorithms.
XVI Latin American Operations Research Summer
School, Bento Gonçalves, RS, Brazil, February 2012.
C.E. de Andrade e F.K. Miyazawa.
Leilões e Algoritmos.
Proceedings of the VI Workshop of Theses, Dissertations and
Undergraduate Research Works in Progress of the IC-UNICAMP. Technical
Report IC-11-13, 2011.
[Official Version in Portuguese]
J.C. de Andrade, M.T.M. CASTRO, and C.E.
Andrade (Editors). Electronic Annals of IV Knowledge Week of
ASMEC College: Business Administration, 2007.
Thesis and Dissertations
Evolutionary Algorithms for some Problems in Telecommunications - Ph.D. Thesis
[UNICAMP Digital Library],
[Local copy];
Abstract:
In last twenty years, telecommunication networks have experienced a huge
increase in data utilization. From massive on-demand video to uncountable
mobile devices exchanging text and video, traffic reached scales that overcame
the network capacities. Therefore, telecommunication companies around the
world have been forced to increase their capacity to serve this increasing
demand. As the cost to deploy network infrastructure is usually very large,
the design of a network heavily uses optimization tools to keep costs as low as
possible. In this thesis, we analyze several aspects of the design and
deployment of communication networks.
An exact algorithm to Two Level Strip Packing Problem - Master Thesis
(in Portuguese)
[UNICAMP Digital Library],
[Local copy];
Abstract:
Cutting and packing problems are common problems that occur in many industry and
business process. Their optimized resolution leads to great profits in several sectors.
A common problem, that occur in textile and paper industries, is to cut a strip of some
material to obtain several small items, using the minimum length of material. This
problem, known by Two Dimensional Strip Packing Problem (2SP), is a hard combinatorial
optimization problem. In this work, we present an exact algorithm to 2SP,
restricted to two staged cuts (known by Two Dimensional Level Strip Packing, 2LSP).
The algorithm uses the branch-and-price technique, and heuristics based on
approximation algorithms to obtain upper bounds. The algorithm obtained optimal or almost
optimal for small and moderate sized instances.
Keywords: Cut and Packing Problem; Branch-and-Price; Column Generation.
Optimization Model for Transportation in Reduced Environments - [PDF in Portuguese] Abstract:
Nowadays, the transportation is a very expensive problem. The complexity in
routing a fleet of vehicles to attend determined demands
within a geographically reduced environment has incentived a great
number of researches in order to optimize these traffics. This work
has for objective to find a feasible solution, with optimum cost or near
this, to pickup and delivery problem in these environments, like warehouses
and mines of ore extraction. For such, the model presented
uses an algorithm based in the meta-heuristic of ant colony optimization in
order to reduce the queue time in the system extremities.
Keywords: Pickup and Delivery Problem, Optimization Model, Ant
Colony Optimization.
2010 - Inapproximability using Non-Uniform
Reduction: In this presentation, we show how to prove the
inapproximability results of hard problems using non-uniform complexity
classes. In particular, we show how to make an instance of subset sum
problem and its resolution by a combinatorial auction that can be solved
in polynomial time resulting in NP ⊆ P/Poly
(statement believed to be unlikely). For this, we show how to approximate this
auction by a factor n/(1+ϵ) using the concept of
Vapnik-Chervonenkis Dimension (VC).
[Presentation in Portuguese]
DISCLAIMER: This page is not a publication of AT&T and AT&T has not
edited or examined the content. The author of the page is solely responsable
for the content.