Papers by Keyword: 0-1 Programming

Abstract: This paper provides an automatic method of splicing shredded printed paper which was shredded by shredder. A splicing degree function was defined by using bicubic spline technology. Based on the splicing degree function, a 0-1 mixed integer programming model was used to solve the shredded paper splicing problem. The whole solving process was automatic, and the result was perfect.

Abstract: This paper mathematically described the supplies loading problem of military equipment support dispatching force. Through taking all supplies average loading as the objective function, taking the same kind of supplies group loading, no overweight and overcapacity, no-repeated loading and packing as constraint conditions, optimization model was put forward. And the effectiveness of the model was validated by the example computation.

Abstract: This paper mathematically described the group selecting problem of intermediate ordnance equipment support agency. Through taking maximizing support ability of the selected group and minimizing support ability differences of each equipment type as the objective function, taking a minimum support ability of equipment, staffing level of the selected group and support agency as conditions, optimization model was put forward. And the effectiveness of the model is validated by the example computation.

Abstract: Location decision of Service Networks is important for an enterprise to dominate market and to improve service level. Characteristics and the decentralized control strategies of service network were discussed for the enterprise of Denso class. A 0-1 mixed integer programming model was established for location problem of spare parts centers and solved by ILOG along with sensitivity analysis. Furthermore, a dynamic programming model was established for location problem of sales model shop and calculated by a numerical listing method.

Abstract: In this paper, a dynamic yard allocation strategy of export containers is proposed based on a hybrid stack mode. Firstly, a 0-1 programming model is developed for the problem. Accordingly, the model’s objective function is subject to the minimization of the total re-shuffle containers which are buried beneath other containers but heavier. To resolve the NP-hard problem regarding the dynamic yard allocation model, a hybrid algorithm, which applies heuristic rules and genetic algorithm, is then employed. Subsequently, a case study is used for system illustration. Consequently, it could be found from computational results that this approach paves a venue for resolving the dynamic yard allocation problem of export containers.

Abstract: A new approach that combines neural network and 0-1 programming was proposed. Based on the lifecycle analysis, the characteristics of new products can be divided into four categories with different benefit curves and parameters. A neural network is used to classify the new product and the 0-1 programming model is then developed and used to determine what products to be introduced into marketplace. Numerical example is given finally to show that this model is effective for firms.