The analysis of the stability of some integer programming algorithms with respect to the objective function

2011 ◽  
Vol 55 (4) ◽  
pp. 18-25 ◽  
Author(s):  
M. V. Devyaterikova ◽  
A. A. Kolokolov ◽  
N. A. Kosarev
2006 ◽  
Vol 34 (2) ◽  
pp. 149-154 ◽  
Author(s):  
M.V. Devyaterikova ◽  
A.A. Kolokolov

JOURNAL ASRO ◽  
2018 ◽  
Vol 9 (1) ◽  
pp. 86
Author(s):  
M Agus Arif H ◽  
Budi Santoso W ◽  
Ahmadi Ahmadi ◽  
Okol S Suharyo

ABSTRACT Scheduling is an assignment activity related to a number of constraints, a number of events that can occur in a period of time and place or location so that the objective function as closely as possible can be fulfilled. In the hierarchy of decision making, scheduling is the last step before the start of an operation. Scheduling the assignment of KRI in Koarmatim is an interesting topic to be discussed and resolved using a mathematical method. The scheduling process of KRI assignments at Koarmatim is done to produce annual JOP / JOG. This process requires not only rapid follow-up, but also requires systematic steps. The scheduling of assignments applied by Koarmatim is currently carried out by personnel by not using mathematical calculations. The ship assignment scheduling process in this research was carried out using the Binary Integer Programming (BIP) method approach with the aim of minimizing costs and maximizing the purpose of the ship assignment. The scheduling observed was 25 ships carrying out operations for 52 weeks (1 year). The mathematical formulation of the BIP model is made up of one objective function and Three constraint functions. Then the development of the BIP model is then completed, the computer uses Excel Solver. The results obtained that the BIP model applied to scheduling KRI Koarmatim assignments is the maximum coverage area reached is 93,651,234 NM2, with an area safeguard level of 76,11 from the entire area of operating sector I to IX (1,230,442 NM2). BIP is an appropriate method to be used as a method in scheduling the assignment of KRI in Koarmatim.  Keywords: Scheduling, Ship assignments, Binary Integer Programming


2012 ◽  
Vol 220-223 ◽  
pp. 2678-2683
Author(s):  
Bin Wang ◽  
Tao Yang

The paper dose research about the optimization of container shipping of sea –carriage for meeting the goods transport requirement by use of integer programming. Both laden and empty containers are combined into a system. In particular, the effect of special laden container shipping capacity on the shipping plan is investigated. In the model, the objective function is to maximize the total profit of container shipping. The profit caused by laden container shipping minus the cost caused by both laden and empty container shipping equal to the total profit. The constraints to the model include meeting the need of both laden and empty containers, shipping limit to both common and special laden containers , the number of empty container supported. Lingo9.0 is used to solve the model and shipping methods in varied parameters are shown by simulation. The aim of the paper is to provide a reasonable plan of container shipping of sea-carriage, so the container shipping cost of a shipping company can be reduced and the its profit made by container shipping are maximized.


Sign in / Sign up

Export Citation Format

Share Document