A Heuristic for Obtaining and Initial Solution for the Transportation Problem

Date

1990-9

Author

Kirca, Ömer
Şatır, Ahmet

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

269
views

0
downloads

A heuristic for obtaining an initial solution for the transportation problem is presented. Comparison of findings obtained by the new heuristic and Vogel's approximation method (VAM) are tabulated for 480 examples. Superior performance of the new heuristic over VAM is discussed in terms of total costs obtained, number of iterations required to reach the final solution, and CPU time required to solve the problems. Experimental design aspects are also presented.

Subject Keywords

Marketing, Management Science and Operations Research, Strategy and Management, Management Information Systems

URI

https://www.jstor.org/stable/2583502?origin=crossref&seq=1#metadata_info_tab_contents
https://hdl.handle.net/11511/51417

Journal

The Journal of the Operational Research Society

DOI

https://doi.org/10.2307/2583502

Collections

Department of Economics, Article

Suggestions

OpenMETU
Core

An interactive approach for multiobjective decision making Koksalan, M; Karasakal, Esra (Informa UK Limited, 2006-05-01) We develop an interactive approach for multiobjective decision-making problems, where the solution space is defined by a set of constraints. We first reduce the solution space by eliminating some undesirable regions. We generate solutions (partition ideals) that dominate portions of the efficient frontier and the decision maker (DM) compares these with feasible solutions. Whenever the decision maker prefers a feasible solution, we eliminate the region dominated by the partition ideal. We then employ an inte...
A visual interactive approach for multiple criteria decision making with monotone utility functions Köksalan, Mustafa Murat; Rizi, O (Informa UK Limited, 2001-06-01) We consider the problem of choosing the best of a set of alternatives where each alternative is evaluated on multiple criteria. We develop a visual interactive approach assuming that the decision maker (DM) has a general monotone utility function. The approach partitions the criteria space into nonoverlapping cells. The DM uses various graphical aids to move between cells and to further manipulate selected cells with the goal of creating cells that have ideal points less preferred than an alternative. When ...
AN APPROACH FOR FINDING THE MOST PREFERRED ALTERNATIVE IN THE PRESENCE OF MULTIPLE CRITERIA Köksalan, Mustafa Murat; TANER, OV (Elsevier BV, 1992-07-10) An interactive approach for discrete multiple criteria decision making problems is developed. The approach requires the decision maker to compare pairs of presented alternatives. These alternatives may be existing alternatives or dummy alternatives created from existing alternatives. Inferior alternatives are sequentially eliminated by either using the responses of the decision maker directly or by constructing cones of inferior solutions based on these responses. The approach converges to the most preferre...
A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems ÖZPEYNİRCİ, SELİN; Azizoğlu, Meral (Informa UK Limited, 2010-05-01) This study considers the operation assignment and capacity allocation problem in flexible manufacturing systems. A set of operations is selected to be processed and assigned to the machines together with their required tools. The purchase or usage of the required tools incurs a cost. The machines have scarce time and tool magazine capacities. The objective is to maximize the total weight of the assigned operations minus the total tooling costs. We use Lagrangean relaxation approach to obtain upper and lower...
A NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM KIRCA, O; KOKTEN, M (Elsevier BV, 1994-06-09) In this paper a framework for a new heuristic approach for solving the single level multi-item capacitated dynamic lot sizing problem is presented. The approach uses an iterative item-by-item strategy for generating solutions to the problem. In each iteration a set of items are scheduled over the planning horizon and the procedure terminates when all items are scheduled. An algorithm that implements this approach is developed in which in each iteration a single item is selected and scheduled over the planni...

Citation Formats

Ö. Kirca and A. Şatır, “A Heuristic for Obtaining and Initial Solution for the Transportation Problem,” The Journal of the Operational Research Society, 1990, Accessed: 00, 2020. [Online]. Available: https://www.jstor.org/stable/2583502?origin=crossref&seq=1#metadata_info_tab_contents.