Instituto Superior Técnico. Theme 1: Transport networks design and evaluation Case study presentation and synthesis



Similar documents
Brazil s Response to Lower Commodity Prices Will Infrastructure Improvements Support Further Expansion?

Instituto Superior Técnico Masters in Civil Engineering. Lecture 2: Transport networks design and evaluation Xpress presentation - Laboratory work

Costa Monteiro Participações. MC Logistica. Logistic Barge Company: Ton/Mo. US$ 450 MM (2006) Capacity Largest Pig Iron

Brazilian Mission to Denmark. Brazil s Port Sector. Fernando Antonio Brito Fialho National Agency for Waterway Transportation Director-General

The sight of a Port Operator

Brazilian Program for Investment in Logistics: Roads, Railways and Ports

Now, I ll turn the conference over to Mr. Bernardo Hees, who will start the presentation. Mr. Hees, you may begin the conference

Erasmus Mundus External Cooperation Windows. EU-BRAZIL STARTUP Call for applications outcome 08/02/2010

Agri Commodities ABN AMRO Bank NV

Abstract Number: Critical Issues about the Theory Of Constraints Thinking Process A. Theoretical and Practical Approach

XLVI Pesquisa Operacional na Gestão da Segurança Pública

The Brazilian water transportation sector Regulation overview

Industrial area with Hangar. Land area: sqm Hangar area: sqm Office area: 250 sqm Brazil Espírito Santo Serra Highway BR 101 North

THE CASE STUDY OF BRAZIL. ANDRE DE FAZIO, MSc PORT DEVELOPMENTS IN AN EMERGING COUNTRY

Application of ARIMA models in soybean series of prices in the north of Paraná

BRAZIL MEANS BUSINESS. In spite of the world financial crisis, Brazil remains an appealing business destination.

Investment Opportunities in Infrastructure Projects in Brazil

A hierarchical multicriteria routing model with traffic splitting for MPLS networks

Introduction and context

HYBRID INTELLIGENT SUITE FOR DECISION SUPPORT IN SUGARCANE HARVEST

Belo Horizonte and Rio de Janeiro, October 15th 2015

Heuristics for Dynamically Adapting Constraint Propagation in Constraint Programming

Title: Integrating Management of Truck and Rail Systems in LA. INTERIM REPORT August 2015

B-bleaching: Agile Overtraining Avoidance in the WiSARD Weightless Neural Classifier

Discuss the size of the instance for the minimum spanning tree problem.

An Interactive Train Scheduling Tool for Solving and Plotting Running Maps

Distributed Systems LEEC (2005/06 2º Sem.)

Initially pupils put the description of the stages of Brazil s railway network into the correct order (d, a, e, b, c).

Projects for High-speed Trains in Brazil BRAZILIAN HIGH SPEED LINE (RIO DE JANEIRO SÃO PAULO CAMPINAS)

Routing in Road Networks: the toll booth problem

Kuehne + Nagel Germany. Paola Ploß Manager Route Sales Development Latin America

MCLI RAIL FOCUS WORKGROUP 27 SEPTEMBER 2005 MCLI RAIL FOCUS WORKGROUP 27 SEPTEMBER 2005

Why? A central concept in Computer Science. Algorithms are ubiquitous.

PROFILE.

ANHANGUERA EDUCACIONAL PARTICIPAÇÕES S.A. Publicly Held Company

Yusen Logistics do Brazil. Supply Chain Solutions

The Goldberg Rao Algorithm for the Maximum Flow Problem

ANALYSIS OF A ANTROPIC INFLUENCES IN A FLOODPLAN

Multi-layer MPLS Network Design: the Impact of Statistical Multiplexing

Latin American Feedstocks

Fleet Assignment Using Collective Intelligence

15th Discussion Meeting on Thermodynamics of Alloys

A Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem

INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models

A Service Design Problem for a Railway Network

Scheduling Shop Scheduling. Tim Nieberg

Curriculum Vitae. January, 2005

Mconf: Global Webconferencing based on Open Source

Henrique Bursztyn Organizing Committee

APRIL 2014 PORT OF ITAQUI

Algorithm Design and Analysis

The Need for International Weather Data and Related Products at the U.S. Department of Agriculture. Presented to. CoCoRaHS

INDUSTRIALIZED PRODUCTS

Logistics and Infrastructure

Labs D Or Acquisition

Regulation in the Brazilian waterway sector

Development of an Automated Tool for Demand Forecasting in Unitywater

CONTENTS AREA STUDIES - REGIONAL SUSTAINABLE DEVELOPMENT: BRAZIL

Vector storage and access; algorithms in GIS. This is lecture 6

Classifying Large Data Sets Using SVMs with Hierarchical Clusters. Presented by :Limou Wang

Classification - Examples

Hydrocarbon reservoir modeling: comparison between theoretical and real petrophysical properties from the Namorado Field (Brazil) case study.

The Problem of Scheduling Technicians and Interventions in a Telecommunications Company

Constrained Clustering of Territories in the Context of Car Insurance

Research Topics in Renewable Energies in Brazil

Two objective functions for a real life Split Delivery Vehicle Routing Problem

Master Degree in Manufacturing Engineering: Preparing Professionals for the Challenging Work Market

FORECASTING MODEL FOR THE PRODUCTION AND CONSUMPTION OF COTTON FIBER VERSUS POLYESTER

Dynamic Vehicle Routing in MATSim

A MODEL TO SOLVE EN ROUTE AIR TRAFFIC FLOW MANAGEMENT PROBLEM:

Charles Fleurent Director - Optimization algorithms

BIRCH: An Efficient Data Clustering Method For Very Large Databases

The Rolling Stock Recovery Problem. Literature review. Julie Jespersen Groth *α, Jesper Larsen β and Jens Clausen *γ

NEW INVESTMENT OPPORTUNITIES IN INFRASTRUCTURE

Public Funding and the Beginning of a New Era in Higher Education in Brazil

Isabela Nogueira de Morais Education Ph.D. in Economics M.A. in Political Science B.A. in Social Communication (Journalism)

Transcription:

Instituto Superior Técnico REGIÕES E REDES (REGIONS AND NETWORKS) Theme 1: Transport networks design and evaluation Case study presentation and synthesis Luis Martinez 1

OUTLINE Case study: Soybean transportation in Brazil (Fajardo, A. P., 2006. Uma Contribuição ao Estudo do Transporte Intermodal -Otimização da Expansão Dinâmica das Redes Intermodais de Soja Produzida no Estado de Mato Grosso. Dissertation submitted in Universidade Federal do Rio de Janeiro (UFRJ), Rio de Janeiro: 170) Description Present situation Base Optimization model (initial solution) Network expansion Optimization model Analysis of the results Synthesis of the topic 2

IN BRAZIL - DESCRIPTION Soy produced in the State of Mato Grosso 12.961.134 tons around 8 production centers Almost all the production of soybean is exported (mainly to Asia) The soybean production must reach the ports located at the South and North of Brazil Capacity, cost Soy transportation problem 3

IN BRAZIL PRESENT SITUATION Ports available: Santos (São Paulo) Paranaguá (Paraná) Vila do Conde (Belém) Itaqui (São Luís) Santos handles nearly 50% of the country s soybean exports Existing transportation options of soybean production 4

IN BRAZIL BASE OPTIMIZATION MODEL (I) Mathematical modeling (Min-cost-flow): Each node representing a production center (centroid) - Source Final port Sink Super-source + Super-sink Intermodal transfer nodes Each intermodal node split into: Transport arcs constrained by transport capacity Processing arcs interchange processing capacity 5

CASE STUDY: SOYBEAN TRANSPORTATION IN BRAZIL BASE OPTIMIZATION MODEL (II) Variables: For arcs: A : set X c U j j j of : all arcs flow passingin arc( : unitcost of : capacity (max flowin arc( flow)of arc( For nodes: B i : Load balanceof nodei 6

IN BRAZIL BASE OPTIMIZATION MODEL (III) Objective function (Cost): Constraints: ( A c( X ( Node equilibrium X ( X ( j, i) j: ( A j:( j, i) A Arcs capacity B( i)... i N 0 X ( U(... ( A Cost: R$ 3.629.615.050,57 Optimal solution with currently available transportation options. Expensive, but capacity is enough 7

IN BRAZIL NETWORK EXPANSION MODEL (I) The purpose is to invest in existing or new arcs, with the aim of reducing operating costs Two models runs were made: Free investments (no amortization) to compute minimum possible operating costs Real investments (amortization considered over a 15 year period) to get a realistic optimal solution Initially, all apparently interesting investments (road, rail, rivers, ports, interchange stations) identified and budgeted Some investments for capacity (to take advantage of lower costs along a favorable path which was strangled by a bottleneck) Some investments for replacement (lower costs, no additional capacity) In some cases, successive investments considered at same place 8

CASE STUDY: SOYBEAN TRANSPORTATION IN BRAZIL NETWORK EXPANSION MODEL (II) All investments modeled for arcs (even when physically in nodes) Each node with possible investments modeled as a local network No two arcs ( may exist in the network (Staged) Capacity increase in node C New arcs or arcs replacement 2X 3X Y j : decision variable of investmentin arc ( Two stages of capacity increase Y( E2) Y( E3) Arc replacement Y( A, C1) Y( A, C2) 1 9

CASE STUDY: SOYBEAN TRANSPORTATION IN BRAZIL NETWORK EXPANSION MODEL (III) New variable: Objective function: Constraints: K j : Annualizedcost of c( X ( ( A ( Y( A i investmenton arc ( K( Node equilibrium X ( X ( j, i) B( i)... i N j: ( A j:( j, i) A Arcs capacity 0 X( j ) U( j )... ( j ) A 0 0 X ( Y( * U(... ( ( Abs Ais Aia ) Binary Expansion variables Y ( j ) { 01, } j A / 10

CASE STUDY: SOYBEAN TRANSPORTATION IN BRAZIL NETWORK EXPANSION MODEL (IV) Constraints (cont d): Sequential investments Y ( j1) Y( j2) Y( j3)... ( j n ) A ia Arcs replacement / upgrade Identical use of both part of real arcs (with auxiliary node introduced) Y( m) Y( m,... ( m),( m, ( A bs Ais ) Alternate use due to arc replacement Y( m) Y( n) 1... ( m),( n) ( A bs Ais ) 11

IN BRAZIL ANALYSIS OF RESULTS (I) Results for free investments (all K=0): Transport costs: R$ 1.264.883.352,87 Only 35% of current operating costs Results with real investments (K>0): Annualized Investment costs: R$ 992.683.599,66 Transport costs: R$ 1.264.883.352,87 Total Costs: R$ 2.257.566.952,53 Only 62% of current operating costs Optimal solution with network expanded and unconstrained budget 12

IN BRAZIL DYNAMIC NETWORK EXPANSION MODEL (I) Optimal network expansion plan computed without considering Possible capital restrictions Time needed to make several (possibly many) investments operational, all across Brazil So, a dynamic network expansion problem was defined Adding a constraint of available capital at z% of the full optimal package With z varying from 1% to 100% ( j ) Y( A i j )*K( j ) TOTINV * it 1 it 1.. 100 100 13

Custos anuais Milhões REGIONS AND NETWORKS IN BRAZIL ANALYSIS OF RESULTS (II) Incremental investment analysis (thresholds of investment for total cost reduction) Transport costs reduction % of Investment Resulting cost w.r.t. current cost 0,4% 81,8% 2,5% 76,4% 11,8% 76,04% 31,2% 71,55% 40,5% 71,2% 42,2% 68,21% 44,3% 62,8% 53,6% 62,46% 4000 3500 3000 2500 2000 1500 1000 500 0 Redução dos Custos com a Intensidade de Investimento Custo total (bilhões reais) Custo Transporte 0 10 20 30 40 50 60 70 80 90 100 Invest (Custo Anualizado) em % 100% 62,19% Total costs and transport cost reduction with growing investment 14

Investment arcs in the optimal solution Arcos de Investimento no Opção Ótima REGIONS AND NETWORKS IN BRAZIL ANALYSIS OF RESULTS (III) Incremental investment analysis (types of investment arcs) a) Arcs that became part of the optimal solution and remain until the total investment b) Arcs that became part of the optimal solution, exit and reenter again until the total investment c) Arcs that became part of the optimal solution and exit and do not reenter again until the total investment d) Arcs that became part of the optimal solution, exit, reenter, exit again and are not part of the total investment solution e) Arcs that are only part of the optimal solution with the total investment 385 382 381 377 373 370 369 361 329 311 309 308 300 299 298 258 257 255 254 253 249 246 235 231 76 75 58 41 0 0.36% 1 2.50% 2 11.78% 3 31.21% 4 40.49% 5 42.16% 6 44.31% 7 53.59% 8100% 9 2.50 11.78 31.21 40.49 42.16 44.31 53.59 100 Porcentagem de Investimento da Solução Ótima Percentage of Investment of the optimal solution Identification of different types of investment arcs 15

Investment arcs in the optimal solution Arcos de Investimento no Opção Ótima REGIONS AND NETWORKS IN BRAZIL ANALYSIS OF RESULTS (III) Preparing a staged investment without regret (aiming at full investment) Incremental investment analysis (removal of arcs type c and d ) Solutions with these arcs Increment in total cost w.r.t. optimal dynamic path 0%=< Inv<0.4% 0,00% 0.36%<=Inv<2.5% 0,00% 2.5%<=Inv<11.8% 6,60% 11.8%<=Inv<31.2% 0,00% 31.2%<=Inv<40.5% 5,91% 40.5%<=Inv<42.2% 0,00% 42.2%<=Inv<44.3% 4,19% 44.3%<=Inv<53.6% 11,77% 53.6%<=Inv<59.9% 12,27% 59.9%<=Inv<71.3% 12,11% 71.3%<=Inv<100% 4,37% Inv = 100% 0,00% 385 382 381 377 373 370 369 361 329 311 309 308 300 299 298 258 257 255 254 253 249 246 235 231 76 75 58 41 0 0.36% 1 11.78% 2 40.49% 3 59.87% 4 71.29% 5100% 6 0.36 11.78 40.49 59.87 71.29 100 Percentagem de Investimento da Solução Ótima Percentage of Investment of the optimal solution Identification of different types of investment arcs 16

Investment arcs in the optimal solution Arcos de Investimento no Opção Ótima REGIONS AND NETWORKS IN BRAZIL ANALYSIS OF RESULTS (IV) Preparing a staged investment without regret (possibly stopping without at full investment) Incremental investment analysis (network only with arcs type a ) Solutions with these arcs Increment in total cost w.r.t. optimal dynamic path 0%=< Inv<0.4% 0,00% 0.36%<=Inv<2.5% 0,00% 2.5%<=Inv<11.8% 6,60% 11.8%<=Inv<31.2% 0,00% 31.2%<=Inv<40.5% 5,91% 40.5%<=Inv<42.2% 0,00% 42.2%<=Inv<44.3% 4,19% 44.3%<=Inv<53.6% 11,77% 53.6%<=Inv<59.9% 12,27% 59.9%<=Inv<71.3% 0,00% 71.3%<=Inv<100% 0,00% Inv = 100% 0,00% 0 0.36% 0,5 0.36 1 11.78% 1,5 11.78 2 40.49% 2,5 40.49 3 100% 3,5 100 4 Percentagem de Investimento da Solução Ótima Identification of different types of investment arcs 385 382 381 377 373 370 369 361 329 311 309 308 300 299 298 258 257 255 254 253 249 246 235 231 76 75 58 41 Percentage of Investment of the optimal solution 17

IN BRAZIL ANALYSIS OF RESULTS (V) Incremental investment analysis (Final solutions) Investment = 1% Investment = 12% 18

IN BRAZIL ANALYSIS OF RESULTS (V) Incremental investment analysis (Final solutions) Investment = 41% Investment = 100% 19

SYNTHESIS OF THE TOPIC (I) Some of the main transport design problems result from the combination or adaptation of some basic NP-hard or NP-complete problems (e.g. Min-cost-flow) All these models use linear programming optimization tools with: Linear Objective Function Linear Constraints Where the decision variables present commonly binary or integer form, which do not have a trivial linear programming solution method But fortunately there are sophisticated algorithms to obtain (quasi) optimal solutions in acceptable time for many of them 20

SYNTHESIS OF THE TOPIC (II) The objective function and constraints of the model should contain the main strategic goals of the decision makers the network design: Coverage all settlements must be accessible Accessibility Travel distances, times, operating costs must be reasonable Public Economy Avoid excessive investment cost Level of Service Low levels of delay Redundancy / Low level of vulnerability Preserve functionality in case of some breakdown Induce efficient and sustainable land-use patterns promote compact settlements, low need for motorized travel 21

SYNTHESIS OF THE TOPIC (III) The consideration of all the goals simultaneously in the optimization process can turn the problem unfeasible or take to long to find n optimal solution, due to the conflict between some of them Some of these goals should be left of the optimization process and assessed after to find out if the obtained solution satisfies all the established goals The result of this evaluation can be a multicriteria process were several optimal solutions are evaluated and the final solution will result from the multicriteria evaluation considering the decision maker s preferences 22