Rotate-vector method for integer programming

Zhong Ming Li; Wei Liu; Zong Xia Jiao

doi:10.3969/j.issn.1001-506X.2012.05.36

Rotate-vector method for integer programming

Zhong Ming Li^*
, Wei Liu
, Zong Xia Jiao

^*Corresponding author for this work

School of Automation Science and Electrical Engineering

Beijing University of Posts and Telecommunications

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

A rotating vector optimization method for integer programming is presented based on the basic rotate-vector method. Rotation coefficient and contract coefficient are rebuilt. The length of the radius vector is ensured to be constant in the process of rotation. The strategy for contraction can search an optimal solution exhaustively in the space. The method of multi vectors and the principle of "survival of the fittest" are used. The rejection coefficient of radius vectors and the retained coefficient of vectors are introduced as control parameters. As a result, computational efficiency and accuracy are improved evidently. The effectiveness is tested by solving two examples of integer programming. The method is also efficient for integer programming with higher dimensional space.

Original language	English
Pages (from-to)	1058-1061
Number of pages	4
Journal	Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics
Volume	34
Issue number	5
DOIs	https://doi.org/10.3969/j.issn.1001-506X.2012.05.36
State	Published - May 2012

Keywords

Heuristic algorithm
Integer programming
Rotate-vector

Access to Document

10.3969/j.issn.1001-506X.2012.05.36

Cite this

@article{f087b88468df4db5ac23dca5fee4085d,

title = "Rotate-vector method for integer programming",

abstract = "A rotating vector optimization method for integer programming is presented based on the basic rotate-vector method. Rotation coefficient and contract coefficient are rebuilt. The length of the radius vector is ensured to be constant in the process of rotation. The strategy for contraction can search an optimal solution exhaustively in the space. The method of multi vectors and the principle of {"}survival of the fittest{"} are used. The rejection coefficient of radius vectors and the retained coefficient of vectors are introduced as control parameters. As a result, computational efficiency and accuracy are improved evidently. The effectiveness is tested by solving two examples of integer programming. The method is also efficient for integer programming with higher dimensional space.",

keywords = "Heuristic algorithm, Integer programming, Rotate-vector",

author = "Li, \{Zhong Ming\} and Wei Liu and Jiao, \{Zong Xia\}",

year = "2012",

month = may,

doi = "10.3969/j.issn.1001-506X.2012.05.36",

language = "英语",

volume = "34",

pages = "1058--1061",

journal = "Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics",

issn = "1001-506X",

publisher = "Chinese Institute of Electronics",

number = "5",

}

TY - JOUR

T1 - Rotate-vector method for integer programming

AU - Li, Zhong Ming

AU - Liu, Wei

AU - Jiao, Zong Xia

PY - 2012/5

Y1 - 2012/5

N2 - A rotating vector optimization method for integer programming is presented based on the basic rotate-vector method. Rotation coefficient and contract coefficient are rebuilt. The length of the radius vector is ensured to be constant in the process of rotation. The strategy for contraction can search an optimal solution exhaustively in the space. The method of multi vectors and the principle of "survival of the fittest" are used. The rejection coefficient of radius vectors and the retained coefficient of vectors are introduced as control parameters. As a result, computational efficiency and accuracy are improved evidently. The effectiveness is tested by solving two examples of integer programming. The method is also efficient for integer programming with higher dimensional space.

AB - A rotating vector optimization method for integer programming is presented based on the basic rotate-vector method. Rotation coefficient and contract coefficient are rebuilt. The length of the radius vector is ensured to be constant in the process of rotation. The strategy for contraction can search an optimal solution exhaustively in the space. The method of multi vectors and the principle of "survival of the fittest" are used. The rejection coefficient of radius vectors and the retained coefficient of vectors are introduced as control parameters. As a result, computational efficiency and accuracy are improved evidently. The effectiveness is tested by solving two examples of integer programming. The method is also efficient for integer programming with higher dimensional space.

KW - Heuristic algorithm

KW - Integer programming

KW - Rotate-vector

UR - https://www.scopus.com/pages/publications/84863519116

U2 - 10.3969/j.issn.1001-506X.2012.05.36

DO - 10.3969/j.issn.1001-506X.2012.05.36

M3 - 文章

AN - SCOPUS:84863519116

SN - 1001-506X

VL - 34

SP - 1058

EP - 1061

JO - Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics

JF - Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics

IS - 5

ER -

Rotate-vector method for integer programming

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this