scholarly journals Determination of Transportation Fleet Size using The Combination of Adjusted SPT Rule and Linear Programming Method

2016 ◽  
Vol 3 (3) ◽  
pp. 138
Author(s):  
Pujo Saroyo ◽  
M.P.A Wibowo

<p>In a very competitive industry, XYZ Ltd. needs to have an effective, efficient and reliable logistics fleet management. The fleets should be able to help the company serve the market demands and guarantee the distribution of its products. This research analyzed and determined the by-truck transportation fleet size of XYZ Ltd using the combination of adjusted SPT Rule and linear programming method. The results showed that the product delivery’s scheduling was arranged by operating a fleet of 13 tronton trucks and 25 trailer trucks, with the scheduling of delivery resulting in maximum makespan of 6.98 days and an average flow-time per shipment of 3.83 days. <br /><strong>Keywords</strong>: Fleet Management, Logistics Transportation, Adjusted SPT</p>

2019 ◽  
Vol 8 (8) ◽  
pp. 334 ◽  
Author(s):  
Zhai ◽  
Liu ◽  
Du ◽  
Wu

In order to improve the dynamic optimization of fleet size and standardized management of dockless bike-sharing, this paper focuses on using the Markov stochastic process and linear programming method to solve the problem of bike-sharing fleet size and rebalancing. Based on the analysis of characters of bike-sharing, which are irreducible, aperiodic and positive-recurrence, we prove that the probability limits the state (steady-state) of bike-sharing Markov chain only exists and is independent of the initial probability distribution. Then a new “Markov chain dockless bike-sharing fleet size solution” algorithm is proposed. The process includes three parts. Firstly, the irreducibility of the bike-sharing transition probability matrix is analyzed. Secondly, the rank-one updating method is used to construct the transition probability random prime matrix. Finally, an iterative method for solving the steady-state probability vector is therefore given and the convergence speed of the method is analyzed. Furthermore, we discuss the dynamic solution of the bike-sharing steady-state fleet size according to the time period, so as improving the practicality of the algorithm. To verify the efficiency of this algorithm, we adopt the linear programming method for bicycle rebalancing analysis. Experiment results show that the algorithm could be used to solve the disordered deployment of dockless bike-sharing.


2019 ◽  
Vol 6 (04) ◽  
Author(s):  
ASHUTOSH UPADHYAYA

A study was undertaken in Bhagwanpur distributary of Vaishali Branch Canal in Gandak Canal Command Area, Bihar to optimally allocate land area under different crops (rice and maize in kharif, wheat, lentil, potato in rabi and green gram in summer) in such a manner that maximizes net return, maximizes crop production and minimizes labour requirement employing simplex linear programming method and Multi-Objective Fuzzy Linear Programming (MOFLP) method. Maximum net return, maximum agricultural production, and minimum labour required under defined constraints (including 10% affinity level of farmers to rice and wheat crops) as obtained employing Simplex method were ` 3.7 × 108, 5.06 × 107 Kg and 66,092 man-days, respectively, whereas Multi-Objective Fuzzy Linear Programming (MOFLP) method yielded compromised solution with net return, crop production and labour required as ` 2.4 × 108, 3.3 × 107Kg and 1,79,313 man-days, respectively. As the affinity level of farmers to rice and wheat crops increased from 10% to 40%, maximum net return and maximum production as obtained from simplex linear programming method and MOFLP followed a decreasing trend and minimum labour required followed an increasing trend. MOFLP may be considered as one of the best capable ways of providing a compromised solution, which can fulfill all the objectives at a time.


2017 ◽  
Vol 51 (22) ◽  
pp. 13086-13094 ◽  
Author(s):  
Hajime Ohno ◽  
Kazuyo Matsubae ◽  
Kenichi Nakajima ◽  
Yasushi Kondo ◽  
Shinichiro Nakamura ◽  
...  

2017 ◽  
Vol 12 (2) ◽  
Author(s):  
Monika Handayani ◽  
Eka Kusuma Dewi

<p>CV. Baja Utama Landasan Ulin is a business entity that manufactures various products using the basic ingredients of iron. In the management of raw materials for the production of common regulatory process raw materials into sections for further processing. This setting is often done manually without doing careful planning, so that at the end of each production process there are many remaining pieces of the raw materials that should be used in production. In addition to the determination of the production is necessary to reference how the product should be made for each type of existing products. This is often an important factor that pushed for the optimization of production planning in determining the number of products for each type of product and raw material consumption.Linear Programming is one of the methods used in production planning to regulate the use of raw materials is limited. Simplex method is part of the linear programming method that can be used in the production planning system implementation. Simplex method identifies an initial basic solution and then move systematically to other basic solution that has the potential to improve the value of the objective function.The calculation result of production planning using the simplex method can be used as a reference in the decision making production planning. By building an application using the simplex method can assist in the calculation of production peencanaan more efficiently and effectively. Accuracy testing system constructed show significant results with great value reached 94% level of accuracy.<br />Keywords: simplex, production planning, the maximum gain, linear programming</p>


Author(s):  
Tayisa Vozniuk ◽  
Olga Mazur

In this article reveals an example of forecasting the volumes of sales goods through ways of implement optimization analysis, that is by linear programming method. For example, volume of production goods for realization her consumers no must to exceed of determined out maximum or to be lower by minimum, what can to foreseeing in this task. For decision tasks of linear programming with a large number of variables and constraints, decomposition methods are used, which allow instead of the original problem to solve tasks of little volume. In general methodology of linear programming together with simplex-method is considered on the example Nemyriv bakery, where determined out profit on unit bakery products, obtained through the optimal ratio of material resources and costs incurred. In analysis and treatment of economic activities the each enterprises, particularly at composition forecast as to volumes of sales goods with aim of receiving profit, linear programming maybe successfully used out for decision tasks with optimization of development and organization trade processes upon regarding the sale of its products. With point of view management a tasks of linear programming – this tasks of optimal using resources. In each event planning of production goods necessity have on attention, which different productions resources (workforce, raw, materials, means of production) are limited, and also which known norm of costs these resources on different kinds goods, or possible are multiples variants to separating production resources. In our work, we ascertained that in analysis, compliance is checked of demand for bakery products to stocks of most-important kinds raw and materials together with costs as most important conditions for receive profit on enterprises and avoiding of excessive and unforeseen losses. With aim of rise efficiency of enterprises activities necessary and further to look at question of renewing assortment goods and increase quality her, increasing volumes of production, maximum of loading production powers equipment, efficiency using of available resources.


Sign in / Sign up

Export Citation Format

Share Document