Topic
Assignment problem
About: Assignment problem is a research topic. Over the lifetime, 7588 publications have been published within this topic receiving 172820 citations. The topic is also known as: marriage problem.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This work attempts to assess the performance of three meta-heuristics, namely, genetic algorithm (GA), tabu search (TS), simulated annealing (SA) and a hybrid approach based on SA and TS.
Abstract: Improper assignment of gates may result in flight delays, inefficient use of the resource, customer's dissatisfaction. A typical metropolitan airport handles hundreds of flights a day. Solving the gate assignment problem (GAP) to optimality is often impractical. Meta-heuristics have recently been proposed to generate good solutions within a reasonable timeframe. In this work, we attempt to assess the performance of three meta-heuristics, namely, genetic algorithm (GA), tabu search (TS), simulated annealing (SA) and a hybrid approach based on SA and TS. Flight data from Incheon International Airport are collected to carry out the computational comparison. Although the literature has documented these algorithms, this work may be a first attempt to evaluate their performance using a set of realistic flight data.
70 citations
••
TL;DR: In this paper, the joint BS association and power allocation problem for a downlink cellular network under the max-min fairness criterion is studied, and a two-stage algorithm is proposed to find a high-quality sub-optimal solution.
Abstract: In a heterogeneous network (HetNet) with a large number of low power base stations (BSs), proper user-BS association and power control is crucial to achieving desirable system performance. In this paper, we systematically study the joint BS association and power allocation problem for a downlink cellular network under the max-min fairness criterion. First, we show that this problem is NP-hard. Second, we show that the upper bound of the optimal value can be easily computed, and propose a two-stage algorithm to find a high-quality suboptimal solution. Simulation results show that the proposed algorithm is near-optimal in the high-SNR regime. Third, we show that the problem under some additional mild assumptions can be solved to global optima in polynomial time by a semi-distributed algorithm. This result is based on a transformation of the original problem to an assignment problem with gains $\log(g_{ij})$, where $\{g_{ij}\}$ are the channel gains.
70 citations
••
TL;DR: In this paper, the ordinary assignment problem on a bipartite graph with weighted arcs is extended to the case where both of the two sets of vertices of the graph are given matroidal structures.
Abstract: The ordinary assignment problem on a bipartite graph with weighted arcs is extended to the case where both of the two sets of vertices of the graph are given matroidal structures, and a practical solution algorithm is presented to this extended problem.
70 citations
••
TL;DR: A novel global harmony search algorithm (NGHS) is used to solve the task assignment problem, and the NGHS algorithm has demonstrated higher efficiency than the improved harmonysearch algorithm (IHS) on finding the near optimal task assignment.
70 citations
••
TL;DR: The present paper presents the practical experience with a real case of Vehicle Scheduling Problem, a classical optimization problem which is faced in the operational planning of public transportation systems, and discusses different algorithmic approaches for it.
70 citations