scholarly journals Location of Farmers Warehouse at Adaklu Traditional Area, Volta Region, Ghana

2016 ◽  
Vol 2016 ◽  
pp. 1-10
Author(s):  
Vincent Tulasi ◽  
Isaac Kwasi Adu ◽  
Elikem Kofi Krampa
Keyword(s):  
Location Problem ◽  
Complete Solution ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Fixed Cost ◽  
Straightforward Computation ◽  
Volta Region ◽  
Traditional Area ◽  
A Site ◽  
Postharvest Loss

Postharvest loss is one major problem farmers in Adaklu Traditional Area that most Ghanaian farmers face. As a result, many farmers wallow in abject poverty. Warehouses are important facilities that help to reduce postharvest loss. In this research, Beresnev pseudo-Boolean Simple Plant Location Problem (SPLP) model is used to locate a warehouse at Adaklu Traditional Area, Volta Region, Ghana. This model was used because it gives a straightforward computation and produces no iteration as compared with other models. The SPLP is a problem of selecting a site from candidate sites to locate a plant so that customers can be supplied from the plant at a minimum cost. The model is made up of fixed cost and transportation cost. Location index ordering matrix was developed from the transportation cost matrix and we used it with the fixed cost and differences between variable costs to formulate the Beresnev function. Linear term developed from the function which was partial is pegged to obtain a complete solution. Of the 14 notable communities considered,Adaklu Wayais found most suitable for the setting of the warehouse. The total cost involved is Gh₵78,180.00.

scholarly journals A Generalized Minimum Cost Flow Model for Multiple Emergency Flow Routing

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Jianxun Cui ◽  
Shi An ◽  
Meng Zhao
Keyword(s):  
Flow Model ◽  
Time Window ◽  
Programming Model ◽  
Real Life ◽  
Minimum Cost ◽  
Emergency Evacuation ◽  
Mixed Integer ◽  
Fixed Cost ◽  
Minimum Cost Flow ◽  
Cost Flow

During real-life disasters, that is, earthquakes, floods, terrorist attacks, and other unexpected events, emergency evacuation and rescue are two primary operations that can save the lives and property of the affected population. It is unavoidable that evacuation flow and rescue flow will conflict with each other on the same spatial road network and within the same time window. Therefore, we propose a novel generalized minimum cost flow model to optimize the distribution pattern of these two types of flow on the same network by introducing the conflict cost. The travel time on each link is assumed to be subject to a bureau of public road (BPR) function rather than a fixed cost. Additionally, we integrate contraflow operations into this model to redesign the network shared by those two types of flow. A nonconvex mixed-integer nonlinear programming model with bilinear, fractional, and power components is constructed, and GAMS/BARON is used to solve this programming model. A case study is conducted in the downtown area of Harbin city in China to verify the efficiency of proposed model, and several helpful findings and managerial insights are also presented.

An Ergonomics Perspective on Safety in the Oilfield

1989 ◽  
Vol 33 (15) ◽  
pp. 999-1003
Author(s):  
Ron W. Wardell
Keyword(s):  
Scenario Analysis ◽  
Moving Objects ◽  
Complete Solution ◽  
Minimum Cost ◽  
Industry Structure ◽  
Work Situation ◽  
Human Capabilities ◽  
Conceptual Changes ◽  
Drilling Operations ◽  
Drilling Rigs

Safety analyses of drilling operations are often written from the perspectives of regulation, economics, industry structure, etc. The ergonomic perspective on safety emphasizes that equipment and operations should be designed in light of human capabilities and limitations. To demonstrate this approach a scenario analysis was performed on records for 134 safety incidents on oilwell drilling rigs. The characteristics of the most critical scenarios were then considered to determine the extent to which the ergonomics of environment, equipment, and work methods might have contributed. Ergonomic data was collected at four drilling sites, including a prototype semi-automated rig. From both ergonomic and safety perspectives, the work situation of operators on a conventional rig floor is most in need of remediation. Mechanical pipe handling would provide the most complete solution to this unpleasant and unsafe environment, its strenuous and over-extending tasks, and the risks inherent in putting people near heavy moving objects. Significant improvements can be made at the detail level and at minimum cost in some tasks. Improvement in other tasks requires basic conceptual changes in rig systems and architecture. To realize their potential, new rig concepts must be carefully and systematically designed, and ergonomics should be considered throughout their design.

scholarly journals PENDISTRIBUSIAN PRODUK DENGAN VOGEL ‘S APPROXIMATION METHOD (VAM) DAN MODIFIED DISTRIBUTION METHOD (MODI) PENDISTRIBUSIAN PRODUK DENGAN VOGEL ‘S (VAM) DAN MODIFIED DISTRIBUTION METHOD (MODI)

2017 ◽  
Author(s):  
Tri Tri Hernawati
Keyword(s):  
Approximation Method ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Initial Solution ◽  
Final Solution ◽  
Distribution Method ◽  
Initial Cost ◽  
Cost Distribution ◽  
Distribution Cost

AbstractThe research is aimed at analyzing the implementation of distribution transportation method and finding out the saving of distribution transportation cost by using Vogel’s Approximation Method and Modified Distribution Method (MODI). The research used Vogel’s Approximation Method as the initial solution and Modified Distribution Method as the final solution to save distribution transportation cost. Implementation of combination, Vogel’s Approximation Method and Modified Distribution Method is a system will be develop to find the results of calculation of the initial cost of distribution, a minimum cost distribution, and allocation of items to be distributed from the origin place to the destination place. Entry data by user is origin place (many place and name of place), destination place (many place and name of place), amount of supply from the each origin, amount of demand from the each destination, and distribution cost from the each origin to the each destination. The result of the research shows minimalizing total distribution cost about 10,7%

scholarly journals Optimasi OPTIMASI BIAYA TRANSPORTASI PADA UKM DI KOTA BATAM

2021 ◽  
Vol 9 (1) ◽  
pp. 1-19
Author(s):  
Welly Sugianto ◽  
Elva Susanti
Keyword(s):  
Sensitivity Analysis ◽  
Objective Function ◽  
Approximation Method ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Product Distribution ◽  
Mathematical Form ◽  
Total Production ◽  
Calculation Results ◽  
Iteration Methods

This research was conducted at UKM Jovelyn in Batam city. Jovelyn's UKM produces various kinds of cakes and is marketed in markets in Batam City. The UKM opened 4 branches and marketed its products to 7 markets in the city of Batam. Product distribution is still random and not properly regulated. This resulted in a very large transportation cost, up to 1/3 of the total production cost. This shows that product transportation is still not carried out effectively and efficiently. The transportation problem is converted into a mathematical form so that the problem can be solved by the transportation method. The transportation method aims to minimize the objective function which is a function of transportation costs. The transportation method is basically the same as the linear program where at each iteration a selection is made to enter the basic variabel and leave the basic variabel. There are several iteration methods, namely the northwest corner method, minimum cost method, genetic algorithm, Vogel's approximation method, minimum row method, Russell's approximation method and column minimum method. Previous research has shown that the Vogel's approximation method, and Russell's approximation method are more efficient and accurate. This study uses both methods and a sensitivity analysis is performed to optimize the calculation results. The sensitivity analysis aims to determine the extent to which the objective function constants and the constraint function constants can change Keywords: Transportation, Sensitivity, SME  

Political sovereignty, village reproduction and legends of origin: a comparative hypothesis

Africa ◽  
1981 ◽  
Vol 51 (1) ◽  
pp. 465-476 ◽  
Author(s):  
Michel Verdon
Keyword(s):  
General Problem ◽  
Political Sovereignty ◽  
British Colonial ◽  
Volta Region ◽  
Traditional Area ◽  
Political Groups

The Nature of Ewe Polities: The General ProblemThe Ewe-speaking people live in the southern part of the Volta Region (Ghana) and Togo. They dwell in nucleated settlements (villages) of substantial sizes (varying from a few hundred to 16,000 inhabitants in Keta, their largest town). A group of such villages (from as few as one—hardly a group!—to as many as 116 in Anlo) form a larger entity dubbed ‘traditional area’ or ‘Division’ by the British colonial administrators. These Divisions were defined as ‘the groups of villages acknowledging a common fiaga or otherwise-titled Paramount Chief', and there are over one hundred of them in the whole of Eweland. The prevailing ethnographic and administrative opinion has been to equate these Divisions or ‘traditional areas’ with the precolonial Ewe sovereign political groups.

Two-Facility Location Problem with Infinite Retrial Queue

2012 ◽  
pp. 294-310
Author(s):  
Ebrahim Teimoury ◽  
Mohammad Modarres Yazdi ◽  
Iman Ghaleh Khondabi ◽  
Mahdi Fathi
Keyword(s):  
Steady State ◽  
Facility Location ◽  
Demand Uncertainty ◽  
Location Problem ◽  
Retrial Queue ◽  
Facility Location Problem ◽  
Fixed Cost ◽  
Performance Indexes ◽  
Matrix Geometric Method ◽  
Primary Service

This paper analyzes a two-facility location problem under demand uncertainty. The maximum server for the ith facility is It is assumed that primary service demand arrivals for the ith facility follow a Poisson process. Each customer chooses one of the facilities with a probability which depends on his or her distance to each facility. The service times are assumed to be exponential and there is no vacation or failure in the system. Both facilities are assumed to be substitutable which means that if a facility has no free server, the other facility is used to fulfill the demand. When there is no idle server in both facilities, each arriving primary demand goes into an orbit of unlimited size. The orbiting demands retry to get service following an exponential distribution. In this paper, the authors give a stability condition of the demand satisfying process, and then obtain the steady-state distribution by applying matrix geometric method in order to calculation of some key performance indexes. By considering the fixed cost of opening a facility and the steady state service costs, the best locations for two facilities are derived. The result is illustrated by a numerical example.

A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design

2012 ◽  
pp. 17-31 ◽  
Author(s):  
Masoud Yaghini ◽  
Mohammad Karimi ◽  
Mohadeseh Rahbar ◽  
Rahim Akhavan
Keyword(s):  
Simulated Annealing ◽  
Network Design ◽  
Simplex Method ◽  
Minimum Cost ◽  
Parameter Tuning ◽  
Fixed Cost ◽  
Hybrid Simulated Annealing ◽  
Np Hard Problem ◽  
Multicommodity Network Design ◽  
Opening And Closing

The fixed-cost Capacitated Multicommodity Network Design (CMND) problem is a well known NP-hard problem. This paper presents a matheuristic algorithm combining Simulated Annealing (SA) metaheuristic and Simplex method for CMND problem. In the proposed algorithm, a binary array is considered as solution representation and the SA algorithm manages open and closed arcs. Several strategies for opening and closing arcs are proposed and evaluated. In this matheuristic approach, for a given design vector, CMND becomes a Capacitated Multicommodity minimum Cost Flow (CMCF) problem. The exact evaluation of the CMCF problem is performed using the Simplex method. The parameter tuning for the proposed algorithm is done by means of design of experiments approach. The performance of the proposed algorithm is evaluated by solving different benchmark instances. The results of the proposed algorithm show that it is able to obtain better solutions in comparison with previous methods in the literature.

A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design

2011 ◽  
Vol 2 (4) ◽  
pp. 13-28 ◽  
Author(s):  
Masoud Yaghini ◽  
Mohammad Karimi ◽  
Mohadeseh Rahbar ◽  
Rahim Akhavan
Keyword(s):  
Simulated Annealing ◽  
Network Design ◽  
Simplex Method ◽  
Minimum Cost ◽  
Parameter Tuning ◽  
Fixed Cost ◽  
Hybrid Simulated Annealing ◽  
Np Hard Problem ◽  
Multicommodity Network Design ◽  
Opening And Closing

The fixed-cost Capacitated Multicommodity Network Design (CMND) problem is a well known NP-hard problem. This paper presents a matheuristic algorithm combining Simulated Annealing (SA) metaheuristic and Simplex method for CMND problem. In the proposed algorithm, a binary array is considered as solution representation and the SA algorithm manages open and closed arcs. Several strategies for opening and closing arcs are proposed and evaluated. In this matheuristic approach, for a given design vector, CMND becomes a Capacitated Multicommodity minimum Cost Flow (CMCF) problem. The exact evaluation of the CMCF problem is performed using the Simplex method. The parameter tuning for the proposed algorithm is done by means of design of experiments approach. The performance of the proposed algorithm is evaluated by solving different benchmark instances. The results of the proposed algorithm show that it is able to obtain better solutions in comparison with previous methods in the literature.

Lagrangian Bounds and a Heuristic for the Two-Stage Capacitated Facility Location Problem

2012 ◽  
Vol 1 (1) ◽  
pp. 59-71 ◽  
Author(s):  
Igor Litvinchev ◽  
Edith L. Ozuna
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Computational Study ◽  
Facility Location Problem ◽  
Mixed Integer ◽  
Variable Cost ◽  
Fixed Cost ◽  
Two Stage ◽  
Capacitated Facility Location Problem ◽  
Capacitated Facility Location

In the two-stage capacitated facility location problem, a single product is produced at some plants in order to satisfy customer demands. The product is transported from these plants to some depots and then to the customers. The capacities of the plants and depots are limited. The aim is to select cost minimizing locations from a set of potential plants and depots. This cost includes fixed cost associated with opening plants and depots, and variable cost associated with both transportation stages. In this work, two different mixed integer linear programming formulations are considered for the problem. Several Lagrangian relaxations are analyzed and compared, and a Lagrangian heuristic producing feasible solutions is presented. The results of a computational study are reported.

A Review of Optimization Scheduling and New Research Focuses of Logistics

2013 ◽  
Vol 869-870 ◽  
pp. 272-275
Author(s):  
Mei Xiao ◽  
Zhen Rong Zhang ◽  
Zhi Hui Ge
Keyword(s):  
Location Problem ◽  
Transportation Cost ◽  
Third Party ◽  
Cold Chain ◽  
Scheduling Problem ◽  
Third Party Logistics ◽  
Logistics Enterprise ◽  
Loading Problem ◽  
New Research ◽  
Optimization Scheduling

we have presented the main optimization scheduling issues in logistics, including the vehicle scheduling problem (VSP), the goods loading problem, the location problem, the stochastic loader problem and the logistics enterprise transportation cost problem. Some new research focuses such as third party logistics (TPL), cloud logistics and cold-chain logistics have also been discussed.

Sign in / Sign up

Export Citation Format

Share Document