Publication detail

Hybrid Algorithm for Wait-and-See Transportation Network Design Problem with Linear Pricing

HRABEC, D. POPELA, P. ROUPEC, J. JINDRA, P. NOVOTNÝ, J.

Original Title

Hybrid Algorithm for Wait-and-See Transportation Network Design Problem with Linear Pricing

English Title

Hybrid Algorithm for Wait-and-See Transportation Network Design Problem with Linear Pricing

Type

journal article in Scopus

Language

en

Original Abstract

The aim of the paper is to introduce a modified hybrid algorithm to solve a wait-and-see reformulation of transportation optimization model including linear pricing with random demand parameters and 0-1 network design variables. We model the linearly price-dependent stochastic demand and the uncertain demand parameters are introduced and modeled by random variables. Our formulated scenario-based model can be repeatedly solved as a finite set of mixed integer linear programs by means of integer programming techniques or some heuristics. However, the authors combine a traditional optimization algorithm and a suitable genetic algorithm to obtain a hybrid algorithm that is modified for the WS case. Its implementation and test results are illustrated by network and function graphs, which are also discussed and concluded in the paper.

English abstract

The aim of the paper is to introduce a modified hybrid algorithm to solve a wait-and-see reformulation of transportation optimization model including linear pricing with random demand parameters and 0-1 network design variables. We model the linearly price-dependent stochastic demand and the uncertain demand parameters are introduced and modeled by random variables. Our formulated scenario-based model can be repeatedly solved as a finite set of mixed integer linear programs by means of integer programming techniques or some heuristics. However, the authors combine a traditional optimization algorithm and a suitable genetic algorithm to obtain a hybrid algorithm that is modified for the WS case. Its implementation and test results are illustrated by network and function graphs, which are also discussed and concluded in the paper.

Keywords

transportation network-design problem, pricing, stochastic programming, wait-and-see approach, genetic algorithm, hybrid algorithm

RIV year

2015

Released

08.07.2015

Publisher

VUT

Location

Brno

ISBN

978-3-319-19823-1

Book

21st International Conference of Soft Computing, MENDEL 2015

Pages from

183

Pages to

188

Pages count

6

Documents

BibTex


@article{BUT115227,
  author="Dušan {Hrabec} and Pavel {Popela} and Jan {Roupec} and Petr {Jindra} and Jan {Novotný}",
  title="Hybrid Algorithm for Wait-and-See Transportation Network Design Problem with Linear Pricing",
  annote="The aim of the paper is to introduce a modified hybrid algorithm to solve a wait-and-see reformulation of transportation optimization model including linear pricing with random demand parameters and 0-1 network design variables. We model the linearly price-dependent stochastic demand and the uncertain demand parameters are introduced and modeled by random variables. Our formulated scenario-based model can be repeatedly solved as a finite set of mixed integer linear programs by means of integer programming techniques or some heuristics. However, the authors combine a traditional optimization algorithm and a suitable genetic algorithm to obtain a hybrid algorithm that is modified for the WS case. Its implementation and test results are illustrated by network and function graphs, which are also discussed and concluded in the paper.",
  address="VUT",
  booktitle="21st International Conference of Soft Computing, MENDEL 2015",
  chapter="115227",
  howpublished="print",
  institution="VUT",
  number="1",
  volume="2015",
  year="2015",
  month="july",
  pages="183--188",
  publisher="VUT",
  type="journal article in Scopus"
}