SCHEDULING OPTIMIZATION OF KRI ASSIGNMENTS WITH BINARY INTEGER PROGRAMMING TO SECURE THE KOARMATIM SEA AREA

JOURNAL ASRO ◽  
2018 ◽  
Vol 9 (1) ◽  
pp. 86
Author(s):  
M Agus Arif H ◽  
Budi Santoso W ◽  
Ahmadi Ahmadi ◽  
Okol S Suharyo
Keyword(s):  
Integer Programming ◽  
Objective Function ◽  
Mathematical Formulation ◽  
Binary Integer Programming ◽  
Coverage Area ◽  
Entire Area ◽  
Excel Solver ◽  
Sea Area ◽  
Operation Scheduling

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

scholarly journals Towards Merging Binary Integer Programming Techniques with Genetic Algorithms

2017 ◽  
Vol 2017 ◽  
pp. 1-10
Author(s):  
Reza Zamani
Keyword(s):  
Genetic Algorithm ◽  
Integer Programming ◽  
Optimization Problems ◽  
Mathematical Formulation ◽  
Integer Program ◽  
Binary Integer Programming ◽  
Programming Technique ◽  
Combinatorial Optimization Problems ◽  
Programming Techniques ◽  
Feasible Solutions

This paper presents a framework based on merging a binary integer programming technique with a genetic algorithm. The framework uses both lower and upper bounds to make the employed mathematical formulation of a problem as tight as possible. For problems whose optimal solutions cannot be obtained, precision is traded with speed through substituting the integrality constrains in a binary integer program with a penalty. In this way, instead of constraining a variable u with binary restriction, u is considered as real number between 0 and 1, with the penalty of Mu(1-u), in which M is a large number. Values not near to the boundary extremes of 0 and 1 make the component of Mu(1-u) large and are expected to be avoided implicitly. The nonbinary values are then converted to priorities, and a genetic algorithm can use these priorities to fill its initial pool for producing feasible solutions. The presented framework can be applied to many combinatorial optimization problems. Here, a procedure based on this framework has been applied to a scheduling problem, and the results of computational experiments have been discussed, emphasizing the knowledge generated and inefficiencies to be circumvented with this framework in future.

scholarly journals Reshuffle minimisation to improve storage yard operations efficiency

2021 ◽  
Vol 15 ◽  
pp. 174830262199401
Author(s):  
Hammed Bisira ◽  
Abdellah Salhi
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Heuristic Approach ◽  
Container Terminals ◽  
Exact Method ◽  
Computational Results ◽  
Binary Integer Programming ◽  
Integer Programming Model ◽  
Compatibility Test ◽  
Storage Area

There are many ways to measure the efficiency of the storage area management in container terminals. These include minimising the need for container reshuffle especially at the yard level. In this paper, we consider the container reshuffle problem for stacking and retrieving containers. The problem was represented as a binary integer programming model and solved exactly. However, the exact method was not able to return results for large instances. We therefore considered a heuristic approach. A number of heuristics were implemented and compared on static and dynamic reshuffle problems including four new heuristics introduced here. Since heuristics are known to be instance dependent, we proposed a compatibility test to evaluate how well they work when combined to solve a reshuffle problem. Computational results of our methods on realistic instances are reported to be competitive and satisfactory.

scholarly journals THE WARSHIP ASSIGNMENT SCHEDULE USING INTEGER PROGRAMMING MODEL

JOURNAL ASRO ◽  
2019 ◽  
Vol 10 (3) ◽  
pp. 49
Author(s):  
Ahmadi Ahmadi ◽  
Benny Sukandari ◽  
Agus Mahrowi
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Mathematical Formulation ◽  
Combinatorial Problem ◽  
Mathematical Methods ◽  
Alternative Scheduling ◽  
Integer Programming Model ◽  
Maintenance Schedule ◽  
Hard Constraints ◽  
Decision Variables

Scheduling is an assignment activity that deals with constraints. A number of events can occur in a period of time and location so that objective functions as close as possible can be fulfilled. In the hierarchy of decision making, scheduling is the last step before the start of an operation. Scheduling warship assignments in Kolinlamil are an interesting topic to discuss and find solutions to using mathematical methods. The process of the Kolinlamil warship assignment schedule was carried out to produce an annual shipbuilding schedule. This process not only requires fast follow-up, but also requires systematic and rigorous steps. Where the assignment schedule is a fairly complex combinatorial problem. While making the assignment schedule that is applied at this time is considered less accurate because it calculates the conventional method. The process of warship assignment schedule in this study using the Integer Programming model aims to obtain alternative scheduling operations. The schedule observed was 13 warships in carrying out N operations for 1 year (52 weeks). This research begins with determining the decision variables and limitations that existing constraints. Hard constraints include: maintenance schedule, time and duration of each task, warship class assigned to the task and the number of executing warships per task. While soft constraints are how long the warship performs its tasks in a row. The mathematical formulation of the Integer Programming model created consists of three indicator, one decision variables, two measuring parameters and five constraint functions. Furthermore, determining the best scheduling alternatives is completed using the Microsoft Exel Solver computing program.Keywords: Scheduling, Integer Programming, Solver.

Sign in / Sign up

Export Citation Format

Share Document