A Class of Collocating Problem in Production and its Optimization Models

Dai Lun Tan; Hong Xia Chen; Ze Jian Cui

doi:10.4028/www.scientific.net/AMM.513-517.1215

Paper Titles

Intelligent Quality Control System Based on Machine Vision of Multi-Line
p.1192

A Junk SMS Filtering Application Based on Bayes Algorithm
p.1197

The Study of Feature Extraction of Handwritten Digits Based on Euler Algorithm
p.1202

A Model Transformation Approache of Complex Systems - Case Study in Design Evolutions of Data Centers
p.1208

A Class of Collocating Problem in Production and its Optimization Models
p.1215

Implicit Encryption of Timing Packet with Statistical Side Channel Coding
p.1221

Maximum Likelihood Based Joint Angle-Frequency Estimation Using QPSO Algorithm
p.1227

Protecting Location Privacy against Traffic Analysis in Wireless Sensor Networks with LEACH Routing Protocol
p.1233

Ontology-Based Methodology for Information Integration and Service Discovery
p.1241

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517A Class of Collocating Problem in Production and...

A Class of Collocating Problem in Production and its Optimization Models

Abstract:

The paper gives a general description of a typical combinatorial optimization problem-the collocation problem of production, and respectively establish the integer linear programming model based on the collocation ways and the integer linear programming model based on the optimal collocation amounts and the integer nonlinear programming model based on the local optimum. In the solving methods of the models, we have mainly analyzed the enumeration method and the method by using LINGO optimization software to solve the model. The instance shows that the models and solutions are all effective. The first model reflects the mechanism of the collocation problem better and gets the global optimal solution most likely, but more difficult to solve large-scale; the second model can quickly obtain the optimal the numbers of the finished products and all kinds of materials consumptions, but still need to enumerate the collocation ways step by step; the third model can gets the local optimal solution and the specific collocation ways through solving the model circularly. The optimization models and solution methods in this paper can be extended to the similar sub-problems of the combinatorial optimization problems, such as assembly problem, packing problem, the cutting problem, etc.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

1215-1220

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.1215

Citation:

Cite this paper

Online since:

February 2014

Authors:

Dai Lun Tan*, Hong Xia Chen, Ze Jian Cui

Keywords:

Collocation Problem of Production, Combinatorial Optimization Model, Integer Programming

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] YUE-Mingyi，the Introduction of combinatorial optimization，Chinese Journal of Operations Research, Vol. 7, No. 1, Jnue 1988, P36-40.

Google Scholar

[2] HU Xiao-bing, HUANG Xi-yue, Solving 0-1 knapsack problem based on ant colony optimization algorithm, Journal of systems engineering, Vol. 20 No. 5, 2005. 10, P520-523.

Google Scholar

[3] CHEN Duan-bing, LU Jing-fa, SHANG Ming-sheng, FU Yan, An intelligent enumerative algorithm for solving rectangle packing problem. Journal of Chongqing University of Posts and Telecommunications (Natural Science), Vol. 20, No. 4, 2008. 4, P447-452.

Google Scholar

[4] ZENG Li-ping, HUANG Wen-qi, An Intelligent Enumeration Algorihm for Job Shop Scheduling Promleb, Computer Engineering and applications, 2004(30), P31-34.

Google Scholar

[5] XIAO Chi-xin, CAI Zi-xing, WANG Yong, Evolutionary strategy of lexicographic order for combinational problem. Control Theory & Applications, Vol. 27 No. 4, Apr. 2010, P473-478.

Google Scholar