Next Article in Journal / Special Issue
A Heuristic Approach to Solving the Train Traffic Re-Scheduling Problem in Real Time
Previous Article in Journal
Linking and Cutting Spanning Trees
Previous Article in Special Issue
Evaluating Typical Algorithms of Combinatorial Optimization to Solve Continuous-Time Based Scheduling Problem
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(4), 54; https://doi.org/10.3390/a11040054

Dual Market Facility Network Design under Bounded Rationality

1
Department of Industrial & Systems Engineering, Indian Institute of Technology, Kharagpur 721302, India
2
Durham University Business School, Durham University, Durham DH1 3LB, UK
3
O9 Solutions, Bangalore 560037, India
*
Author to whom correspondence should be addressed.
Received: 18 February 2018 / Revised: 12 April 2018 / Accepted: 16 April 2018 / Published: 20 April 2018
(This article belongs to the Special Issue Algorithms for Scheduling Problems)
Full-Text   |   PDF [3782 KB, uploaded 3 May 2018]   |  

Abstract

A number of markets, geographically separated, with different demand characteristics for different products that share a common component, are analyzed. This common component can either be manufactured locally in each of the markets or transported between the markets to fulfill the demand. However, final assemblies are localized to the respective markets. The decision making challenge is whether to manufacture the common component centrally or locally. To formulate the underlying setting, a newsvendor modeling based approach is considered. The developed model is solved using Frank-Wolfe linearization technique along with Benders’ decomposition method. Further, the propensity of decision makers in each market to make suboptimal decisions leading to bounded rationality is considered. The results obtained for both the cases are compared. View Full-Text
Keywords: facility network design; newsvendor model; bounded rationality; non-linear programming; decomposition method; linearization technique facility network design; newsvendor model; bounded rationality; non-linear programming; decomposition method; linearization technique
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Mogale, D.G.; Lahoti, G.; Jha, S.B.; Shukla, M.; Kamath, N.; Tiwari, M.K. Dual Market Facility Network Design under Bounded Rationality. Algorithms 2018, 11, 54.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top