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: A cell-based variant of the Merchant-Nemhauser (M-N) model is proposed for the system optimum (SO) dynamic traffic assignment (DTA) problem and an algorithm is presented to solve the flow holding back problem that is known to exist in many existing SO-DTA models.
Abstract: A cell-based variant of the Merchant–Nemhauser (M-N) model is proposed for the system optimum (SO) dynamic traffic assignment (DTA) problem. Once linearized and augmented with additional constraints to capture cross-cell interactions, the model becomes a linear program that embeds a relaxed cell transmission model (CTM) to propagate traffic. As a result, we show that CTM-type traffic dynamics can be derived from the original M-N model, when the exit-flow function is properly selected and discretized. The proposed cell-based M-N model has a simple constraint structure and cell network representation because all intersections and cells are treated uniformly. Path marginal costs are defined using a recursive formula that involves a subset of multipliers from the linear program. This definition is then employed to interpret the necessary condition, which is a dynamic extension of the Wardrop’s second principle. An algorithm is presented to solve the flow holding back problem that is known to exist in many discrete SO-DTA models. A numerical experiment is conducted to verify the proposed model and algorithm.
53 citations
13 Nov 1997
TL;DR: A minimum cost circulation approach is used to efficiently generate high performance addressing code in polynomial time and results show that memory layout has a small effect on code size and performance when optimal addressing is used.
Abstract: This paper presents a new approach to solving the DSP address assignment problem. A minimum cost circulation approach is used to efficiently generate high performance addressing code in polynomial time. Addressing code size improvements of up to 7 times are obtained, accounting for up to 1.6 times improvement in code size and performance of compiler-generated DSP code. Results also show that memory layout has a small effect on code size and performance when optimal addressing is used. This research is important for industry since this value-added technique can improve code size, power dissipation and performance, without increasing cost.
53 citations
TL;DR: This paper presents a survey on optimization models for this class of scheduling problems and suggests a classification of the various models.
53 citations
TL;DR: Several exact and heuristic methods, including Benders decomposition, using CPLEX, a variable depth neighborhood local search, and two hybrid population-based heuristics are presented and compared computationally.
52 citations
03 May 2010
TL;DR: This paper presents two task-allocation strategies for a multi-robot transportation system based on a centralized planner that uses domain knowledge to solve the assignment problem in linear time and individual robots make rule-based allocation decisions using only locally obtainable information and single value communication.
Abstract: In this paper we present two task-allocation strategies for a multi-robot transportation system. The first strategy is based on a centralized planner that uses domain knowledge to solve the assignment problem in linear time. In contrast in the second strategy, individual robots make rule-based allocation decisions using only locally obtainable information and single value communication. Both methods are tested and analysed in simulation experiments. We show that the rule-based method performs well but the lack of information has to be paid for with increased energy consumption.
52 citations