Transactions on Transport Sciences 2012, 5(2):71-82 | DOI: 10.2478/v10158-012-0009-0

Methods for Solving Discrete Optimization Problems

D. Mocková*
Department of Logistic and Transportation Processes, Czech Technical University of Prague, Czech Republic

The article specifies a group of discrete optimization problems, such as location problems and tour problems, from the aspect of individual approaches (exact, heuristic, and metaheuristic) and seeks to explain all the approaches on specific problems.

Keywords: Discrete optimization problems, heuristics, metaheuristics, P-median problem, P-hub median problem, genetic algorithms.

Published: June 1, 2012  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Mocková, D. (2012). Methods for Solving Discrete Optimization Problems. Transactions on Transport Sciences5(2), 71-82. doi: 10.2478/v10158-012-0009-0
Download citation

References

  1. Janáček, J., 2002. Optimalizace na dopravních sítích. Žilina: Žilinská universita v Žilině. ISBN 80-8070-031-1. (in Czech)
  2. Janoš, V., Baudyš, K., Vichta, F., 2006. Financing the Public Transport in the Sphere of Regulated Competion. In Proceedings Conference Euro Traffic 2006. Praha (Czech Republic): ABF, a.s. ISBN 80-86905-15-2.
  3. Lánská, M., 2006. Costs in Bus Transportation. In Aktuálně problem v podnikání v cestnej doprave. Žilina: Technical University of Žilina. ISBN 80-8070-610-7.
  4. Campbell, A. M., Lowe, T. J., Zhang, L., 2005. The p-hub center allocation problem. European Journal of Operational Research. ISSN 0377-2217.

This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.