FYI: Short Course on “Mathematical Models of Transportation Systems and Networks” organized by Dept. of Industrial and Systems Engineering, KAIST. You need to bring your laptop to learn the programming in Julia.

Industrial and Management Systems Engineering, University of South Florida

2016/7/6 10am-12am, 1:30pm-3:30pm

(Room 1501 of Bldg. E2)

1. Basic Topics in Network Optimization

– Shortest Path Problem

– Minimum Cost Network Flow

– Transportation Problem

– Multi-Commodity Network Flow

– Intro to Julia and JuMP

2. Risk-Averse Routing

– Robust Shortest Path Problem

* Scenario-based

* Interval data

* Polyhedral uncertainty set

* Two multiplicative coefficients

* Julia: RobustShortestPath.jl

– Value-at-Risk

– Conditional Value-at-Risk

– Worst-case Conditional Value-at-Risk

3. Vehicle Routing Problem

– Traveling Salesman Problem

– Subtour Elimination

– Vehicle Routing Problem

– VRP with Time Windows

– Green VRP / Electric-VRP

– Energy Minimizing VRP

– Medical-Waste Collection VRP

– Bike-Balancing VRP

4. Network User Equilibrium

– System Optimum

– User Equilibrium

* Complementarity Problem

* Variational Inequality Problem

– Computation

* Frank-Wolfe Algorithm

* Julia: VariationalInequality.jl

* Julia: Complementarity.jl

* Julia: TrafficAssignment.jl

– Stochastic User Equilibrium

– Braess Paradox

– Price of Anarchy

5. Network Regulation

– Bilevel Optimization

– Road Pricing

– Network Design

– Inverse Optimization for Road Pricing

– Single-level Reformulation

– Leader-Follower Game

6. Location Problems

– Classic Location Problems

* p-median

* p-center

* set-covering

* maximal covering

* fixed-charge facility location

* two-stage problem

– Hub Location Problems

* p-hub center

* hub-covering

* p-hub median

– Lagrangian Relaxation

– Flow-Capturing Location Problem

– Flow-Refueling Location Problem

– Infrastructure Planning for Electric Vehicles

7. Generalized Bounded Rationality

– Satisficing Behavior

– Perception-Error

– Equivalence

– Comparison with Random-Utility Model

– Monte-Carlo Method

– Julia: PathDistribution.jl

– Application in Robust Network Design

Tags: 권창현