An ant colony algorithm-based fast configuration design method for large container cranes
by Bowei Xu; Yongsheng Yang; Junjun Li
International Journal of Manufacturing Research (IJMR), Vol. 10, No. 4, 2015

Abstract: Customers' special need is one of the key drivers in product configuration design. The complexity of configuration design for large container cranes is known as non-deterministic polynomial-time (NP) hard. We are interested in the fast configuration model and method that support large container cranes configuration. In this paper, a rapid configuration design framework for large-scale container cranes is proposed. A constrained 0-1 programming gene evolutionary model is constructed. We propose an ant colony algorithm-based fast configuration design method. A design example of the cart mechanism is provided to test the validity and evaluate the effectiveness and efficiency of the proposed method, in which performances of different algorithms are compared. Results have shown that the method presented here is able to converge with solutions of good quality. [Received 05 December 2014; Revised 01 July 2015; Accepted 21 September 2015]

Online publication date: Sat, 20-Feb-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Research (IJMR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com