2014
DOI: 10.1007/s00170-014-6068-0
|View full text |Cite
|
Sign up to set email alerts
|

A novel memetic ant colony optimization-based heuristic algorithm for solving the assembly line part feeding problem

Abstract: In recent years, part feeding at assembly lines has become a critical issue as the result of a high level of product customization. The assembly line part feeding problem is a complex problem in which a number of decisions should be made in order to select the right quantity of each part to be supplied at the right time under a set of constraints. This study aims to cope with the part feeding problem at assembly lines by introducing a new memetic ant colony optimization-based heuristic algorithm. Due to the no… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
22
0
1

Year Published

2015
2015
2020
2020

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 35 publications
(23 citation statements)
references
References 47 publications
(55 reference statements)
0
22
0
1
Order By: Relevance
“…The problem was an extension of Fathi, Alvarez, and Rodríguez (2014b), which is based on the problem faced by VW-Navarra. The ALPFP consists of two sub-problems, namely tour scheduling and tow-train loading problems.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…The problem was an extension of Fathi, Alvarez, and Rodríguez (2014b), which is based on the problem faced by VW-Navarra. The ALPFP consists of two sub-problems, namely tour scheduling and tow-train loading problems.…”
Section: Discussionmentioning
confidence: 99%
“…The original problem was solved using a simulated annealing algorithm and the results compared favourably to those obtained by CPLEX. A first extension to this problem was studied in Fathi, Alvarez, and Rodríguez (2014b) by also considering a constraint on tour delivery time. A memetic ant colony-based heuristic algorithm (MACO) was proposed and the solutions obtained were compared with those of CPLEX.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Fathi et al [28] tackled the part feeding problem at the assembly line by proposing a mathematical model and an ant colony optimization algorithm (ACO). The study attempted to find the best sequence and quantity of parts to be loaded on tugger trains on fixed routes and with cyclic delivery trips.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Emde et al [24] PSSP a Golz et al [15] OH b Emde and Boysen [25] DP Rao et al [26] GASA Faccio et al [27] Simulation Fathi et al [28] ACO Fathi et al [29] SA Muguerza et al [30] Fathi et al [31] PSO Emde and Schneider [32] NSA Peng and Zhou [33] HACO Zhou and Shen [9] TS PSO Zhou and Peng [34] OH & PSSP a Problem-specific solution procedure; b Other heuristics.…”
Section: Model Scheduling Loading Routingmentioning
confidence: 99%
“…3.4 启发信息函数的设计 启发函数可以看成人工蚂蚁对自身环境的一 种选择,或者说是人工蚂蚁自身的经验函数,启发 函数对蚂蚁的路径选择起到启发引导的作用,构建 合理的信息启发函数是算法获得成功的关键因 素 [15] 。本文根据再制造优化选配目标的需求,定义 了一种计算启发信息的方法,为了减少再制造产品 质量的波动,通过考虑已被选入装配尺寸链的零件 对质量损失函数的贡献,定义的启发函数如下式 …”
unclassified