Technical Sessions – Monday July 11

HC-06 IFORS 2011 - Melbourne
4 - Analysis of the LNG Market
Mabel Chou, National University of Singapore, 1 Business Link,
BIZ 1, #04-08, 117592, Singapore, Singapore,
mabelchou@nus.edu.sg
Prior to the introduction of Liquefied Natural Gas (LNG), movement of natural
gas has been a limitation for gas-producing countries to serve the global
demand. Since the introduction of LNG in the global energy market, gasproducing
countries has more room to commercialise their natural gas reserves
to the gas-consumption countries. With the improvement in LNG technology
and lower investment cost over the years, global LNG trade has been accelerating
and is expected to be of growing importance. We present an overview of
the emergence of LNG market and the current trading patterns.
� HC-06
Thursday, 13:30-15:00
Meeting Room 105
Intelligent Transport Systems
Stream: Transportation
Invited session
Chair: Alberto Colorni, Department of Industrial Design, delle Arti e
della Comunicazione, Politecnico di Milano, c/o Metid, p.zza
Leonardo da Vinci 32, 20133, Milano, Italy, alberto.colorni@polimi.it
Chair: Maurizio Bruglieri, INDACO, Politecnico di Milano, Via
Durando, 38/a, Milano, Italy, maurizio.bruglieri@polimi.it
1 - Carsharing and Carpooling: Two Different MIP Optimization
Approaches
Gonçalo Correia, Department of Civil Engineering, University of
Coimbra, Faculdade de Ciências e Tecnologia. Dep. Eng. Civil,
sala SA 2.8 Rua Luis dos Reis Santos, 3030, Coimbra, Portugal,
gcorreia@dec.uc.pt, Antonio Antunes
Carsharing is often mistaken as being the same as carpooling, while in reality
these are two different transport options: carpooling denotes a system by
which people share their own vehicles mainly in commuter trips in order to
save money on transport costs; whereas carsharing is a near term car rental
mainly suited for city center trips avoiding car ownership and providing the
comfort of using an automobile. For the first alternative we present a MIP
model for finding the best ridesharing groups while for the second we address
the problem of locating depots and assigning trips to vehicles.
2 - A New Agent-based Simulation Procedure to Assess
the Market Potential of Shared Taxis: An Application
to the Lisbon Municipality
Luis Martinez, Civil Engineering, Instituto Superior Tecnico,
Avenida Rovisco Pais, 1049-001, Lisbon, Portugal,
martinez@civil.ist.utl.pt, Gonçalo Correia, José Viegas
This paper presents a simulation procedure to assess the market potential for
the implementation of shared taxi services in urban areas using new ITS solutions
for easy booking and payment from the clients fro the city of Lisbon.
The paper proposes an agent based simulation model in which a set of rules for
space and time matching between the shared taxis and passengers is and then
presents an algorithm that seeks to optimize different interests by conciliating
the perspectives of the clients and the operators.
3 - A New Optimization Procedure to Estimate the Market
Potential of a New Express Minibus Service for the Lisbon
Metropolitan Area
Tomás Eiró, Department of Civil Engineering and Architecture,
Instituto Superior Técnico, Avenida Rovisco Pais, Civil
Engieneering Building, room 4.25, 1049-001, Lisbon, Portugal,
teiro@civil.ist.utl.pt, Luis Martinez
This paper presents a new comprehensive optimization procedure to estimate
the market potential and configuration of a new flexible and demand responsive
Express Minibus service, which integrates the comfort and commercial speed
of the private car and the semi-fixed location of stops and route’s schedules.
The optimization procedure integrates several steps that go from the potential
stops location and the creation of met-demand points that are used to estimate
service during the day using an adaption of a routing-vehicle algorithm.
90
4 - A Carpooling Service for Universities: A Case Study in
Milan
Alberto Colorni, Department of Industrial Design, delle Arti e
della Comunicazione, Politecnico di Milano, c/o Metid, p.zza
Leonardo da Vinci 32, 20133, Milano, Italy,
alberto.colorni@polimi.it, Maurizio Bruglieri, Alessandro Luè,
Diego Ciccarelli
Carpooling is an ITS based on a shared use of private cars. We present the
project to design, implement and test a car pooling service for Università Statale
and Politecnico di Milano universities. At the best of our knowledge no work
in the literature faces the problem of designing a carpooling service for university
students taking into account the needs of this particular class of users e.g.
friend/enemy list, possible multiple destinations, imposition of partial pools.
For this reason we have put right a tailored matching algorithm to form the
crews meeting all these needs.
� HC-07
Thursday, 13:30-15:00
Meeting Room 106
Topics in Combinatorial Optimization IV
Stream: Combinatorial Optimization
Invited session
Chair: Paulo Morelato França, Dept. Matemática, Estatística e
Computação, Universidade Estadual Paulista, Av. 11 de maio 2137,
apto. 172 B, 19061-360, Presidente Prudente, SP, Brazil,
paulo.morelato@gmail.com
1 - Scheduling Wireless Mesh Networks
Celia Glass, Cass Business School, City University, 106 Bunhill
Row, EC1Y 8TZ, London, United Kingdom,
c.a.glass@city.ac.uk
Wireless Mesh Networks provide low cost internet and broadband access, but
have distinct limitations for scheduling. The access points, used e.g. for WiFi,
cannot multi-task. This disposes them to perfect periodic scheduling which offers
both reliability of service, and energy saving. We employ number-theoretic
results to go beyond previous approach, e.g periodicities related by powers of
2, to perfect periodic scheduling. We report on the theoretical approaches and
computational results to demonstrate that perfect periodic scheduling can form
the basis for efficient scheduling of WMNs.
2 - Heuristic Algorithms for Assigning Personalized TV Advertisements:
Deterministic and Stochastic Scenarios
Ron Adany, Computer Science, Bar-Ilan University, 52900,
Ramat-Gan, Israel, adanyr@cs.biu.ac.il, Sarit Kraus, Fernando
Ordonez
We consider the problem of assigning personalized TV ads to viewers with
finite viewing capacity in order to maximize revenue. We consider the deterministic
scenario (DET) and the stochastic scenario (STO) where the viewers’
viewing capacities are uncertain. Since the problem is NP-Hard, we present
heuristic solutions which we evaluated using computational experiments. Our
heuristics for DET, on average, attains 98% of the possible revenue, outperforming
a MIP solver, and our robust heuristics attains almost the same revenue
as DET even when the uncertainty is very high, e.g. 50%.
3 - GRASP with Path-Relinking for two Arc Routing Problems
Fábio Usberti, DENSIS, Universidade Estadual de Campinas,
Av. Albert Einstein, 400, 13083-852 , Campinas, SP, Brazil,
fusberti@yahoo.com, Paulo Morelato França, André Luiz
Morelato
The NP-hard Capacitated Arc Routing Problem (CARP) and Open CARP are
defined on an undirected graph G(V,E), where minimum cost tours must cover
a set of required edges. In CARP tours are constrained to form cycles starting
from the depot, while in Open CARP the tours may start and end at any two
nodes. This work proposes a GRASP with Path-Relinking to solve several instances
from literature, and results reveal that our metaheuristic is competitive
with other state-of-the-art metaheuristics.