A genetic algorithm for the generalised assignment problem
From MaRDI portal
Publication:1361390
DOI10.1016/S0305-0548(96)00032-9zbMath0881.90070OpenAlexW1993062444MaRDI QIDQ1361390
Publication date: 19 February 1998
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00032-9
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (72)
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 ⋮ An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion ⋮ A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs ⋮ 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 ⋮ Elitist genetic algorithm for assignment problem with imprecise goal ⋮ A heuristic genetic algorithm for product portfolio planning ⋮ Multi-neighborhood local search optimization for machine reassignment problem ⋮ Robust optimization for non-linear impact of data variation ⋮ A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS ⋮ 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 ⋮ Win-win match using a genetic algorithm ⋮ Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity ⋮ Two stage decision making approach for Sensor Mission Assignment Problem ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining ⋮ On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch ⋮ The equilibrium generalized assignment problem and genetic algorithm ⋮ Logic cuts for multilevel generalized assignment problems. ⋮ Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget ⋮ Two heuristic solution concepts for the vehicle selection problem in line haul transports ⋮ Effective algorithm and heuristic for the generalized assignment problem. ⋮ Diversity controlling genetic algorithm for order acceptance and scheduling problem ⋮ Enriching Solutions to Combinatorial Problems via Solution Engineering ⋮ Expert judgments in the cost-effectiveness analysis of resource allocations: a case study in military planning ⋮ POPULATION SIZE MODELING FOR GA IN TIME-CRITICAL TASK SCHEDULING ⋮ Valuated matroid-based algorithm for submodular welfare problem ⋮ Review on nature-inspired algorithms ⋮ Improved Lagrangian bounds and heuristics for the generalized assignment problem ⋮ Reliable intermodal freight network expansion with demand uncertainties and network disruptions ⋮ On the variable-depth-search heuristic for the linear-cost generalized assignment problem ⋮ Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation ⋮ Transmission network expansion planning considering phase-shifter transformers ⋮ A computational study of exact knapsack separation for the generalized assignment problem ⋮ A genetic algorithm for the project assignment problem ⋮ Convergence of the surrogate Lagrangian relaxation method ⋮ A new extended formulation of the generalized assignment problem and some associated valid inequalities ⋮ A tabu search heuristic for the generalized assignment problem ⋮ Multistate components assignment problem with optimal network reliability subject to assignment budget ⋮ Bees algorithm for generalized assignment problem ⋮ Assignment problems with changeover cost ⋮ 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 ⋮ Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network ⋮ Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms ⋮ Determination of cutoff time for express courier services: a genetic algorithm approach ⋮ Solving a class of stochastic mixed-integer programs with branch and price ⋮ Very large-scale variable neighborhood search for the generalized assignment problem ⋮ Optimal resource assignment to maximize multistate network reliability for a computer network ⋮ A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem ⋮ An intelligent genetic algorithm designed for global optimization of multi-minima functions ⋮ Component allocation cost minimization for a multistate computer network subject to a reliability threshold using tabu search ⋮ Competence-based assignment of tasks to workers in factories with demand-driven manufacturing ⋮ Optimizing cane supply decisions within a sugar mill region ⋮ A two-stage model for a day-ahead paratransit planning problem ⋮ Lagrangean/surrogate relaxation for generalized assignment problems ⋮ GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS ⋮ Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations ⋮ Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem ⋮ Exploring further advantages in an alternative formulation for the set covering problem ⋮ A path relinking approach with ejection chains for the generalized assignment problem ⋮ An ejection chain approach for the generalized assignment problem ⋮ Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem ⋮ Determine the optimal carrier selection for a logistics network based on multi-commodity reliability criterion ⋮ A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations ⋮ A tabu search approach to the constraint satisfaction problem as a general problem solver ⋮ A genetic algorithm for the vehicle routing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: A genetic algorithm for the generalised assignment problem
