scholarly journals Multiobjective Scheduling of Remote-Area Employees with Minimum Cost of Transportation

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Hesham K. Alfares
Keyword(s):  
Programming Model ◽  
Optimal Solution ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Solution Procedure ◽  
Primary Objective ◽  
Remote Work ◽  
Optimal Procedures ◽  
Oil Company ◽  
Cost Of Transportation

An integer programming model and optimal solution procedure are presented for assigning employees to the (10, 14) days-off schedule. This schedule is used by a large oil company to schedule employees in remote work locations. The primary objective is to minimize the total number of employees. Since employees are flown to their remote work sites, the company also aims to minimize transportation cost. Therefore, secondary objectives include (1) minimizing the number of active days-off work patterns, (2) consistently using the same set of active days-off patterns, (3) assigning work schedules fairly among employees, and (4) avoiding the use of specialized optimization solvers. A rotation schedule is used in which two scheduling rules are enforced: a minimum proportion of weekend days off needs to be given and a maximum limit on the number of successive workdays cannot be exceeded. Utilizing the problem structure, simple optimal procedures are developed to solve this unique complex scheduling problem.

OPTIMAL FEASIBLE SOLUTIONS TO A ROAD FREIGHT TRANSPORTATION PROBLEM

2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare
Keyword(s):  
Transportation Problem ◽  
Optimal Solution ◽  
Transportation Cost ◽  
North West ◽  
Life Problems ◽  
Basic Feasible Solutions ◽  
Feasible Solutions ◽  
Road Freight Transportation ◽  
The Cost ◽  
Cost Of Transportation

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.

scholarly journals A Hybrid Dynamic Programming for Solving Fixed Cost Transportation with Discounted Mechanism

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Farhad Ghassemi Tari
Keyword(s):  
Dynamic Programming ◽  
Programming Model ◽  
Transportation Network ◽  
Dynamic Programming Algorithm ◽  
Optimal Solution ◽  
Transportation Cost ◽  
Solution Algorithm ◽  
Transportation Costs ◽  
Programming Algorithm ◽  
Fixed Cost

The problem of allocating different types of vehicles for transporting a set of products from a manufacturer to its depots/cross docks, in an existing transportation network, to minimize the total transportation costs, is considered. The distribution network involves a heterogeneous fleet of vehicles, with a variable transportation cost and a fixed cost in which a discount mechanism is applied on the fixed part of the transportation costs. It is assumed that the number of available vehicles is limited for some types. A mathematical programming model in the form of the discrete nonlinear optimization model is proposed. A hybrid dynamic programming algorithm is developed for finding the optimal solution. To increase the computational efficiency of the solution algorithm, several concepts and routines, such as the imbedded state routine, surrogate constraint concept, and bounding schemes, are incorporated in the dynamic programming algorithm. A real world case problem is selected and solved by the proposed solution algorithm, and the optimal solution is obtained.

scholarly journals Comparative Study of Ranking Methods for Fuzzy Transportation

2019 ◽  
pp. 1592-1602
Author(s):  
Sami Kadhem kareem Al thabhawi
Keyword(s):  
Linear Programming ◽  
Comparative Study ◽  
Programming Model ◽  
Optimal Solution ◽  
Transportation Cost ◽  
Basic Solution ◽  
Ranking Methods ◽  
Fuzzy Variables ◽  
Accurate Comparison ◽  
Total Transportation Cost

There are several methods that are used to solve the traditional transportation problems whose units of supply, demand quantities, and cost transportation are known exactly. These methods obtain basic solution, and develop it to the best solution through a series of consecutive calculations to obtain the optimal solution.The steps are more complex with fuzzy variables, so this paper presents the disadvantages of solutions of the traditional ways with existence of variables in the fuzzy form.This paper also presents a comparison between the results that emerged after using different conversion ranking formulas to convert from fuzzy form to crisp form on the same numerical example with a full fuzzy form. The problem has been then converted into a linear programming model, and the BIG-M method to be later used to find the optimal solution that represents the number of units transferred from processing or supply centers to a number of demand centers based on the known cost of transportation.Achieving the goal of the problem is by finding the lowest total transportation cost,while the comparison is based on that value. The results are presented in acomprehensive table that organizes data and results in a way that facilitates quickand accurate comparison. An amendment to one of the order formats was suggested,because it has different results compared to other formulas. One of the rankingequations is modified, because it has different results compared to other methods..

A Humanitarian Green Supply Chain Management Considering Minimum Cost and Time

2021 ◽  
Vol 8 (2) ◽  
pp. 63-82
Author(s):  
Dipanjana Sengupta ◽  
Amrit Das ◽  
Uttam Kumar Bera ◽  
Anirban Dutta
Keyword(s):  
Supply Chain ◽  
Supply Chain Management ◽  
Solution Method ◽  
Real Life ◽  
Optimal Solution ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Chain Management ◽  
Green Transportation ◽  
Humanitarian Supply Chain

Disaster is the sudden problem of the world. There is no time bound. By disaster, all the creatures of the earth are affected. Here, the authors have tried to show some issues which are related to the natural calamities and green transportation. The main investigation of the paper is to describe about humanitarian supply chain management with optimized transportation cost, time, and carbon emission. Here a real-life problem of flood affected area has been chosen. When such disasters happen, quick response can reduce the devastation and save lives, and thus, it requires fulfilling the basic humanitarian needs of the affected population. In such case, organizations should also maintain the emission of the vehicles in safe range to mitigate the further disaster by pollution. A multi-objective solid transportation problem considering cost, time, and emission has been presented here. To solve the problem, this paper has used goal programming method and pareto optimal solution method. A comparison of results is also shown later. Some managerial insights are drawn to describe the situation.

scholarly journals Optimization of sustainability, selling price, and minimum cost transportation in supply chain management of free-range meat chicken in Pasuruan Regency, Indonesia

Food Research ◽  
2020 ◽  
Vol 5 (1) ◽  
pp. 50-56
Author(s):  
N. Nuriyanto ◽  
I. Santoso ◽  
S. Soemarno ◽  
E.R. Lestari
Keyword(s):  
Neural Networks ◽  
Linear Programming ◽  
Artificial Neural Networks ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Selling Price ◽  
Chain Management ◽  
Total Cost ◽  
Free Range ◽  
Cost Of Transportation

The purpose of the study was to analyze the sustainability of supply of free-range meat chicken in Pasuruan Regency, Indonesia and to obtain an optimization model of selling price and transportation costs of the free-range meat chicken. Artificial neural networks was used to analyse the sustainability of free-range meat chicken supply while linear programming was used to optimize the selling price. In addition, Vogel’s approximation was used to obtain the minimum total cost of transportation. The outcome of the analysis showed that the availability of free-range meat chicken in 2022 was estimated around 40, 016.67 tons with a selling price of IDR 28,100/kg. The minimum overall transportation cost was IDR 3,807,000/quintal.

scholarly journals Modeling the Service Network Design Problem in Railway Express Shipment Delivery

Symmetry ◽  
2018 ◽  
Vol 10 (9) ◽  
pp. 391 ◽  
Author(s):  
Siqi Liu ◽  
Boliang Lin ◽  
Jianping Wu ◽  
Yinan Zhao
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Programming Model ◽  
Optimal Solution ◽  
Minimum Cost ◽  
Theory And Practice ◽  
Network Design Problem ◽  
Service Network ◽  
Service Network Design ◽  
Train Services

As air pollution becomes increasingly severe, express trains play a more important role in shifting road freight and reducing carbon emissions. Thus, the design of railway express shipment service networks has become a key issue, which needs to be addressed urgently both in theory and practice. The railway express shipment service network design problem (RESSNDP) not only involves the selection of train services and determination of service frequency, but it is also associated with shipment routing, which can be viewed as a service network design problem (SNDP) with railway characteristics. This paper proposes a non-linear integer programming model (INLP) which aims at finding a service network and shipment routing plan with minimum cost while satisfying the transportation time constraints of shipments, carrying capacity constraints of train services, flow conservation constraint and logical constraints among decision variables. In addition, a linearization technique was adopted to transform our model into a linear one to obtain a global optimal solution. To evaluate the effectiveness and efficiency of our approach, a small trial problem was solved by the state-of-the-art mathematical programming solver Gurobi 7.5.2.

scholarly journals Minimizing the Cost of Transporting Goods Produced in an Integrated Foods Company.

2015 ◽  
Vol 6 ◽  
pp. 106-111
Author(s):  
M M Kembe ◽  
A R Kimbir ◽  
E M Ogbuagu
Keyword(s):  
Optimal Solution ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Distribution Centers ◽  
Net Profit ◽  
Soya Oil ◽  
Average Quantity ◽  
Or Organization ◽  
The Cost ◽  
Transportation Schedule

The transportation cost of goods in any company or organization is a pivotal element in determining the total cost of production and also the net profit that will be made. The main aim of this study is to minimize the cost of transporting goods produced at Grand Cereals Limited, Jos, which is reducing the cost of transportation from the major plant where the goods are produced to the various distribution centers. Data was collected on the average quantity of Brabusco Maize Flour (10 kg), Grand Pure Soya Oil (10 litres), Vita Chicks Pelletized Feeds (25 kg, 9 mm) and Royal Layer Concentrate Feeds (25 kg) produced monthly at the Jos plant, the average quantity demanded by major distributors across the country (Yola, Dutse, Minna, Abuja, Aba, Onitsha, Calabar and Ikeja) and the cost of transporting them. The Vogel's Approximation Method of the TORA Optimization System Software was used in solving the formulated transportation problem, and an optimal solution of N3,427,821.00 was obtained, which reduced the monthly transportation cost by N332,179.00. Furthermore, sensitivity analysis was carried out on the parameters after the optimal solution was obtained, which shows that the optimal solution is strongly sensitive to changes in the problem parameters. It was concluded that this work has reduced the transportation cost of the company and therefore recommended to the management of the company for adoption in planning their transportation schedule at a minimum cost.

scholarly journals Wind Farm Cable Connection Layout Optimization with Several Substations

Energies ◽  
2021 ◽  
Vol 14 (12) ◽  
pp. 3615
Author(s):  
Adelaide Cerveira ◽  
Eduardo J. Solteiro Pires ◽  
José Baptista
Keyword(s):  
Energy Production ◽  
Wind Farm ◽  
Programming Model ◽  
Optimal Solution ◽  
Wind Farms ◽  
Green Energy ◽  
Fossil Energy ◽  
Proposed Model ◽  
Short Time ◽  
Cable Connection

Green energy has become a media issue due to climate changes, and consequently, the population has become more aware of pollution. Wind farms are an essential energy production alternative to fossil energy. The incentive to produce wind energy was a government policy some decades ago to decrease carbon emissions. In recent decades, wind farms were formed by a substation and a couple of turbines. Nowadays, wind farms are designed with hundreds of turbines requiring more than one substation. This paper formulates an integer linear programming model to design wind farms’ cable layout with several turbines. The proposed model obtains the optimal solution considering different cable types, infrastructure costs, and energy losses. An additional constraint was considered to limit the number of cables that cross a walkway, i.e., the number of connections between a set of wind turbines and the remaining wind farm. Furthermore, considering a discrete set of possible turbine locations, the model allows identifying those that should be present in the optimal solution, thereby addressing the optimal location of the substation(s) in the wind farm. The paper illustrates solutions and the associated costs of two wind farms, with up to 102 turbines and three substations in the optimal solution, selected among sixteen possible places. The optimal solutions are obtained in a short time.

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.

Sign in / Sign up

Export Citation Format

Share Document