2009
DOI: 10.1016/j.cor.2008.04.010
|View full text |Cite
|
Sign up to set email alerts
|

Order acceptance using genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
48
0
1

Year Published

2011
2011
2019
2019

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 111 publications
(49 citation statements)
references
References 69 publications
0
48
0
1
Order By: Relevance
“…Slotnick and Morton (2007) formulated the problem of OA decision as an integer program which performs both sequencing and order acceptance jointly. The same problem is later solved by Rom and Slotnick (2009) using genetic algorithm to improve the performance for large size problems. Fabrice and Roel (2011) devised two exact branch-and-bound algorithms to decide the potential orders to retain from the subset of orders for profit maximization.…”
Section: Related Researchmentioning
confidence: 99%
“…Slotnick and Morton (2007) formulated the problem of OA decision as an integer program which performs both sequencing and order acceptance jointly. The same problem is later solved by Rom and Slotnick (2009) using genetic algorithm to improve the performance for large size problems. Fabrice and Roel (2011) devised two exact branch-and-bound algorithms to decide the potential orders to retain from the subset of orders for profit maximization.…”
Section: Related Researchmentioning
confidence: 99%
“…They state that the joint approach is far superior to the first. Rom and Slotnick [15] also propose a GA to solve the order acceptance problem with tardiness penalties.…”
Section: Order Acceptance With Static Arrivalsmentioning
confidence: 99%
“…The literature on order acceptance has grown rapidly over the past decade (Slotnick & Morton, 2007). Thus, researchers have attempted to find an optimum system to either accept or reject orders using multitudes of techniques such as Dynamic Programming (Alidaee et al, 2001;Lewis & Slotnick, 2002;Herbots et al, 2007), Mathematics Programming (Guerrero & Kern, 1990;Slotnick & Morton, 1996;Slotnick & Morton, 2007), Simulation (Ten kate, 1994;Ten kate, 1995;Nandi & Rogers, 2003;Nandi & Rogers, 2004;Ebben et al, 2005), Decision theory (Balakrishnan et al,1996;Balakrishnan et al,1999), Heuristics (Ghosh, 1997;Defregger & Kuhn, 2004;Hing et al, 2007), Genetic algorithm (Roundy et al, 2005;Rom & Slotnick, 2009), Neural networks Hing et al, 2002), Neuro-genetics (Snoek, 2000), Markov decision (Kniker & Burman, 2001) etc. References Slotnick and Morton (2007), Ghosh (1997), Jalora (2006) and Ivanescu (2004) provide more detailed information.…”
Section: Introductionmentioning
confidence: 99%