Detail publikace
Hybrid Algorithm for Network Design Problem with Uncertain Demands
ROUPEC, J. POPELA, P. HRABEC, D. NOVOTNÝ, J. HAUGEN, K. OLSTAD, A.
Anglický název
Hybrid Algorithm for Network Design Problem with Uncertain Demands
Typ
Stať ve sborníku v databázi WoS či Scopus
Jazyk
en
Originální abstrakt
The purpose of the paper is to present a hybrid algorithm to solve a transportation optimization model with random demand parameters and network design variables. At first, the classical deterministic linear transportation model with network design 0-1 variables is introduced. Then, randomness is considered for demand parameters and modeled by here-and-now approach. The obtained scenario-based model leads to a mixed integer linear program (MILP) that can be solved by common integer programming techniques, see e.g. the branch-and-bound algorithm implemented in the CPLEX solver. Such a program may reach solvability limitations of MIP algorithms for large scale real world data, so a suitable heuristic development is welcome. Therefore, the idea of combination of traditional optimization algorithm and genetic algorithm is discussed and developed. At the end, the results are illustrated and also verified for a small test instance by figures.
Klíčová slova anglicky
hybrid algorithm, návrh dopravní sítě, stochastické programování, genetický algoritmus, GAMS
Vydáno
2013-10-23
ISBN
978-988-19252-3-7
ISSN
2078-0958
Kniha
Lecture Notes in Engineering and Computer Science WCECS 2013
Ročník
2013
Číslo
1
Strany od–do
554–559
Počet stran
6
BIBTEX
@inproceedings{BUT103257,
author="Jan {Roupec} and Pavel {Popela} and Dušan {Hrabec} and Jan {Novotný} and Kjetil Kare {Haugen} and Asmund {Olstad}",
title="Hybrid Algorithm for Network Design Problem with Uncertain Demands",
booktitle="Lecture Notes in Engineering and Computer Science WCECS 2013",
year="2013",
series="1",
journal="Lecture Notes in Engineering and Computer Science",
volume="2013",
number="1",
pages="554--559",
isbn="978-988-19252-3-7",
issn="2078-0958"
}