scholarly journals Supply Chain Optimization by Mixed Integer Program for Manufacturer and Retailer System of Poultry firm in Bangladesh

2016 ◽  
Vol 34 ◽  
pp. 75-87
Author(s):  
Mohammad Khairul Islam ◽  
Mohammed Forhad Uddin ◽  
Md M Alam
Keyword(s):  
Large Scale ◽  
Raw Materials ◽  
Integer Program ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
Selling Price ◽  
Supply Chain Optimization ◽  
Self Employment ◽  
Gdp Growth Rate ◽  
The Cost

In this study, we formulate mixed integer program for manufacturer and retailer system of poultry firm in Bangladesh that is one of the most promising sectors to increase Gross Domestic Product (GDP) growth rate plus equitable distribution through arranging food security as well as ensuring self-employment, creating purchasing power and reducing poverty at a large scale. From the survey, it has observed that the selling price of eggs and chicken fluctuate depending on the natural calamities. We have made a question survey on some poultry firm in the district of Mymensingh and Gazipur. This paper maximized the profit and minimizes the cost. The formulated mixed integer program has solved by branch and bound algorithm using A Mathematical Programming Language (AMPL). It has observed that the profit and selling price have very good relationship with production cost and raw materials cost but no significant relation with fixed cost.GANIT J. Bangladesh Math. Soc.Vol. 34 (2014) 75-87

scholarly journals A GRASP Approach for Solving Large-Scale Electric Bus Scheduling Problems

Energies ◽  
2021 ◽  
Vol 14 (20) ◽  
pp. 6610
Author(s):  
Raka Jovanovic ◽  
Islam Safak Bayram ◽  
Sertac Bayhan ◽  
Stefan Voß
Keyword(s):  
Public Transport ◽  
High Speed ◽  
Large Scale ◽  
Integer Program ◽  
Mixed Integer ◽  
Transport Systems ◽  
Mixed Integer Program ◽  
Scheduling Problems ◽  
Electric Bus ◽  
Battery Capacity

Electrifying public bus transportation is a critical step in reaching net-zero goals. In this paper, the focus is on the problem of optimal scheduling of an electric bus (EB) fleet to cover a public transport timetable. The problem is modelled using a mixed integer program (MIP) in which the charging time of an EB is pertinent to the battery’s state-of-charge level. To be able to solve large problem instances corresponding to real-world applications of the model, a metaheuristic approach is investigated. To be more precise, a greedy randomized adaptive search procedure (GRASP) algorithm is developed and its performance is evaluated against optimal solutions acquired using the MIP. The GRASP algorithm is used for case studies on several public transport systems having various properties and sizes. The analysis focuses on the relation between EB ranges (battery capacity) and required charging rates (in kW) on the size of the fleet needed to cover a public transport timetable. The results of the conducted computational experiments indicate that an increase in infrastructure investment through high speed chargers can significantly decrease the size of the necessary fleets. The results also show that high speed chargers have a more significant impact than an increase in battery sizes of the EBs.

scholarly journals A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning

2013 ◽  
Vol 46 ◽  
pp. 343-412 ◽  
Author(s):  
A. Coles ◽  
A. Coles ◽  
M. Fox ◽  
D. Long
Keyword(s):  
Resource Use ◽  
Raw Materials ◽  
Integer Program ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
Additional Information ◽  
Planning Graph ◽  
Planning Problems ◽  
Interval Valued ◽  
Numeric Reasoning

Although the use of metric fluents is fundamental to many practical planning problems, the study of heuristics to support fully automated planners working with these fluents remains relatively unexplored. The most widely used heuristic is the relaxation of metric fluents into interval-valued variables --- an idea first proposed a decade ago. Other heuristics depend on domain encodings that supply additional information about fluents, such as capacity constraints or other resource-related annotations. A particular challenge to these approaches is in handling interactions between metric fluents that represent exchange, such as the transformation of quantities of raw materials into quantities of processed goods, or trading of money for materials. The usual relaxation of metric fluents is often very poor in these situations, since it does not recognise that resources, once spent, are no longer available to be spent again. We present a heuristic for numeric planning problems building on the propositional relaxed planning graph, but using a mathematical program for numeric reasoning. We define a class of producer--consumer planning problems and demonstrate how the numeric constraints in these can be modelled in a mixed integer program (MIP). This MIP is then combined with a metric Relaxed Planning Graph (RPG) heuristic to produce an integrated hybrid heuristic. The MIP tracks resource use more accurately than the usual relaxation, but relaxes the ordering of actions, while the RPG captures the causal propositional aspects of the problem. We discuss how these two components interact to produce a single unified heuristic and go on to explore how further numeric features of planning problems can be integrated into the MIP. We show that encoding a limited subset of the propositional problem to augment the MIP can yield more accurate guidance, partly by exploiting structure such as propositional landmarks and propositional resources. Our results show that the use of this heuristic enhances scalability on problems where numeric resource interaction is key in finding a solution.

A genetic-algorithm-based approach for scheduling the renewal of railway track components

2009 ◽  
Vol 223 (6) ◽  
pp. 533-541 ◽  
Author(s):  
J Zhao ◽  
A H C Chan ◽  
M P N Burrow
Keyword(s):  
Genetic Algorithm ◽  
Cost Benefit ◽  
Integer Program ◽  
Computational Effort ◽  
Railway Track ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
Renewal Processes ◽  
The Cost ◽  
Solution Techniques

This article describes a procedure that may be used to help synchronize the renewal of railway track components so that the costs of the renewal processes are minimized. To this end a model has been developed to maximize the cost benefit by combining renewal activities for a section of track. As the problem may be considered to be a mixed integer program with constrains, a genetic algorithm (GA)-based approach was used to find the solution. Techniques that may be used to reduce the computational effort required to perform the analysis are also described. The applicability of the approach to optimize the renewal of railway track components is shown by means of an example.

scholarly journals Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming

2021 ◽  
Author(s):  
Zahed Shahmoradi ◽  
Taewoo Lee
Keyword(s):  
Linear Programming ◽  
Large Scale ◽  
Robust Regression ◽  
Model Fitting ◽  
Exact Algorithm ◽  
Integer Program ◽  
Inverse Optimization ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
The Impact

Although inverse linear programming (LP) has received increasing attention as a technique to identify an LP that can reproduce observed decisions that are originally from a complex system, the performance of the linear objective function inferred by existing inverse LP methods is often highly sensitive to noise, errors, and uncertainty in the underlying decision data. Inspired by robust regression techniques that mitigate the impact of noisy data on the model fitting, in “Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming,” Shahmoradi and Lee propose a notion of stability in inverse LP and develop an inverse optimization model that identities objective functions that are stable against data imperfection. Although such a stability consideration renders the inverse model a large-scale mixed-integer program, the authors analyze the connection between the model and well-known biclique problems and propose an efficient exact algorithm as well as heuristics.

3D deployment of UAVs in wireless networks for traffic offloading and edge computing

2019 ◽  
Author(s):  
◽  
Rania Islambouli
Keyword(s):  
Wireless Networks ◽  
Large Scale ◽  
Scale Up ◽  
Integer Program ◽  
Use Cases ◽  
Base Stations ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
5G Networks ◽  
Iot Devices

Unmanned aerial vehicles (UAVs) have recently emerged as enablers for mul- titude use cases in 5G networks leading to interesting industrial and business applications. 5G networks envision a multi-service network promoting various applications with a distinct set of performance and service demands. In this the- sis, we leverage the high exibility, low-cost, and mobility of UAVs to scale up and improve the e ciency of IoT and mobile networks. We study the utilization of UAVs to increase the capacity and coverage in wireless networks on one side and to extend low computational capabilities and mitigate battery limitations in constrained devices on another side. However, to unlock these promising use cases of UAVs, we address the challenges coupled with UAV utilization mainly 3D deployment and device association. First, we address the problem of deploying multiple UAVs to act as aerial base stations (ABS) in 3D space while autonomously adapting their positions as users move around within the network. We formulate the problem as a mixed integer program and then propose a novel autonomous positioning approach that can e ciently gear the UAV positions in a way to maintain target quality re- quirements. Next, we leverage the mobility and agility of UAVs and use them as mo- bile edge servers or cloudlets to o er computation o oading opportunities to IoT devices. This being said, computation tasks generated by IoT devices can be pro- cessed in less latency and with much lower energy consumption at the devices. To optimally deploy UAVs as mounted cloudlets, we formulate our problem as mixed integer program and then use an e cient meta-heuristic algorithm to generate optimized results for large scale IoT networks. The simulation results presented in this thesis demonstrate the e ectiveness of the proposed solutions and algo- rithms compared to the optimal solutions and related work in the literature for various network scenario

scholarly journals Coordination and Optimization: The Integrated Supply Chain Analysis with Non-Linear Price-Sensitive Demand

2011 ◽  
Vol 2 (1) ◽  
pp. 83-94
Author(s):  
Mohammed Forhad UDDIN ◽  
Kazushi SANO
Keyword(s):  
Supply Chain ◽  
Demand Function ◽  
Integer Program ◽  
Coordination Mechanism ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
Selling Price ◽  
Penalty Cost ◽  
Non Linear ◽  
Integrated Supply Chain

In this work, a supply chain with coordination mechanism consisting single vendor and buyer is considered. Further, instead of price sensitive linear or deterministic demand function, a price-sensitive non-linear demand function is introduced in this paper. To find the inventory cost, penalty cost and transportation cost, it is considered that the production and shipping functions of vendor are continuously harmonized and occur at the same rate. In this integrated supply chain, the Buyer’s Linear Program (LP), vendor’s Integer Program (IP) and coordinated Mixed Integer Program (MIP) models are formulated. Numerical examples presented in this research, which include the sensitivity of the key parameters to illustrate the models.  The solution procedures demonstrate that the individual profit as well as joint profit could be increased by coordination mechanism even though the demand function is non-linear. In addition, the results illustrate that Buyer’s selling price with consumers purchasing price could be decreased which may increase the demand of the end market. Finally, a conclusion is drawn in favor of the coordinated supply chain with non-linear price sensitive demand function.  

scholarly journals Vendor-buyer coordination and supply chain optimization with deterministic demand function

2016 ◽  
Vol 26 (3) ◽  
pp. 361-379 ◽  
Author(s):  
Mohammed Uddin ◽  
Manik Mondal ◽  
Kazi Hussain
Keyword(s):  
Geographical Area ◽  
Addition Product ◽  
Product Distribution ◽  
Integer Program ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
Supply Chain Optimization ◽  
Location Selection ◽  
Deterministic Demand ◽  
Production Capacities

This paper presents a model that deals with a vendor-buyer multi-product, multi-facility and multi-customer location selection problem, which subsume a set of manufacturer with limited production capacities situated within a geographical area. We assume that the vendor and the buyer are coordinated by mutually sharing information. We formulate Mixed Integer Linear Fractional Programming (MILFP) model that maximize the ratio of return on investment of the distribution network, and a Mixed Integer Program (MIP), used for the comparison. The performance of the model is illustrated by a numerical example. In addition, product distribution and allocation of different customers along with the sensitivity of the key parameters are analyzed. It can be observed that the increment of the opening cost decreases the profit in both MILFP and MIP models. If the opening cost of a location decreases or increases, the demand and the capacity of that location changes accordingly.

A stochastic mixed integer program to model spatial wildfire behavior and suppression placement decisions with uncertain weather

2016 ◽  
Vol 46 (2) ◽  
pp. 234-248 ◽  
Author(s):  
Erin J. Belval ◽  
Yu Wei ◽  
Michael Bevers
Keyword(s):  
Wildland Fire ◽  
Fire Behavior ◽  
Integer Program ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
Weather Forecasts ◽  
Placement Decisions ◽  
Weather Events ◽  
Weather Changes ◽  
Nonanticipativity Constraints

Wildfire behavior is a complex and stochastic phenomenon that can present unique tactical management challenges. This paper investigates a multistage stochastic mixed integer program with full recourse to model spatially explicit fire behavior and to select suppression locations for a wildland fire. Simplified suppression decisions take the form of “suppression nodes”, which are placed on a raster landscape for multiple decision stages. Weather scenarios are used to represent a distribution of probable changes in fire behavior in response to random weather changes, modeled using probabilistic weather trees. Multistage suppression decisions and fire behavior respond to these weather events and to each other. Nonanticipativity constraints ensure that suppression decisions account for uncertainty in weather forecasts. Test cases for this model provide examples of fire behavior interacting with suppression to achieve a minimum expected area impacted by fire and suppression.

A Note on a Conceptual Framework for Dynamic Location—Allocation Analysis

1976 ◽  
Vol 8 (4) ◽  
pp. 443-446
Author(s):  
W G Truscott
Keyword(s):  
Conceptual Framework ◽  
Integer Program ◽  
Original Version ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
Location Allocation ◽  
Dynamic Location

This note examines a previously published model for dynamic location—allocation analysis. The usefulness of this model is enhanced by reformulating the problem as an operational zero-one, mixed-integer program while retaining the intent of the original version.

D. Perhitungan HPP Telur Asin Dengan Pendekatan Variabel Costing Pada UD Mulya Jaya

2019 ◽  
Vol 4 (1) ◽  
pp. 30
Author(s):  
Neno Pratiwi ◽  
Andre Setiawan ◽  
Ilmi Cayono ◽  
Johan Trinanto
Keyword(s):  
Decision Making ◽  
Production Process ◽  
Raw Materials ◽  
Selling Price ◽  
Assistance Program ◽  
Total Cost ◽  
Cost Of Production ◽  
The Cost ◽  
A Company ◽  
Important Objective

ABSTRAK Pada umumnya harga pokok produksi dalam akuntansi diartikan dengan jumlah biaya dari seluruh pemakaian yang telah dilakukan selama proses produksi atau kegiatan yang mana mengubah bahan baku menjadi produk jadi (produk siap pakai/siap saji). Tujuan penting dalam tugas ini yaitu memperhitungkan harga pokok produksi dari UD Mulya Jaya dengan menggunakan pendekatan variabel costing untuk mengetahui besarnya harga pokok pada setiap produk yang diproduksi. Pentingnya penentuan harga pokok produksi dapat dilakukan sebelum para usaha menentukan harga jual. Pendampingan ini bertujuan untuk membantu mencari dan menentukan harga pokok produksi yang dapat digunakan untuk menetapkan harga jual. Pendampingan ini dilakukan untuk membantu wirausaha dalam program kerja, yaitu bimbingan akuntansi dengan fokus perhitungan harga pokok produksi. Dalam menentukan harga pokok produksi pada UD Mulya Jaya dapat menggunakan pendekatan variable costing yang biasanya metode ini digunakan untuk semacam pengambilan keputusan dalam perusahaan. Melalui program pendampingan kewirausahaan didapatkan hasil perhitungan harga pokok produksi yang menggunakan pendekatan variabel costing. Hasil tersebut dapat menjadi suatu keputusan bagi UD Mulya Jaya untuk dapat menetapkan harga pokok produksi pada setiap produk telur asin. Kata Kunci : Kewirausahaan, HPP, Harga.   ABSTRACT In general, the cost of production in accounting is defined as the total cost of all uses that have been made during the production process or activities which convert raw materials into finished products (ready-to-use / ready-to-serve products). An important objective in this task is to calculate the cost of goods manufactured from UD Mulya Jaya by using a variable costing approach to find out the cost of goods on each product produced. The importance of determining the cost of production can be done before businesses determine the selling price. This assistance aims to help find and determine the cost of production that can be used to set the selling price. This assistance is carried out to help entrepreneurs in work programs, namely accounting guidance with a focus on calculating the cost of production. In determining the cost of production at UD Mulya Jaya, it can use the variable costing approach, which is usually used for a kind of decision making in a company. Through the entrepreneurship assistance program, the results of the calculation of the cost of production are obtained using the variable costing approach. These results can be a decision for UD Mulya Jaya to be able to set the cost of production for each salted egg product. Keywords: Entrepreneurship, COGS, Price

Sign in / Sign up

Export Citation Format

Share Document