[PDF] ALIO Back Matter

MA19
2 - Utilizing an EPCIS System to Automate Route Classification and
Optimize a Transportation Network
Leif Anderson, Blackhawk Management Corporation, 13100 Space
Center Blvd, HB3-30, Houston, TX, 77059-3556, United States of
America, leif.anderson@boeing.com, Liang-Chieh Cheng
This study introduces a framework for a transportation strategy given the prevalent
RFID system enabled by EPCIS technologies, in international trade over
conventional freight tracking and tracing practices. We offer a route classification
scheme exclusive to auto-identification and resulting strategies which are illustrative
to optimize cost and volatility inherent to transport across global markets.
3 - Inventory and Distribution Management in a 1 Warehouse –
N Retailers Distribution System using VMI - Vendor Managed
Inventory
Hector Toro, Assistant Professor, Pontificia Universidad Javeriana,
Calle 18 118 - 250, Cali, Colombia, htoro@javerianacali.edu.co,
Liliana Delgado
The VMI (Vendor Managed Inventory) philosophy for inventory management is
used as a background for setting inventory policies and making transportation
decisions in a typical distribution system with one warehouse and several retailers.
A combination between simulation and optimization techniques is applied to the
resulting IRP (Inventory Routing Problem). A practical perspective is maintained
throughout the research and results from a case study are presented.
■ MA19
Aula 383- Third Floor
Models and Algorithms for Vehicle Routing
and Dial-a-ride Problems
Cluster: Logistics, Vehicle Routing and Location
Invited Session
Chair: Luis Neves Gouveia, Professor, Universidade de Lisboa - CIO,
Bloco C6, Lisbon, Portugal, legouveia@fc.ul.pt
1 - Hop-indexed Circuit-based Formulations for the Travelling
Salesman Problem
Luis Neves Gouveia, Professor, Universidade de Lisboa - CIO,
Bloco C6, Lisbon, Portugal, legouveia@fc.ul.pt, Maria Teresa
Godinho, Pierre Pesneau
We discuss a new Hop-indexed Circuit-based formulation for the TSP. We show that
the new formulation enhanced with some valid inequalities produces very tight
linear bounds (with emphasis on the so-called cumulative TSP). We show that the
new enhanced formulation dominates the previous best (compact) formulations
from the literature.
2 - A Bus School Routing Problem
Juan José Salazar González, Professor, Universidad de La Laguna,
DEIOC - Matemáticas, Tenerife, La Laguna, TF, 38271, Spain,
jjsalaza@ull.es, Jorge Riera
The Multiple Vehicle Traveling Purchaser Problem aims designing a set of optimal
school bus routes with the purpose of carrying pupils to their center of learning in
an urban surroundings.
3 - A Hybrid Tabu Search and Constraint Programming Algorithm for
the Dynamic Dial-a-ride Problem
Gerardo Berbeglia, HEC Montréal, 809 Marie Anne Est, Montréal,
QC, H2J 2A7, Canada, gerardo.berbeglia@hec.ca, Gilbert Laporte,
Jean-François Cordeau
We present a hybrid algorithm for the dynamic dial-a-ride problem in which service
requests arrive in real time. The algorithm combines an exact constraint
programming (CP) algorithm and a tabu search (TS) heuristic. An important
component of the TS heuristic consists of three scheduling procedures. Experiments
show that the CP algorithm is sometimes able to accept or reject incoming requests,
and that the hybrid method outperforms each of the two algorithms when they are
executed alone.
ALIO / INFORMS International – 2010
54
■ MA20
Aula 382- Third Floor
Cutting and Packing 3
Cluster: 7th ESICUP Meeting
Invited Session
Chair: Ramón Alvarez-Valdés, Professor, University of Valencia, Dept.
Statistics and O.R., Doctor Moliner 50, Burjassot, 46100, Spain,
ramon.alvarez@uv.es
1 - A Hybrid Algorithm for Container Loading with Load Bearing
Constraints
Maria Teresa Alonso, Universidad Castilla-la Mancha, Parque
Cientifico y Tecnologico s/n, Albacete, 02071, Spain,
mai.alonso@gmail.com, Jose Tamarit, Ramón Alvarez-Valdés,
Francisco Parreño
We have developed a hybrid algorithm for the three-dimensional container loading
problem with full support for the boxes and load bearing constraints. Embedded in a
GRASP structure we have designed a constructive algorithm inspired on Ngoi’s box
placement and a VND procedure for the improvement phase using increasingly
aggressive moves.
2 - Approaches for 3D-container Loading Problems with
Multi-drop Considerations
Leonardo Junqueira, Doctoral Student, Universidade Federal de São
Carlos, Rod. Washington Luis - Km 235, São Carlos, SP, Brazil,
leo_junqueira@yahoo.com, Denise Yamashita, Reinaldo Morabito
In this work we present approaches based on mixed integer linear programming
models for packing rectangular boxes into containers, considering multi-drop
constraints. These constraints refer to cases where boxes that are delivered to the
same destination must be placed close to each other in the container or truck, and
the 3D-loading pattern must take into account the delivery route of the vehicle.
Computational experiments are presented solving the approaches with optimization
solvers.
3 - A Hybrid Algorithm for the Vehicle Routing and Loading Problem
Andreas Bortfeldt, University of Hagen, Profilstrasse 8, Hagen,
58084, Germany, Andreas.Bortfeldt@FernUni-Hagen.de
The 3D vehicle routing and loading problem combines capacitated vehicle routing
and three-dimensional loading with additional packing constraints. An efficient
hybrid algorithm, including a tabu search procedure for routing and a tree search
procedure for loading, is introduced. Computational results are presented for all
publicly available test instances.
4 - The Special Diophantine Equations in the Computation Solution of
the Certain Rectangle Cutting-packing (C/P) Problems
Kovacs Lehel, Sapientia - Hungarian Unuversity of Transylvania,
Târgu Mures, Romania, klehel@ms.sapientia.ro, Gyorfi Jeno
The Special Diophantine Equation (SDE) is any linear polynomial equation, which
allows the variables to be zero or one. For the rectangle C/P problems always can be
assigned one or more SDE, depending on the dimension of the C/P problem. Based
on the solutions of the SDE, we elaborated an iterative algorithm, which solve an
exact or inexact C/P. The presented algorithm in essence is invariant, when the
dimension of the C/P problem varies.
Monday, 11:30am - 1:00pm
■ MB01
Aula Magna- First Floor
Tutorial: Combinatorial Benders Approaches to
Hard Problems
Cluster: Tutorials
Invited Session
Chair: Michael Trick, Carnegie Mellon University, Tepper School of
Business, 5000 Forbes Avenue, Pittsburgh, PA, 15213,
United States of America, trick@cmu.edu
1 - Combinatorial Benders Approaches to Hard Problems
Michael Trick, Carnegie Mellon University, Tepper School of
Business, 5000 Forbes Avenue, Pittsburgh, PA, 15213,
United States of America, trick@cmu.edu
Benders decomposition is an old idea in integer programming. In a Benders
approach, there are two types of variables: master variables and subproblem
variables. Recent work has shown the value of this approach even in cases where