EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2269. Two Level Time Minimizing Transportation Problem
Invited abstract in session TA-55: ML & OR Applications in Transport Modelling, stream Transportation.
Tuesday, 8:30-10:00Room: S02 (building: 101)
Authors (first author is the speaker)
1. | Sonia Singh
|
Decision Sciences, Indian Institute of Management, Lucknow | |
2. | Ankit Khandelwal
|
Senior Director - FICO Scores, FICO |
Abstract
For a given time minimizing transportation problem comprising of m sources and n destinations, the set of m sources is to be optimally partitioned into two mutually disjoint subsets L1 and L2 where, L1 contains m1 sources called Level-I sources and L2 contains the remaining (m − m1) sources termed as Level-II sources. First, the Level-I decision maker sends the shipment from Level-I sources to partially meet the demand of destinations. Later, Level-II decision maker sends the material from the Level-II sources to meet the left over demand of the destinations. A finite number of mixed 0-1 programming problems are solved to judiciously generate a subset of partitions of the set of m sources. The aim of this study is to find an optimal partition of the set of m sources such that the sum of times of transportation in the Level-I and Level-II shipments is the minimum. The proposed algorithm to find the global minimizer has been successfully run on a variety of randomly generated test problems differing in input data.
Keywords
- Transportation
- Global Optimization
- Mathematical Programming
Status: accepted
Back to the list of papers