The Recent Advances in Combinatorial Optimization and Its Applications

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Computational and Applied Mathematics".

Deadline for manuscript submissions: 15 June 2024 | Viewed by 1235

Special Issue Editor


E-Mail Website
Guest Editor
eLearning Department, Institute for Computer Science and Control, Budapest, Hungary
Interests: optimization
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

In recent years, the combinatorial optimization problem (COP) has impacted various fields such as industry, transportation, telecommunication, national defense, bioinformatics, finance and life (see Special Issue "Combinatorial Optimization Problems in Planning and Decision Making"). Moreover, traditional operational research methods are primarily used to solve combinatorial optimization problems. However, with the increasing difficulty of practical applications and the increasing demands for real-time optimization, a limitation of the traditional operation optimization algorithm is becoming increasingly serious. Many new methods using deep reinforcement learning have recently emerged to solve combinatorial optimization problems, which have the advantages of fast solving speed and strong model generalization ability, and provide a new way of thinking for solving combinatorial optimization problems.

This Special Issue will focus on the recent theoretical studies and methods used to solve combinatorial optimization problems. Topics include, but are not limited to, the following:

  • combinatorial optimization;
  • multi-objective combinatorial optimization;
  • optimization;
  • optimization in multimedia systems;
  • stochastic algorithms for combinatorial optimization;
  • metaheuristics for combinatorial optimization.

Dr. Tibor Szkaliczki
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • combinatorial optimization
  • multi-objective combinatorial optimization
  • optimization
  • optimization in multimedia systems
  • stochastic algorithms for combinatorial optimization
  • metaheuristics for combinatorial optimization
  • graph optimization problems
  • matroid optimization problems
  • set cover problem
  • scheduling
  • VLSI routing
  • knapsack problem
  • bin packing
  • computational compexity of optimization problems
  • approximation algorithms

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

29 pages, 8328 KiB  
Article
Assessing the Compatibility of Railway Station Layouts and Mixed Heterogeneous Traffic Patterns by Optimization-Based Capacity Estimation
by Zhengwen Liao and Ce Mu
Mathematics 2023, 11(17), 3727; https://doi.org/10.3390/math11173727 - 30 Aug 2023
Viewed by 869
Abstract
The operations performance of a railway station depends on the compatibility of its layout and the traffic pattern. It is necessary to determining an adaptable station layout for a railway station in accordance with its complex traffic pattern during the design phase. This [...] Read more.
The operations performance of a railway station depends on the compatibility of its layout and the traffic pattern. It is necessary to determining an adaptable station layout for a railway station in accordance with its complex traffic pattern during the design phase. This paper assesses the railway station layout from a capacity perspective. In particular, this paper addresses an optimization-based capacity estimation approach for the layout variants of a railway station (i.e., the number of siding tracks and the structure of the connections in between) considering the traffic pattern variants. A mixed integer programming model for microscopic timetable compression is applied to calculate the occupation rate of the given traffic pattern with flexible route choices and train orders. A novel “schedule-and-fix” heuristic algorithm is proposed to solve large-scale instances efficiently. In the case study, we evaluate the performance of the schedule-and-fix method compared with the benchmark solvers Gurobi and CP-SAT. Applying the proposed method, we compare the capacity performances of the two station design schemes, i.e., one with a flyover and the other without. The result shows that, for the given instance, building a flyover gains capacity benefits as it reduces the potential conflict in the throat area. However, the level of benefit depends on the combination of trains. It is necessary to build the flyover when the proportion of turn-around trains is more than 70% from the perspective of station capacity. Full article
Show Figures

Figure 1

Back to TopTop