Heuristic approaches for solid transportation-p-facility location problem

Date

2020-09-01

Author

Das, Soumen Kumar
Roy, Sankar Kumar
Weber, Gerhard Wilhelm

Metadata

Show full item record

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

Item Usage Stats

263
views

0
downloads

Determining optimum places for the facilities and optimum transportation from existing sites to the facilities belongs to the main problems in supply chain management. Thesolid transportation-p-facility location problem(ST-p-FLP) is an integration between thefacility location problemand thesolid transportation problem(STP). This paper delineates the ST-p-FLP, a generalization of the classical STP in which location ofp-potential facility sites are sought so that the total transportation cost by means of conveyances from existing facility sites to potential facility sites will be minimized. This is one of the most important problems in the transportation systems and the location research areas. Two heuristic approaches are developed to solve such type of problem: a locate-allocate heuristic and an approximate heuristic. Thereafter, the performance of the proposed model and the heuristics are evaluated by an application example, and the obtained results are compared. Moreover, a sensitivity analysis is introduced to investigate the resiliency of the proposed model. Finally, conclusions and an outlook to future research works are provided.

Subject Keywords

Management Science and Operations Research

URI

https://hdl.handle.net/11511/51798

Journal

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH

DOI

https://doi.org/10.1007/s10100-019-00610-7

Collections

Graduate School of Applied Mathematics, Article

Suggestions

OpenMETU
Core

Heuristics for multi-item two-echelon spare parts inventory control subject to aggregate and individual service measures Topan, Engin; Bayındır, Zeynep Pelin; Tan, Tarkan (Elsevier BV, 2017-01-01) We consider a multi-item two-echelon spare parts inventory system in which the central warehouse operates under a (Q, R) policy and local warehouses implement (S-1,S) policy. The objective is to find the policy parameters minimizing expected system-wide inventory holding and fixed ordering subject to aggregate and individual response time constraints. Using an exact evaluation we provide a very efficient and effective heuristic, and also a tight lower bound for real-world, large-scale two-echelon spare part...
Heuristics for operational fixed job scheduling problems with working and spread time constraints Eliiyi, Deniz Tursel; Azizoğlu, Meral (Elsevier BV, 2011-07-01) Operational fixed job scheduling problems select a set of jobs having fixed ready and processing times and schedule the selected jobs on parallel machines so as to maximize the total weight. In this study, we consider working time and spread time constrained versions of the operational fixed job scheduling problems. The working time constraints limit the total processing load on each machine. The spread time constraints limit the time between the start of the first job and the finish of the last job on each...
A new approximate evaluation method for two-echelon inventory systems with emergency shipments Oezkan, Erhun; VAN HOUTUM, Geert-Jan; Serin, Yaşar Yasemin (Springer Science and Business Media LLC, 2015-01-01) We consider the inventory control of repairable spare parts in a network consisting of a central warehouse, a central repair facility, and multiple local warehouses. Demands for spare parts occur at the local warehouses. If a local warehouse is out of stock, then an arriving demand is satisfied by an emergency shipment from the central warehouse or the central repair facility. Such emergency shipments are common practice for networks that support technical systems with high downtime costs. We develop a new ...
Part-mix allocation between automated and conventional manufacturing KAYALlGIL, M. SINAN (Informa UK Limited, 1990-10) The overall part-mix of a production system is allocated optimally between the existing conventional facilities and planned automated system to be acquired. Approximate mean value analysis (MVA) is utilized to evaluate performance of the automated system under trial part-mix allocations. Cost of processing and WIPs are taken as the sources of operational costs. Cost minimizing route allocations when alternatives exist are handled by a search procedure.
The planar hub location problem: a probabilistic clustering approach İyigün, Cem (Springer Science and Business Media LLC, 2013-12-01) Given the demand between each origin-destination pair on a network, the planar hub location problem is to locate the multiple hubs anywhere on the plane and to assign the traffic to them so as to minimize the total travelling cost. The trips between any two points can be nonstop (no hubs used) or started by visiting any of the hubs. The travel cost between hubs is discounted with a factor. It is assumed that each point can be served by multiple hubs.

Citation Formats

S. K. Das, S. K. Roy, and G. W. Weber, “Heuristic approaches for solid transportation-p-facility location problem,” CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, pp. 939–961, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/51798.