A genetic algorithm for the generalised assignment problem
From MaRDI portal
Publication:1361390
DOI10.1016/S0305-0548(96)00032-9zbMath0881.90070MaRDI QIDQ1361390
Publication date: 19 February 1998
Published in: Computers \& Operations Research (Search for Journal in Brave)
68T05: Learning and adaptive systems in artificial intelligence
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
Related Items
A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS, Determination of cutoff time for express courier services: a genetic algorithm approach, A tabu search heuristic for the generalized assignment problem, A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study, A dynamic tabu search for large-scale generalized assignment problems, A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs, Elitist genetic algorithm for assignment problem with imprecise goal, A heuristic genetic algorithm for product portfolio planning, A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil, Multiprogramming genetic algorithm for optimization problems with permutation property, Spectral projected subgradient with a momentum term for the Lagrangean dual approach, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, A two-stage model for a day-ahead paratransit planning problem, Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem, Logic cuts for multilevel generalized assignment problems., Effective algorithm and heuristic for the generalized assignment problem., A tabu search approach to the constraint satisfaction problem as a general problem solver, Optimizing cane supply decisions within a sugar mill region, Lagrangean/surrogate relaxation for generalized assignment problems, A genetic algorithm for the vehicle routing problem, A population heuristic for constrained two-dimensional non-guillotine cutting, An evolutionary algorithm approach to the share of choices problem in the product line design, Hybrid genetic algorithm for optimization problems with permutation property, Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network, A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch, Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation, A genetic algorithm for the project assignment problem, Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms, Solving a class of stochastic mixed-integer programs with branch and price, An intelligent genetic algorithm designed for global optimization of multi-minima functions, A path relinking approach with ejection chains for the generalized assignment problem, An ejection chain approach for the generalized assignment problem, On the variable-depth-search heuristic for the linear-cost generalized assignment problem, Very large-scale variable neighborhood search for the generalized assignment problem, GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS
Cites Work
- A survey of algorithms for the generalized assignment problem
- A genetic algorithm for the set covering problem
- A set partitioning heuristic for the generalized assignment problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- A branch and bound algorithm for the generalized assignment problem
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
