A genetic algorithm for the generalised assignment problem

DOI10.1016/S0305-0548(96)00032-9zbMATH Open0881.90070OpenAlexW1993062444MaRDI QIDQ1361390FDOQ1361390

Authors: O. Diekmann 

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

Recommendations

• A genetic algorithm for the generalised assignment problem
• Solving the generalized assignment problem: an optimizing and heuristic approach
• A survey of algorithms for the generalized assignment problem
• scientific article; zbMATH DE number 1960697
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches

zbMATH Keywords

heuristicgenetic algorithmgeneralised assignmentnear optimal solutions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• A survey of algorithms for the generalized assignment problem
• Title not available (Why is that?)
• A genetic algorithm for the set covering problem
• A branch and bound algorithm for the generalized assignment problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Title not available (Why is that?)
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Title not available (Why is that?)
• A set partitioning heuristic for the generalized assignment problem
• Title not available (Why is that?)
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem

Cited In (89)

• On the variable-depth-search heuristic for the linear-cost generalized assignment problem
• Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity
• Robust optimization for non-linear impact of data variation
• Expert judgments in the cost-effectiveness analysis of resource allocations: a case study in military planning
• Exact solution methods for a generalized assignment problem with location/allocation considerations
• GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS
• Two stage decision making approach for Sensor Mission Assignment Problem
• A genetic-based framework for solving (multi-criteria) weighted matching problems.
• Ranking based selection genetic algorithm for capacity flow assignments
• An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
• A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
• Determination of cutoff time for express courier services: a genetic algorithm approach
• Component allocation cost minimization for a multistate computer network subject to a reliability threshold using tabu search
• Enriching Solutions to Combinatorial Problems via Solution Engineering
• A Genetic Algorithm Approach to the Artillery Target Assignment Problem
• Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining
• Determine the optimal carrier selection for a logistics network based on multi-commodity reliability criterion
• Review on nature-inspired algorithms
• The use of dynamic programming in genetic algorithms for permutation problems
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• Optimizing cane supply decisions within a sugar mill region
• A path relinking approach with ejection chains for the generalized assignment problem
• Transmission network expansion planning considering phase-shifter transformers
• Solving a multistage partial inspection problem using genetic algorithms
• A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
• The equilibrium generalized assignment problem and genetic algorithm
• An alternative approach for unbalanced assignment problem via genetic algorithm
• Elitist genetic algorithm for assignment problem with imprecise goal
• Solving a class of stochastic mixed-integer programs with branch and price
• Heuristic genetic algorithms for general capacitated lot-sizing problems
• Two heuristic solution concepts for the vehicle selection problem in line haul transports
• Multiprogramming genetic algorithm for optimization problems with permutation property
• Solving the assignment problem using genetic algorithm and simulated annealing
• A genetic algorithm for the vehicle routing problem
• A Survey of the Generalized Assignment Problem and Its Applications
• Spectral projected subgradient with a momentum term for the Lagrangean dual approach
• A two-stage model for a day-ahead paratransit planning problem
• A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs
• Diversity controlling genetic algorithm for order acceptance and scheduling problem
• Optimal resource assignment to maximize multistate network reliability for a computer network
• A tabu search approach to the constraint satisfaction problem as a general problem solver
• Win-win match using a genetic algorithm
• Elitist genetic algorithm approach for assignment problem
• Genetic algorithm approach for solving the task assignment problem
• Lagrangean/surrogate relaxation for generalized assignment problems
• A tabu search heuristic for the generalized assignment problem
• Improved Lagrangian bounds and heuristics for the generalized assignment problem
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• Multi-neighborhood local search optimization for machine reassignment problem
• A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS
• Hybrid genetic algorithm for optimization problems with permutation property
• A genetic algorithm-based approach to machine assignment problem
• Solving an assignment-selection problem with verbal information and using genetic algorithms
• A genetic algorithm for the project assignment problem
• Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network
• A population heuristic for constrained two-dimensional non-guillotine cutting
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
• Multistate components assignment problem with optimal network reliability subject to assignment budget
• A heuristic genetic algorithm for product portfolio planning
• Competence-based assignment of tasks to workers in factories with demand-driven manufacturing
• Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms
• A computational study of exact knapsack separation for the generalized assignment problem
• Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
• Very large-scale variable neighborhood search for the generalized assignment problem
• Valuated matroid-based algorithm for submodular welfare problem
• A dynamic tabu search for large-scale generalized assignment problems
• Exploring further advantages in an alternative formulation for the set covering problem
• Bees algorithm for generalized assignment problem
• Assignment problems with changeover cost
• An ejection chain approach for the generalized assignment problem
• Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget
• A randomized heuristics for the mapping problem: The genetic approach
• An intelligent genetic algorithm designed for global optimization of multi-minima functions
• Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
• Logic cuts for multilevel generalized assignment problems.
• Effective algorithm and heuristic for the generalized assignment problem.
• Title not available (Why is that?)
• Hybrid genetic algorithms for bin-packing and related problems
• Convergence of the surrogate Lagrangian relaxation method
• Population size modeling for GA in time-critical task scheduling
• An evolutionary algorithm approach to the share of choices problem in the product line design
• A new extended formulation of the generalized assignment problem and some associated valid inequalities
• A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study
• Solving assignment problem based on a mixed algorithm
• A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search
• Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
• Reliable intermodal freight network expansion with demand uncertainties and network disruptions
• On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch
• Title not available (Why is that?)

This page was built for publication: A genetic algorithm for the generalised assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361390)