[PDF] ALIO Back Matter
[PDF] ALIO Back Matter
[PDF] ALIO Back Matter
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
MB18<br />
5 - Iterated Greedy Local Search for a Territory Design Problem under a<br />
Routing Budget Costraint<br />
Roger Z. Rios-Mercado, Universidad Autónoma de Nuevo León,<br />
AP 111-F, Cd. Universitaria, San Nicolás, NL, Mexico,<br />
roger@yalma.fime.uanl.mx, Juan C Salazar, Rubén Ruiz<br />
We address a territory design problem where maximum territory compactness is<br />
sought. Planning requirements are territory connectivity, territory balancing with<br />
respect to two node activities (number of customers and product demand), and a<br />
budget constraint that sets an upper limit on the total distance traveled. We present<br />
an Iterated Greedy Local Seach heuristic to this problem. The results over a wide<br />
variety of instances show the effectiveness of the proposed approach.<br />
■ MB18<br />
Aula 384- Third Floor<br />
Transportation and Logistics II<br />
Contributed Session<br />
Chair: Tsutomu Suzuki, Professor, University of Tsukuba, 1-1-1 Tennodai,<br />
Tsukuba, Ib, 3058573, Japan, tsutomu@risk.tsukuba.ac.jp<br />
1 - Applied Multivariate Statistical Analysis in Vehicular Traffic Flow<br />
Rudinei Luiz Bogo, UFPR, Capitao Leonidas Marques, 1999, Curitiba,<br />
Brazil, rudi_bgo7@hotmail.com, Adilandri Mercio Lobeiro, Nivaldo<br />
Aparecido Minervi, Fabio Andre Negri Balbo, Anselmo Chaves Neto,<br />
Liliana Gramani Cumin, Marina V. R. P. G. Ferreira, Eloy Kaviski<br />
The growth in number of vehicles on federal highways Paraná has caused many<br />
problems with the increase in accidents. From a database of accidents on the BR-<br />
116, conducted a study using canonical correlation analysis. This technique allows<br />
the identification and association of two groups of variables. Thus, we evaluated the<br />
correlation between the types of accidents with other sets of characteristics of the<br />
road and model the relationship between these variables. Results will be apresented.<br />
2 - Development Tool Support Decision Making in the Area of<br />
Transport Planning<br />
Daniel Espinoza, Universidad del Bío-Bío, Avda. Collao 1202, Depto.<br />
Ingeniería Industrial, Concepción, 4081112, Chile,<br />
despino@alumnos.ubiobio.cl, Ivan Santelices Malfanti<br />
This tool to support decision making allows the user to obtain the best alternative<br />
transportation and associated costs, considering variables related to transportation<br />
alternative made by the user. To develop this tool, you must obtain a database with<br />
all information necessary to generate alternatives, and so by means of criteria<br />
associated with user needs for the best transportation alternative.<br />
3 - Route Planning Software and Hybrid Genetic Algorithm<br />
Johnny Pincay, ESPOL, Via Perimetral Campus Gustavo Galindo,<br />
Guayaquil, 09-01-5863, Ecuador, jr.johnnypv@gmail.com,<br />
James Tomala, Polo Vaca<br />
This paper proposes a decision support system based on a hybrid genetic algorithm<br />
and codified on Java programming language, to solve a routing problem, a<br />
CVRPSTW. This Metaheuristic calls for a planning of the optimal set of routes with<br />
the least cost and respecting all constraints. The investigation describes a<br />
mathematical model, makes deeper in the development and application of a Genetic<br />
Algorithm of non structured population integrated with Local Search Methods.<br />
4 - Simulating Growth Process of Hierarchical Transportation Networks<br />
Tsutomu Suzuki, Professor, University of Tsukuba, 1-1-1 Tennodai,<br />
Tsukuba, Ib, 3058573, Japan, tsutomu@risk.tsukuba.ac.jp<br />
The paper presents simulation model for growth process of hierarchical<br />
transportation networks by maximizing the sum of reduced travel time at each<br />
stage. If the speed on network is fast, radial roads extend to the peripheral parts<br />
from the center, forming the tree-shaped main roads. On the other hand, if the<br />
speed is slow, a main road is put at the regular interval, and the lattice structure<br />
takes place, forming the regular lattice-shaped network.<br />
<strong>ALIO</strong> / INFORMS International – 2010<br />
60<br />
■ MB19<br />
Aula 383- Third Floor<br />
Kimberly-Clark Optimization Contest<br />
Sponsor: Optimization: Practice and Software of OR/MS<br />
Sponsored Session<br />
Chair: German Riano, Kimberly-Clark, Cra. 11a #94-45, Bogotá,<br />
Colombia, German.Riano@kcc.com<br />
Co-Chair: Bjarni Kristjansson, President, Maximal Software, Inc., 933 N.<br />
Kenmore St., Suite 218, Arlington, VA, 22201, United States of America,<br />
bjarni@maximalsoftware.com<br />
1 - Kimberly-Clark Latin America Solves a Transportation Problem with<br />
Help of an Optimization Contest<br />
Daniel Silva, OR Analyst Sr., Kimberly Clark Corp., KRA 11A # 94-<br />
25, Piso 5, Bogotá, Colombia, daniel.f.silvaizquierdo@kcc.com,<br />
Diego Morán, Daniel Espinoza, German Riano, Gustavo Angulo,<br />
Rodrigo López<br />
The Transport Load Builder is an optimization tool developed by Kimberly-Clark<br />
Latin America Operations (KC-LAO) to address several challenges in the company’s<br />
transport planning operations. To help solve these challenges, KC-LAO launched an<br />
optimization contest, in association with <strong>ALIO</strong>. There were 24 teams from<br />
universities all over the region and the final winner was a team from Universidad de<br />
Chile. Several of their ideas were incorporated into the solution, and<br />
implementation is under way.<br />
2 - Second KC-<strong>ALIO</strong> Optimization Contest Launch<br />
David Sanchez, Junior Research Analyst, Kimberly-Clark, Cra 11a<br />
#94-45, Bogotá, Colombia, david.r.sanchez@kcc.com, Daniel Silva<br />
In this presentation we will launch the second Optimization Contest, sponsored by<br />
Kimberly-Clark and <strong>ALIO</strong>. We will present the challenge and will explain the rules.<br />
See also earlier talk in this session, where we will present the results from the<br />
previous contest.<br />
■ MB20<br />
Aula 382- Third Floor<br />
Cutting and Packing 4<br />
Cluster: 7th ESICUP Meeting<br />
Invited Session<br />
Chair: Horacio H. Yanasse, Professor, LAC - INPE, Av. dos Astronautas,<br />
1.758, SJ dos Campos, SP, 12227-010, Brazil, horacio@lac.inpe.br<br />
1 - A Price-and-cut Strategy to Minimize the Number of Saw Cycles in<br />
the Cutting Stock Problem<br />
Socorro Rangel, Associated Professor, DCCE - UNESP, Rua Cristovao<br />
Colombo, 2265, SJ Rio Preto, 15054-000, Brazil,<br />
socorro@ibilce.unesp.br, Alyne Toscano Martins, Horacio H. Yanasse<br />
In this paper we consider the two-dimensional cutting stock problem with the<br />
objective of minimizing both the total number of plates and the number of cutting<br />
machine set ups (saw cycles). We propose two solution strategies and compare the<br />
results based on dominance criteria. Results of a computational study using real data<br />
from a Brazilian furniture plant are also presented.<br />
2 - A Combined Cutting Stock and Lot-sizing Problem<br />
Elsa Silva, PhD Student, Centro de Investigaçao Algoritmi,<br />
Universidade do Minho, Braga, Portugal, elsa@dps.uminho.pt,<br />
Filipe Alvelos, José Manuel Valério de Carvalho<br />
In the production process several industries handle both lot-sizing and cutting stock<br />
problems. Usually they are solved independently, which can lead to unacceptable<br />
global costs. In the problem addressed, costumer demands occur in several periods<br />
in a finite planning horizon, so items production can be or not anticipated. We<br />
propose an integrated integer programming model to optimize the combined two<br />
dimensional cutting stock and lot-sizing problem, minimizing the wastage and the<br />
storage costs.