An exact and a heuristic approach for the transportation-p-facility location problem

Date

2020-01-30

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

176
views

0
downloads

The delineation of the transportation network is a strategic issue for all over the place. The problem of locating new facilities among several existing facilities and minimizing the total transportation cost are the main topics of the location network system. This paper addresses the transportation-p-facility location problem (T-p-FLP) which makes a connection between the facility location problem and the transportation problem, where p corresponds to the number of facilities. The T-p-FLP is a generalization of the classical transportation problem in which we have to seek where and how we impose the p-number of facilities such that the total transportation cost from existing facility sites to the potential facility sites will be minimized. The exact approach, based on the iterative procedure, and a heuristic approach as applied to the T-p-FLP are discussed and corresponding results are compared. An experimental example is incorporated to explore the efficiency and effectiveness of our proposed study in reality. Finally, a summary is given together with suggestions for future studies.

Subject Keywords

Management Information Systems, Information Systems

URI

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

Journal

COMPUTATIONAL MANAGEMENT SCIENCE

DOI

https://doi.org/10.1007/s10287-020-00363-8

Collections

Graduate School of Applied Mathematics, Article

Suggestions

OpenMETU
Core

A genetic algorithm for the location-routing problem with time windows Özgönenç, Hande; Meral, Fatma Sedef; Department of Industrial Engineering (2006) The emphasis on minimizing the logistics costs to decrease overall system costs has led the researchers to consider the interdependencies between the decisions of locating facilities and planning the routes from those facilities. The location-routing problems considering this issue are the subject of this thesis study. A two-level hierarchical distribution system is considered in which goods are delivered from the sources (plants) to the facilities (depots) and then from the facilities to the customers. The...
A Parallel Algorithm for UAV Flight Route Planning on GPU Sanci, Seckin; İşler, Veysi (Springer Science and Business Media LLC, 2011-12-01) Aerial surveillance missions require a geographical region known as the area of interest to be inspected. The route that the aerial reconnaissance vehicle will follow is known as the flight route. Flight route planning operation has to be done before the actual mission is executed. A flight route may consist of hundreds of pre-defined geographical positions called waypoints. The optimal flight route planning manages to find a tour passing through all of the waypoints by covering the minimum possible distanc...
A computation-implementation parallelization approach to the vehicle loading and routing problem Çavdar, Bahar; Sokol, Joel (Wiley, 2019-01-01) In this article, we address a version of the capacitated vehicle routing problem where there is a constraint on the total time that can be spent on computing delivery routes and loading the vehicles. This problem, which we call the vehicle loading and routing problem (VLRP), can arise, for example, in the delivery of small, quick-turnaround orders from a warehouse. We propose a computation-implementation parallelization (CIP) approach to solving large VLRP instances, and present computational results showin...
Enhancing ebXML registries to make them OWL aware Doğaç, Asuman; Kabak, Y; Laleci, GB; Mattocks, C; Najmi, F; Pollock, J (Springer Science and Business Media LLC, 2005-07-01) ebXML is a standard from OASIS and UN/CEFACT which specifies an infrastructure to facilitate electronic business. In this paper, we address how ebXML registry semantics support can be further enhanced to make it OWL aware. OWL constructs are represented through ebXML registry information model constructs, and stored procedures are defined in the ebXML registry for processing the OWL semantics. These predefined stored queries provide the necessary means to exploit the enhanced semantics stored in the registr...
Geographical information systems based microzonation map of Eskişehir downtown area Kolat, Çağıl; Doyuran, Vedat; Department of Geological Engineering (2004) The purpose of this study is to prepare a geotechnical microzonation map regarding the suitability of the residential areas in Eskisehir downtown area. In order to obtain the microzonation map, Geographical Information Systems (GIS) based Multicriteria Decision Analysis (MCDA) is used. For this analysis, the slope, flood susceptibility, soil, depth to groundwater table, swelling potential and liquefaction potential layers are prepared. The weight values to the layers and rank values to the classes of each l...

Citation Formats

S. K. Das, S. K. Roy, and G. W. Weber, “An exact and a heuristic approach for the transportation-p-facility location problem,” COMPUTATIONAL MANAGEMENT SCIENCE, pp. 0–0, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57252.