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
IBM1
TL;DR: The AP-based lower bound on the optimal solution to ATSP is tightened by using some of the procedures given in [1]; a local search for improving the initial FSO is performed; it uses 3- and 4-changed based procedures.
126 citations
03 Jan 2001
TL;DR: This work designs a simple tabu search meta-heuristic that exploits the special properties of different types of neighborhood moves, and creates highly effective candidate list strategies to solve an airport gate assignment problem that dynamically assigns airport gates to scheduled flights.
Abstract: Considers an airport gate assignment problem that dynamically assigns airport gates to scheduled flights based on passengers' daily origin and destination flow data. The objective of the problem is to minimize the overall connection times during which passengers walk to catch their connection flights. We formulate this problem as a mixed 0-1 quadratic integer programming problem and then reformulate it as a mixed 0-1 integer problem with a linear objective function and constraints. We design a simple tabu search meta-heuristic to solve the problem. The algorithm exploits the special properties of different types of neighborhood moves, and create highly effective candidate list strategies. We also address issues of tabu short-term memory, dynamic tabu tenure, aspiration rules, and various intensification and diversification strategies. Preliminary computational experiments are conducted, and the results are presented and analyzed.
126 citations
TL;DR: The resource allocation problem is investigated for relay-based multi-user cooperative Orthogonal Frequency Division Multiple Access (OFDMA) uplink system, considering heterogeneous services and a quality of service aware optimal relay selection, power allocation and subcarrier assignment scheme under a total power constraint is proposed.
Abstract: The resource allocation problem is investigated for relay-based multi-user cooperative Orthogonal Frequency Division Multiple Access (OFDMA) uplink system, considering heterogeneous services. A quality of service (QoS) aware optimal relay selection, power allocation and subcarrier assignment scheme under a total power constraint is proposed. The relay selection, power allocation and subcarrier assignment problem is formulated as a joint optimization problem with the objective of maximizing the system throughput, which is solved by means of a two level dual decomposition and subgradient method. To further reduce the computational cost, two low-complexity suboptimal schemes are also proposed. The performance of the proposed schemes is demonstrated through computer simulations based on LTE-A network. Numerical results show that the proposed schemes support heterogeneous services while guaranteeing each user's QoS requirements with slight total system throughput degradation.
125 citations
TL;DR: A general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem is developed, which is based on the identification of objective efficiency ranges, and is an improvement over classical e-constraint method.
125 citations
TL;DR: Using the Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), the DPAP is decomposed into a set of scalar subproblems that are classified based on their objective preference and tackled in parallel by using neighborhood information and problem-specific evolutionary operators, in a single run.
125 citations