Hybrid Algorithm for Network Design Problem with Uncertain Demands

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F13%3APU106182" target="_blank" >RIV/00216305:26210/13:PU106182 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Hybrid Algorithm for Network Design Problem with Uncertain Demands
Original language description
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.
Czech name
—
Czech description
—

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Lecture Notes in Engineering and Computer Science WCECS 2013
ISBN
978-988-19252-3-7
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
554-559
Publisher name
Neuveden
Place of publication
Neuveden
Event location
San Francisco
Event date
Oct 23, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000335870200105

Similar results(10)