Advertisement

On a Polynomially Solvable Subclass of the Clique Problem with Applications in Energy-Efficient Timetabling

  • Patrick GemanderEmail author
Conference paper
Part of the Operations Research Proceedings book series (ORP)

Abstract

The clique problem under multiple-choice constraints is an \({\mathcal {N}\mathcal {P}}\)-hard variant of the general clique problem, which incorporates a structure commonly found in real-world applications like underground, railway or runway scheduling. It is relevant whenever there is a set of decisions with discrete options for each decision and possible conflicts between options. In this article, we identify a polynomial-time solvable subclass and determine its complete convex hull using graph-theoretic arguments related to perfect graphs. Since the convex hull can have exponentially many facets, we present criteria on how to more efficiently find the stable sets required to describe the convex hull as well as a polynomial-time separation algorithm. Finally, the theoretical results were successfully applied to energy-efficient underground and railway scheduling.

Keywords

Clique problem Perfect graphs Convex hull Scheduling 

References

  1. 1.
    Avella, P., Boccia, M., Mannino, C., Vasilyev, I.: Valid inequalities for time-indexed formulations of the runway scheduling problem. In: CEUR Workshop Proceedings (2016)Google Scholar
  2. 2.
    Bärmann, A., Gellermann, T., Merkert, M., Schneider, O.: Staircase Compatibility and its Applications in Scheduling and Piecewise Linearization. Tech. Report (2016). http://www.optimization-online.org/DB_HTML/2018/01/6435.html
  3. 3.
    Bärmann, A., Martin, A., Schneider, O.: A comparison of performance metrics for balancing the power consumption of trains in a railway network by slight timetable adaptation. Public Transp. 1–19 (2017)Google Scholar
  4. 4.
    Bärmann, A., Gemander, P., Merkert, M.: The Clique Problem with Multiple-Choice Constraints under a Cycle-Free Dependency Graph. Tech. Report (2018). http://www.optimization-online.org/DB_HTML/2018/01/6436.html
  5. 5.
    Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164(1), 51–229 (2006) http://www.jstor.org/stable/20159988 MathSciNetCrossRefGoogle Scholar
  6. 6.
    Gemander, P.: The Clique-Problem under Multiple-Choice Constraints with Cycle-Free Dependency Graphs – Structural Investigation and Application to Subway Timetabling. Master’s Thesis. FAU Erlangen-Nürnberg, Erlangen (2017)Google Scholar
  7. 7.
    Sansó, B., Girard, P.: Instantaneous power peak reduction and train scheduling desynchronization in subway systems. Transplant. Sci. 31(4), 312–323 (1997)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.FAU Erlangen-NürnbergErlangenGermany

Personalised recommendations