Relevant bibliographies by topics / Vogel's approximation method

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Vogel's approximation method'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Vogel's approximation method.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Vogel's approximation method"

1

Korukoğlu, Serdar, and Serkan Ballı. "An Improved Vogel's Approximation Method for the Transportation Problem." Mathematical and Computational Applications 16, no. 2 (August 1, 2011): 370–81. http://dx.doi.org/10.3390/mca16020370.

Full text
Abstract:
Determining efficient solutions for large scale transportation problems is an important task in operations research. In this study, Vogel’s Approximation Method (VAM) which is one of well-known transportation methods in the literature was investigated to obtain more efficient initial solutions. A variant of VAM was proposed by using total opportunity cost and regarding alternative allocation costs. Computational experiments were carried out to evaluate VAM and improved version of VAM (IVAM). It was seen that IVAM conspicuously obtains more efficient initial solutions for large scale transportation problems. Performance of IVAM over VAM was discussed in terms of iteration numbers and CPU times required to reach the optimal solutions.
APA, Harvard, Vancouver, ISO, and other styles
2

MATHIRAJAN, M., and B. MEENAKSHI. "EXPERIMENTAL ANALYSIS OF SOME VARIANTS OF VOGEL'S APPROXIMATION METHOD." Asia-Pacific Journal of Operational Research 21, no. 04 (December 2004): 447–62. http://dx.doi.org/10.1142/s0217595904000333.

Full text
Abstract:
This paper presents a variant of Vogel's approximation method (VAM) for transportation problems. The importance of determining efficient solutions for large sized transportation problems is borne out by many practical problems in industries, the military, etc. With this motivation, a few variants of VAM incorporating the total opportunity cost (TOC) concept were investigated to obtain fast and efficient solutions. Computational experiments were carried out to evaluate these variants of VAM. The quality of solutions indicates that the basic version of the VAM coupled with total opportunity cost (called the VAM–TOC) yields a very efficient initial solution. In these experiments, on an average, about 20% of the time the VAM–TOC approach yielded the optimal solution and about 80% of the time it yielded a solution very close to optimal (0.5% loss of optimality). The CPU time required for the problem instances tested was very small (on an average, less than 10 s on a 200 MHz Pentium machine with 64 MB RAM).
APA, Harvard, Vancouver, ISO, and other styles
3

Balakrishnan, Nagraj. "Modified Vogel's approximation method for the unbalanced transportation problem." Applied Mathematics Letters 3, no. 2 (1990): 9–11. http://dx.doi.org/10.1016/0893-9659(90)90003-t.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Syam, Rahmat, S. Sukarna, and Muh Nahdi Alim Asyhari. "Model Transportasi dan Terapannya dalam Optimalisasi Biaya Distribusi Beras Miskin di Kota Makassar oleh Perum Bulog Sub Divre Makassar Tahun 2016." Journal of Mathematics, Computations, and Statistics 2, no. 2 (May 12, 2020): 126. http://dx.doi.org/10.35580/jmathcos.v2i2.12575.

Full text
Abstract:
Penelitian ini membahas tentang model transportasi dan terapannya pada distribusi Beras Miskin (Raskin) di Kota Makassar oleh Perum Bulog Sub Divre Makassar. Data distribusi Raskin di Kota Makassar tahun 2016 diformulasikan dengan Model Transportasi. Berdasarkan model tersebut diperoleh keseimbangan model, dan tabel transportasi distribusi Raskin,. Dengan Metode Least Cost (LC) dan Vogel’s Approximation Method (VAM) diperoleh solusi awal yang fisibel. Berdasarkan perhitungan solusi awal yang fisibel diperoleh solusi optimum menggunakan Metode Batu Loncatan (Stepping Stone Method). Selanjutnya disimulasikan menggunakan aplikasi Pom for Windows. Hasil penelitian ini menunjukkan bahwa dengan penerapan Model Transportasi terjadi penghematan biaya distribusi raskin di kota Makassar tahun 2016 sebesar 1,7% dibandingkan hasil perhitungan Perum Bulog Sub Divre Makassar.Kata Kunci: Model Transportasi, Least Cost (LC), Vogel’s Approximation Method (VAM), Metode Batu Loncatan, Distribusi Raskin, This study discusses the transportation model and its application on the stock of Rice Poor (Raskin) in Makassar City by Perum Bulog Sub Divre Makassar. Data is processed by Transport Model. Based on the model is generated a balance model, and export table Raskin distribution,. By method. (LC) and Vogel's Approximation Method (VAM) obtained a feasible initial solution. The method using the stepping stone method (Stepping Stone method). It is then simulated using the Pom for Windows application. The results of this study indicate with the application of Transportation Model. In the year. Year 2016 amounted to 1.7% of the calculation of Perum Bulog Sub Divre Makassar.Keywords: Transportation Model, Least Cost (LC), Vogel’s Approximation Method (VAM), Stepping Stone Method, Distribution Raskin.
APA, Harvard, Vancouver, ISO, and other styles
5

Sugianto, Welly, and Elva Susanti. "Optimasi OPTIMASI BIAYA TRANSPORTASI PADA UKM DI KOTA BATAM." Inaque : Journal of Industrial and Quality Engineering 9, no. 1 (February 24, 2021): 1–19. http://dx.doi.org/10.34010/iqe.v9i1.4278.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
6

Çakmak, Tanyel, and Filiz Ersöz. "METHODOLOGY RECOMMENDATION FOR ONE‐CRITERION TRANSPORTATION PROBLEMS: CAKMAK METHOD." TRANSPORT 22, no. 3 (September 30, 2007): 221–24. http://dx.doi.org/10.3846/16484142.2007.9638128.

Full text
Abstract:
Transportation problems (TP) are one of the most prominent fields of application of the mathematical disciplines to optimization and operations research. In general, there are three starting basic feasible solution methods: Northwest Corner, Least Cost Method, VAM – Vogel's Approximation Method. The three methods differ in the quality of the starting basic solution. In this study, we actually show a new method for starting basic feasible solution to one‐criterion‐transportation problems: Çakmak Method. This method can be used for balanced or unbalanced one-criterion transportation problems, and gives the basic feasible optimum solution accordingly.
APA, Harvard, Vancouver, ISO, and other styles
7

Gujjula, Rico, Sebastian Werk, and Hans-Otto Günther. "A heuristic based on Vogel's approximation method for sequencing mixed-model assembly lines." International Journal of Production Research 49, no. 21 (November 2011): 6451–68. http://dx.doi.org/10.1080/00207543.2010.527384.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sikkannan, Krishna Prabha, and Vimala Shanmugavel. "Sorting Out Fuzzy Transportation Problems via ECCT and Standard Deviation." International Journal of Operations Research and Information Systems 12, no. 2 (April 2021): 1–14. http://dx.doi.org/10.4018/ijoris.20210401.oa1.

Full text
Abstract:
A well-organized arithmetical procedure entitled standard deviation is employed to find the optimum solution in this paper. This technique has been divided into two parts. The first methodology deals with constructing the entire contingency cost table, and the second deals with optimum allocation. In this work, the method of magnitude is used for converting fuzzy numbers into crisp numbers as this method is better than the existing methods. This technique gives a better optimal solution than other methods. A numerical example for the new method is explained, and the authors compared their method with existing methods such as north west corner method, least cost method, and Vogel's approximation method.
APA, Harvard, Vancouver, ISO, and other styles
9

Hedid, Manal, and Rachid Zitouni. "Solving the four index fully fuzzy transportation problem." Croatian Operational Research Review 11, no. 2 (2020): 199–215. http://dx.doi.org/10.17535/crorr.2020.0016.

Full text
Abstract:
In this paper, we will solve the four index fully fuzzy transportation problem (\textit{FFTP$_{4}$}) with some adapted classical methods. All problem's data will be presented as fuzzy numbers. In order to defuzificate these data, we will use the ranking function procedure. Our method to solve the \textit{FFTP$_{4}$} composed of two phases; in the first one, we will use an adaptation of well-known algorithms to find an initial feasible solution, which are the least cost, Russell's approximation and Vogel's approximation methods. In the second phase, we will test the optimality of the initial solution, if it is not optimal, we will improve it. A numerical analysis of the proposed methods is performed by solving different examples of different sizes; it is determined that they are stable, robust, and efficient. A proper comparative study between the adapted methods identifies the suitable method for solving \textit{FFTP$_{4}$}.
APA, Harvard, Vancouver, ISO, and other styles
10

Afiani, Marie, Susi Setiawani, and Toto Bara Setiawan. "PENERAPAN MODIFIED VOGEL'S APPROXIMATION METHOD (MVAM) UNTUK MEMINIMUMKAN BIAYA TRANSPORTASI (STUDI KASUS: PABRIK TAHU TAUFIK)." Jurnal Matematika, Statistika dan Komputasi 16, no. 2 (December 19, 2019): 143. http://dx.doi.org/10.20956/jmsk.v16i2.7349.

Full text
Abstract:
This research aims to determine the tofu product distribution transportation model at Taufik Tofu Factory. This type of research is applied research with a quantitative approach. The method used to solve transportation problems in this study is the Modified Vogel’s Approximation Method (MVAM) and optimized using the Modified Distribution (MODI) method. The results of this study indicate that the application of MVAM at the Taufik Tofu Factory provides a more minimum solution for calculating transportation costs, both in equilibrium and non-equilibrium problems. MVAM provides the same transportation costs as the optimal solution for the simplex method, which is equal to Rp1.164.911,00 for equilibrium problems and Rp2.176.838,00 for unequal problems. These results have been tested for optimism using MODI and better than the real cost calculations issued by the factory.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Vogel's approximation method"

1

Jusevičienė, Kristina. "Krovinių srautų modeliavimas uždaroje logistikos sistemoje." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2006. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20060606_080022-58032.

Full text
Abstract:
We present an optimization procedure for solving the vehicle routing problem with a fixed heterogeneous fleet of vehicle. We want to minimize the passage price. We look and probe these methods: minimal element, Vogel’s Approximation and heuristic. The modeling vehicle routing problem is based on mathematical formulation. This paper present very well known problems – TSP Traveling Salesperson Problem and M-TSP. Vehicle routing problem is liked M-TSP with some specification, vehicle with a fixed carrying capacity must deliver order of goods to n customers from a single depot. Knowing the distance between customers, the problem is to find tours for the vehicles in such a way that: the total distance traveled by the vehicles is minimized, only one vehicle handles the deliveries for a given customer, the total quantity of goods that a single vehicle delivers cannot be larger than cars capacity.
APA, Harvard, Vancouver, ISO, and other styles
2

KUČEROVÁ, Lucie. "Uplatnění metod operační analýzy při optimalizaci dopravy." Master's thesis, 2008. http://www.nusl.cz/ntk/nusl-45993.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Vogel's approximation method"

1

"Vogel's Approximation Method (VAM)." In Encyclopedia of Operations Research and Management Science, 1630. Boston, MA: Springer US, 2013. http://dx.doi.org/10.1007/978-1-4419-1153-7_200907.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pratihar, Jayanta, Ranjan Kumar, Arindam Dey, and Said Broumi. "Transportation Problem in Neutrosophic Environment." In Advances in Data Mining and Database Management, 180–212. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-1313-2.ch007.

Full text
Abstract:
The transportation problem (TP) is popular in operation research due to its versatile applications in real life. Uncertainty exists in most of the real-life problems, which cause it laborious to find the cost (supply/demand) exactly. The fuzzy set is the well-known field for handling the uncertainty but has some limitations. For that reason, in this chapter introduces another set of values called neutrosophic set. It is a generalization of crisp sets, fuzzy set, and intuitionistic fuzzy set, which is handle the uncertain, unpredictable, and insufficient information in real-life problem. Here consider some neutrosophic sets of values for supply, demand, and cell cost. In this chapter, extension of linear programming principle, extension of north west principle, extension of Vogel's approximation method (VAM) principle, and extended principle of MODI method are used for solving the TP with neutrosophic environment called neutrosophic transportation problem (NTP), and these methods are compared using neutrosophic sets of value as well as a combination of neutrosophic and crisp value for analyzing the every real-life uncertain situation.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Vogel's approximation method"

1

Selmair, Maximilian, Alexander Swinarew, Klaus-Jürgen Meier, and Yi Wang. "Solving Non-Quadratic Matrices In Assignment Problems With An Improved Version Of Vogel's Approximation Method." In 33rd International ECMS Conference on Modelling and Simulation. ECMS, 2019. http://dx.doi.org/10.7148/2019-0261.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Selmair, Maximilian, Sascha Hamzehi, and Klaus-Juergen Meier. "Evaluation Of Algorithm Performance For Simulated Square And Non-Square Logistic Assignment Problems." In 35th ECMS International Conference on Modelling and Simulation. ECMS, 2021. http://dx.doi.org/10.7148/2021-0016.

Full text
Abstract:
The optimal allocation of transportation tasks to a fleet of vehicles, especially for large-scale systems of more than 20 Autonomous Mobile Robots (AMRs), remains a major challenge in logistics. Optimal in this context refers to two criteria: how close a result is to the best achievable objective value and the shortest possible computational time. Operations research has provided different methods that can be applied to solve this assignment problem. Our literature review has revealed six commonly applied methods to solve this problem. In this paper, we compared three optimal methods (Integer Linear Programming, Hungarian Method and the Jonker Volgenant Castanon algorithm) to three three heuristic methods (Greedy Search algorithm, Vogel’s Approximation Method and Vogel’s Approximation Method for non-quadratic Matrices). The latter group generally yield results faster, but were not developed to provide optimal results in terms of the optimal objective value. Every method was applied to 20.000 randomised samples of matrices, which differed in scale and configuration, in simulation experiments in order to determine the results’ proximity to the optimal solution as well as their computational time. The simulation results demonstrate that all methods vary in their time needed to solve the assignment problem scenarios as well as in the respective quality of the solution. Based on these results yielded by computing quadratic and non-quadratic matrices of different scales, we have concluded that the Jonker Volgenant Castanon algorithm is deemed to be the best method for solving quadratic and non-quadratic assignment problems with optimal precision. However, if performance in terms of computational time is prioritised for large non-quadratic matrices (50×300 and larger), the Vogel’s Approximation Method for non-quadratic Matrices generates faster approximated solutions.
APA, Harvard, Vancouver, ISO, and other styles
3

Jamaluddin, Dindin, Elis Ratna Wulan, and Agus Maolana Roby. "Determine the Elective Courses in Islamic Higher Education Using Transportation Vogel’s Approximation Method." In 1st International Conference on Mathematics and Mathematics Education (ICMMEd 2020). Paris, France: Atlantis Press, 2021. http://dx.doi.org/10.2991/assehr.k.210508.044.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kalonda, Paul Olamba, and Avoki Michel Omekanda. "Kruskal's Algorithm, Vogel's Approximation and Modified Distribution Methods for the Design of Optimal Electrical Networks in the Democratic Republic of Congo." In 2020 IEEE PES/IAS PowerAfrica. IEEE, 2020. http://dx.doi.org/10.1109/powerafrica49420.2020.9219801.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Awitasari, Dhea Andryani, Khusnul Hajar Nuansari, Sumayyah, and Muhammad Muhajir. "Using Vogel’s approximation method to find the best delivery system for the “rice for a prosperous people” (RASTRA) program (case study: Surakarta residency)." In THE 8TH ANNUAL BASIC SCIENCE INTERNATIONAL CONFERENCE: Coverage of Basic Sciences toward the World’s Sustainability Challanges. Author(s), 2018. http://dx.doi.org/10.1063/1.5062772.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Vogel's approximation method' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography