A modified artificial bee colony algorithm for order acceptance in two-machine flow shops

被引：57

作者：

Wang, Xiuli ^{[1
]}

Xie, Xingzi ^{[1
]}

Cheng, T. C. E. ^{[2
]}

机构：

[1] Nanjing Univ Sci & Technol, Sch Econ & Management, Nanjing 210094, Jiangsu, Peoples R China

[2] Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China

来源：

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2013年 / 141卷 / 01期

基金：

中国国家自然科学基金;

关键词：

Scheduling; Order acceptance; Artificial bee colony algorithm; Revenue; VEHICLE-ROUTING PROBLEM; MINIMIZING TOTAL TARDINESS; HEAVILY LOADED SHOP; WEIGHTED TARDINESS; GENETIC ALGORITHM; ABC ALGORITHM; JOB SELECTION; TABU SEARCH; OPTIMIZATION;

D O I：

10.1016/j.ijpe.2012.06.003

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We consider a two-stage make-to-order production system characterized by limited production capacity and tight order due dates. We want to make joint decisions on order acceptance and scheduling to maximize the total net revenue. The problem is computationally intractable. In view of the fact that artificial bee colony algorithm has been shown to be an effective evolutionary algorithm to handle combinatorial optimization problems, we first conduct a pilot study of applying the basic artificial bee colony algorithm to treat our problem. Based on the results of the pilot study and the problem characteristics, we develop a modified artificial bee colony algorithm. The experimental results show that the modified artificial bee colony algorithm is able to generate good solutions for large-scale problem instances. (c) 2012 Elsevier B.V. All rights reserved.

引用

页码：14 / 23

页数：10

共 29 条

[1] Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem [J].

Ai, The Jin ;

Kachitvichyanukul, Voratas .

COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (01) :380-387

[2] A new hybrid genetic algorithm for the capacitated vehicle routing problem [J].

Berger, J ;

Barkaoui, M .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (12) :1254-1262

[3] A tabu search algorithm for order acceptance and scheduling [J].

Cesaret, Bahriye ;

Oguz, Ceyda ;

Salman, F. Sibel .

COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (06) :1197-1205

[4] A modified artificial bee colony algorithm [J].

Gao, Wei-feng ;

Liu, San-yang .

COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) :687-697

[5] Job selection in a heavily loaded shop [J].

Ghosh, JB .

COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (02) :141-145

[6] Structural inverse analysis by hybrid simplex artificial bee colony algorithms [J].

Kang, Fei ;

Li, Junjie ;

Xu, Qing .

COMPUTERS & STRUCTURES, 2009, 87 (13-14) :861-870

[7] On the performance of artificial bee colony (ABC) algorithm [J].

Karaboga, D. ;

Basturk, B. .

Applied Soft Computing Journal, 2008, 8 (01) :687-697

[8]

Karaboga D., 2005, IDEA BASED HONEY BEE

[9] A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm [J].

Karaboga, Dervis ;

Basturk, Bahriye .

JOURNAL OF GLOBAL OPTIMIZATION, 2007, 39 (03) :459-471

[10] A comparative study of Artificial Bee Colony algorithm [J].

Karaboga, Dervis ;

Akay, Bahriye .

APPLIED MATHEMATICS AND COMPUTATION, 2009, 214 (01) :108-132

← 1 2 3 →