2012
DOI: 10.1016/j.amc.2011.12.025
|View full text |Cite
|
Sign up to set email alerts
|

The equilibrium generalized assignment problem and genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0
1

Year Published

2014
2014
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 34 publications
0
6
0
1
Order By: Relevance
“…When comparing between all the proposed methods, ALNS-2, while using Equation (9) as the acceptance criteria, performs significantly better than the other proposed methods. Equation (9) is the combination of Equations (8) and (10). The advantages of Equations (8) and (10) make it the best proposed method.…”
Section: Computation Framework and Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…When comparing between all the proposed methods, ALNS-2, while using Equation (9) as the acceptance criteria, performs significantly better than the other proposed methods. Equation (9) is the combination of Equations (8) and (10). The advantages of Equations (8) and (10) make it the best proposed method.…”
Section: Computation Framework and Resultsmentioning
confidence: 99%
“…The heuristic and meta-heuristic methods that are available in a variety of ways are widely used to meet various challenges, such as the generalized assignment problem [8], scheduling shipments [9], problems in assigning general work [10], problems concerning assignments and job allocations [11], and problems concerning multi-stage and multi-purpose assignments [12]. Ross [13] first presented problems that are related to general assignments (GAPs), who found that they were difficult problems with NP-hard levels [14].…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Branch-and-price algorithm [25], cutting plane algorithm [1], branch-and-cut algorithm [18], branch-andbound [11] have been the significant ones of them in the last two decades. The existing exact algorithms are not effective for more difficult large-scale problems [15].…”
Section: The Generalized Assignment Problemmentioning
confidence: 99%
“…In developing the methodology to solve the VRP and GAP problem, many methods have been proposed, such as Simulated Annealing (Osman 1995), Tabu search (Laguna et al 1995;Dıaz and Fernández 2001), BEE algorithm (Özbakir et al 2010), the evolutionary algorithm (Weise et al 2010), and the genetics algorithm (Liu et al 2012). Recently, the differential evolution (DE) algorithms have been successfully applied to solve VRP, GAP, and other combinatorial optimization problems.…”
Section: Introductionmentioning
confidence: 99%