On the average tractability of binary integer programming and the curious transition to perfect generalization in learning majority functions

1993 ◽  
Author(s):  
Shao C. Fang ◽  
Santosh S. Venkatesh
Keyword(s):  
Integer Programming ◽  
Binary Integer Programming

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.

A multi-objective approach to design strategic supply chains and develop responsiveness- efficiency frontiers

2018 ◽  
Vol 29 (1) ◽  
pp. 365-386 ◽  
Author(s):  
Raed AlHusain ◽  
Reza Khorramshahgol
Keyword(s):  
Supply Chain ◽  
Integer Programming ◽  
Programming Model ◽  
Efficient Frontier ◽  
Decision Makers ◽  
Binary Integer Programming ◽  
Content Type ◽  
Strategic Fit ◽  
Cost Efficient ◽  
Alternative Solutions

Purpose The purpose of this paper is twofold. Initially, a multi-objective binary integer programming model is proposed for designing an appropriate supply chain that takes into consideration both responsiveness and efficiency. Then, a responsiveness-cost efficient frontier is generated for the supply chain design that can help organizations find the right balance between responsiveness and efficiency, and hence achieve a strategic fit between organizational strategy and supply chain capabilities. Design/methodology/approach The proposed SC design model used both cross-functional and logistical SC drivers to build a binary integer programming model. To this end, various alternative solutions that correspond to different SC design portfolios were generated and a responsiveness-cost efficient frontier was constructed. Findings Various alternative solutions that correspond to different SC designs were generated and a responsiveness-cost efficient frontier was constructed to help the decision makers to design SC portfolios to achieve a strategic fit between organizational strategy and SC capabilities. Practical implications The proposed methodology enables the decision makers to incorporate both qualitative and quantitative judgements in SC design. The methodology is easy to use and it can be readily implemented by a software. Originality/value The proposed methodology allows for subjective value judgements of the decision makers to be considered in SC design and the efficiency-responsiveness frontier generated by the methodology provides a trade-off to be used when choosing between speed and cost efficiency in SC design.

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

Sign in / Sign up

Export Citation Format

Share Document