A famous travelling salesman problem, appearing simple to state but complex solve, has been widely investigated and various algorithms have proposed. In this article, mixed integer linear programming of python (MIP) is used model problem with varying input data. The result shows that small data the modelling code MIP executing quickly converging optimal value, while large scale require plenty c...

The aim of this study is to propose a new mixed integer linear programming (MILP) model to find the minimum required number of yard cranes, Rubber tyred gantry cranes (RTGCs), for completion the total amount of works at the end of planning horizon. In other word, we find the optimal number of yard cranes in a container terminal which completes the total amount of works. The paper supports the p...

This paper describes an experimental code that has been developed to solve zero-one mixed integer linear programs. The experimental code uses a primal{dual interior point method to solve the linear programming subproblems that arise in the solution of mixed integer linear programs by the branch and bound method. Computational results for a number of test problems are provided.

‎In this paper‎, ‎some KKT type sufficient global optimality conditions‎ ‎for general mixed integer nonlinear programming problems with‎ ‎equality and inequality constraints (MINPP) are established‎. ‎We achieve‎ ‎this by employing a Lagrange function for MINPP‎. ‎In addition‎, ‎verifiable sufficient global optimality conditions for general mixed‎ ‎integer quadratic programming problems are der...

this paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. first, the problem is formulated as a mixed integer linear programming model. then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. two experiments are carried out to evaluate th...