• Corpus ID: 3181954

A Two-Phase Path-Relinking Algorithm for the Generalized Assignment Problem

@inproceedings{Alfandari2001ATP,
  title={A Two-Phase Path-Relinking Algorithm for the Generalized Assignment Problem},
  author={Laurent Alfandari and Agn{\`e}s Plateau and Pierre Tolla},
  year={2001},
  url={https://api.semanticscholar.org/CorpusID:3181954}
}
This work has shown that the GAP to optimality problem, which concerns production planning, computer or communication networks, facility location or vehicle routing, is a NP-hard problem.
No Paper Link Available
13 Citations
Highly Influential Citations
1
Background Citations
5
Methods Citations
6

13 Citations

3-B-2 A PATH RELINKING APPROACH FOR THE GENERALIZED ASSIGNMENT PROBLEM

Comparisons show that the proposed algorithm is not only effective in general, but is especially effective for the types D and E instances of the generalized assignment problem, which are known to be quite difficult.

A path relinking approach with ejection chains for the generalized assignment problem

A two-phase path-relinking algorithm for the generalized assignment problem

A two-phase Path-Relinking (PR) heuristic for the NP-hard Generalized Assignment Problem that combines LP-solving, cuts and local search for obtaining a population of solutions with guided diversity.

Using an enhanced integer NSGA-II for solving the multiobjective Generalized Assignment Problem

The results obtained using the integer enhanced version of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) algorithm show that it is possible to find solutions which are very close to the exact optimum of the single objective problem.

Recent metaheuristic algorithms for the generalized assignment problem

The algorithms use the ejection chain approach, which is embedded in a neighborhood construction to create more complex and powerful moves, and incorporate an automatic mechanism for adjusting search parameters, to maintain a balance between visits to the feasible and infeasible regions.

Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization

To solve MMRACP efficiently, forward activity list (FAL), a schedule generation scheme, is proposed and Modified particle swarm optimization (MPSO), which combines the advantages of particle Swarm optimization and scatter search, is suggested to make the search for the best solution efficient.

Bees algorithm for generalized assignment problem

A constraint-based, efficiency optimisation approach to network-level pavement maintenance management

A novel modelling to solve the network-level pavement maintenance programming problem efficiently is proposed, which is modelled as a generalised assignment problem, whose resolution is well documented in the literature on optimisation.

Plateau Connection Structure and multiobjective metaheuristic performance

The plateau structure imposed by the Pareto dominance relation is proposed as a useful determinant of multiobjective metaheuristic performance and a number of techniques are proposed to allow this method to be used with larger, real-world problems.

Multiobjective Landscape Analysis and the Generalized Assignment Problem

This paper provides a somewhat high-level overview of multiobjective search space and fitness landscape analysis and examines the impact of these features on the multiobjectives generalized assignment problem.

11 References

A set partitioning heuristic for the generalized assignment problem

A survey of algorithms for the generalized assignment problem

Tabu search for the multilevel generalized assignment problem

A branch and bound algorithm for the generalized assignment problem

A branch and bound algorithm is developed that solves the generalized assignment problem by solving a series of binary knapsack problems to determine the bounds.

A multiplier adjustment method for the generalized assignment problem

A branch and bound algorithm for the generalized assignment problem in which bounds are obtained from a Lagrangian relaxation with the multiplier adjustment method appears to be about one order of magnitude faster than the best previously existing algorithms for this problem.

Linear Assignment Problems

A genetic algorithm for the generalised assignment problem

Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches

The effectiveness of the approaches is established by comparing their performance in terms of solution quality and computional requirement to other specialized branch-and-bound tree search, simulated annealing and set partitioning heuristics on a set of standard problems from the literature.

Knapsack Problems: Algorithms and Computer Implementations

This paper focuses on the part of the knapsack problem where the problem of bin packing is concerned and investigates the role of computer codes in the solution of this problem.

On the Implementation of a Primal-Dual Interior Point Method

A Taylor polynomial of second order is used to approximate a primal-dual trajectory and an adaptive heuristic for estimating the centering parameter is given, which treats primal and dual problems symmetrically.