alexa Assembly Sequence Planning With A Weighted Graph
ISSN: 2169-0316

Industrial Engineering & Management
Open Access

OMICS International organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations

700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Share This Page

Additional Info

Loading Please wait..

International Summit on Industrial Engineering
December 08-10, 2014 DoubleTree by Hilton Hotel San Francisco Airport, USA

Yong Wang
Accepted Abstracts: Ind Eng Manage
DOI: 10.4172/2169-0316.S1.006
Assembly sequence planning is a typical of representative combinatorial optimization problems in manufacturing. The general methods are used to generate a large number of feasible assembly sequences and find the best sequence through evaluation. A lot of computation time and memory space are needed and many methods usually find a local optimum. To reduce the hardness of assembly sequence planning, the assembly model is converted into a directed weighted graph considering the assembly constraints which are classified into the qualitative and quantitative constraints. The qualitative constraints including the topological and geometrical assembly constraints between parts are adopted to configure out the feasible assembly sequences and they are represented as the directed edges in the weighted graph. A portion of process constraints is also used as the qualitative constraints. The other process constraints, such as the assembly tolerance, assembly stability, assembly directions and tools, are quantified with the fuzzy analytical hierarchy process method and attached to the edges. The weights are taken as the heuristic information to find the optimal fragments of the optimal or near-optimal assembly sequences. With the assembly weighted graph, the optimal or near-optimal assembly sequences will be searched in the generation of the feasible sequences and the search space of the best solution will be decreased. A branch and bound algorithm is designed to find the optimal sequence with the weighted graph. The results illustrate that the optimal assembly sequences are found quickly. The method is expected to apply to the complex products.
Yong Wang has completed his PhD at the age of 32 years from Beihang University, China and worked for North China Electric Power University for 5 years. He is the Associate Director of Research Center of Wind Power System, School of Renewable Energy. He has published more than 15 papers in reputed journals and conferences.
image PDF   |   image HTML

Relevant Topics

Peer Reviewed Journals
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version