INPE - Instituto Nacional de Pesquisas Espaciais
INPE - Instituto Nacional de Pesquisas Espaciais
Luiz Antonio Nogueira LorenaSenior Researcher
LAC - Laboratorio Associado de Computacao e Matematica Aplicada
INPE - Instituto Nacional de Pesquisas Espaciais
e-mail: lorena@lac.inpe.br
Problem instances ::
-----------------------------------
P-Median
(São José dos Campos)
-> Capacitated:
SJC1.dat
SJC2.dat
SJC3a.dat
SJC3b.dat
SJC4a.dat
SJC4b.dat
p3038_1000.dat
p3038_900.dat
p3038_800.dat
p3038_700.dat
p3038_600.dat
<- Euclidean distances
Format --> 1st line: # of
points
# of medians
Other
lines: X Y co-ordinates of points,
capacities and demands,
pmedcap.dat
<-
Network distances
Format -->
1st line: # of points
# of medians
Other
lines: capacities and demands.
Other
lines: network distances for each pair of points.
-> Non-capacitated:
pmedian3282.txt
pmedian818.txt
pmedian324.txt
<-
Euclidean distances
Format --> 1st line: # of
points
# of medians
Other
lines: X Y co-ordinates of points.
For more p-median test problems:
-----------------------------------
Max-covering
SJC324.dat
SJC402.dat
SJC500.dat
SJC708.dat
SJC818.dat
<-
Euclidean distances
Format --> 1st line: # of
vertices
9999
# of facilities
distance
Other lines: X Y co-ordinates of points.
demand-SJC324.dat
demand-SJC402.dat
demand-SJC500.dat
demand-SJC708.dat
demand-SJC818.dat
<-
Corresponding demands
Format --> each line: vertex demand.
-----------------------------------
Linear Gate Assignment *
W1.txt
W2.txt
W3.txt
W4.txt
Wli.txt
Wsn.txt
X0.txt
v4000.txt
v4050.txt
v4470.txt
v4090.txt
Format ---> gates, nets (1st line)
columns (next lines)
* Thanks to Alexandre Linhares
-----------------------------------
Map Labeling
25
100
250
500
750
1000
Format ---> line 1 : # of points
line 2 : # of candidate positions (*)
line 3 : # of labels in potential conflict with label 1 (degree of
vertex
1)
line 4 : labels in potential conflict with label 1
line 5 : # of labels in potential conflict with label 2 (degree of
vertex
2)
line 6 : labels in potential conflict with label 2
......
(*) # of
labels = line 1 * line 2
For more Map
Labeling intances:
-------------------------------------
Driver Scheduling
csp25
csp50
csp100
csp250
csp500
-------------------------------------
Prize
Collecting Traveling Salesman Problem-1
-------------------------------------
Queueing Maximal Covering
Location-Allocation Problem
Format
---> line 1 : # of points
covering distance
other lines: X Y co-ordinates of
points
population
-----------------------------------------
Capacitated Centered Clustering
Paper: Chaves, A.
A.. and Lorena, L. A. N.
Clustering
Search Algorithm for the Capacitated Centered Clustering Problem
Computers
& Operations Research , 2008
------------------------------------
Related papers --->
Ribeiro,
G. M. and Lorena, L. A. N.
Heuristics
for cartographic label placement problems
Computers and GeoSciences, v. 32, no. 6, pp. 739-748,
2006
Oliveira A. C.
M. and Lorena, L. A. N.
Pattern
Sequencing Problems by Clustering Search
Jaime Simão Sichman, Helder Coelho and Solange Oliveira Rezende
(Eds.)
Springer Lecture
Notes in Artificial Intelligence Series vol. 4140, pp. 218 - 227, 2006
doi: 10.1007/11874850_26
Biajoli, F. L. and Lorena, L. A. N.
Mirroed
Traveling Tournament Problem: An Evolutionary Approach
Jaime Simão Sichman, Helder Coelho and Solange Oliveira Rezende
(Eds.)
Springer Lecture Notes in Artificial
Intelligence
Series vol. 4140, pp. 208 - 217, 2006
Ribeiro, G. M. and Lorena, L. A. N.
Optimizing the woodpulp stowage using Lagrangean relaxation with
clusters
Journal of the Operational Research Society, 2006
doi:
10.1057/palgrave.jors.2602367
Ribeiro, G. M. and Lorena, L. A. N.
Lagrangean relaxation with clusters for point-feature cartographic
label placement problems
Computers and Operations Research, 2006
doi:
10.1016/j.cor.2006.09.024
Cravo, G. L.; Ribeiro, G. M. and Lorena, L. A. N.
A
greedy randomized adaptive search procedure for the point-feature
cartographic label placement
Computers & GeoSciences, 2007
Mauri, G. R. and Lorena, L. A. N.
A
new hybrid heuristic for driver scheduling
International Journal of Hybrid Intelligent Systems, 2006
Ribeiro, G. M. and Lorena, L. A. N.
Column Generation Approach for the Point-feature Cartographic Label
Placement Problem
Journal of Combinatorial Optimization, 2007
doi:
10.1007/s10878-007-9073-5
Pereira, M. A.; Lorena, L. A. N. and Senne, E. L. F.
A
column generation approach for the maximal covering location problem
International Transactions in Operations Research, 2007
Oliveira A. C. M. and Lorena, L. A. N.
Population
training heuristics
In "EvoCOP 2005"
Gottlieb, J. and Raidl, G. (Eds.)
Springer Lecture
Notes in Computer Science Series Vol. 3448, pp. 166-176, 2005
Oliveira A. C. M. and Lorena, L. A. N.
Detecting
promising areas by evolutionary clustering search
In Advances in Artificial Intelligence
Bazzan, A. L. C. and Labidi, S. (Eds.)
Springer Lecture Notes in Artificial
Intelligence Series vol. 3171, pp. 385-394, 2004
Senne. E.L.F. ; Lorena, L.A.N. and Pereira, M. A.
A
branch-and-price approach to p-median location problems
Computers & Operations Research 32 (6):
1655-1664, 2005
Mauri, G. R. and Lorena, L. A. N.
Driver
Scheduling Generation Using a Population Training Algorithm
SBRN'04 -
Brazilian
Symposium in Neural Networks - Sao Luis - Maranhao - 29 Sept/01 Oct -
2004
Pizzolato, N. D., Barcelos, F. B. and Lorena, L.
A.
N.
School
Location Methodology in Urban Areas of Developing Countries
International Transactions in Operational Research 11:
667 - 681,
2004
Chaves,
A. A. and Lorena, L. A.
Hybrid
algorithms with detection of promising areas for the prize collecting
travelling salesman problem
HIS'05 - Fifth international conference on hybrid intelligent systems -
Rio de Janeiro - November 6 - 9, 2005
Yamamoto,
M. and Lorena, L. A. N.
A
Constructive Genetic Approach to Point-Feature Cartographic Label
Placement
In ”Metaheuristics: Progress as Real Problem
Solvers”
Ibaraki, T., Nonobe, K. and Yagiura, M.
(Eds.),
Kluwer Academic Publishers, pages 285-300, 2005
Yamamoto,
M. ; Camara, G. and Lorena, L. A. N.
Tabu
search heuristic for point-feature cartographic label placement.
GeoInformatica
An International Journal on Advances of Computer Science for Geographic
Information Systems 6 (1): 77-90, March 2002
Lorena,
L.A.N. and Senne, E. L. F.
A
Column Generation Approach to Capacitated p-median Problems
Computers & Operations Research 31 (6):
863-876,
2004
Senne.
E.L.F. and Lorena, L.A.N.
Stabilizing
column generation using Lagrangean/surrogate relaxation: an application
to p-median location problems.
EURO 2001 - THE EUROPEAN OPERATIONAL RESEARCH
CONFERENCE
- Erasmus University Rotterdam, July 9-11, 2001
Senne,
E. L. F. and Lorena, L. A. N.
Lagrangean/surrogate
heuristics for p-median problems.
In Computing
Tools for Modeling, Optimization and Simulation: Interfaces in Computer
Science and Operations Research,
M.
Laguna and J. L. Gonzalez-Velarde (eds.), Kluwer Academic Publishers,
pp. 115-130, 2000
Lorena,
L. A. N. and Senne, E. L. F.
Local
search heuristics for capacitated p-median problems
Networks and Spatial Economics 3: 409 -
419,
2003
Lorena, L. A. N. and Pereira
M. A.
A
Lagrangean/surrogate heuristic for the maximal covering location
problem
using Hillsman's edition.
International Journal of
Industrial
Engineering 9(1), 57-67, 2002.
Lorena,
L. A. N. ; Senne, E. L. F. ; Paiva, J. A. C.
e Pereira M. A.
Integracao
de modelos de localizacao a sistemas de informacoes geograficas.
Gestao e Producao 8(2):180-195, 2001.
Oliveira
A. C. M. and Lorena, L. A. N.
A
Constructive Genetic Algorithm for Gate Matrix Layout Problems.
IEEE Transactions on Computer-Aided Design
of Integrated
Circuits and Systems. Vol. 21, no. 8, pp 969-974, 2002
Oliveira
A. C. M. and Lorena, L. A. N.
2-opt
population training for minimization of open stack problem
In Advances in Artificial Intelligence,
Bittencourt, G. and G. L. Ramalho (Eds.)
Springer Lecture Notes in Artificial Intelligence
Series vol. 2507, pp. 313-323 , 2002
-----------------------------------
