Dynamic <i>p</i>+<i>q</i> maximal hub location problem for freight transportation planning with rational markets

Alizadeh, Roghayyeh; Nishi, Tatsushi

doi:10.1177/1687814018822934

Cited by 7 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This problem was addressed by Lin et al [32], focusing mainly on solving methods of this complex extension of MCLP. Alizadeh and Nishi [33] developed a multi-period maximal hub location model that allows the number of located hubs to be expanded in upcoming time periods when the demands are increasing. As the authors have considered the customers' preferences in choosing the cheapest price for multiple carriers, their developed model is a bi-level model in a Stackelberg game framework, who used dual based and Karush-Kuhn-Tucker based reformulations to achieve single-level problem and solved the single level problem with a Benders decomposition-based method.…”

Section: Literature Reviewmentioning

confidence: 99%

Hybrid Set Covering and Dynamic Modular Covering Location Problem: Application to an Emergency Humanitarian Logistics Problem

Alizadeh

Nishi

2020

Applied Sciences

Self Cite

View full text Add to dashboard Cite

This paper presents an extension of the covering location problem as a hybrid covering model that utilizes the set covering and maximal covering location problems. The developed model is a multi-period model that considers strategic and tactical planning decisions. Hybrid covering location problem (HCLP) determines the location of the capacitated facilities by using dynamic set covering location problem as strategic decisions and assigns the constructive units of facilities and allocates the demand points by using dynamic modular capacitated maximal covering location problem as tactical decisions. One of the applications of the proposed model is locating first aid centers in humanitarian logistic services that have been addressed by studying a threat case study in Japan. In addition to validating the developed model, it has been compared to other possible combined problems, and several randomly generated examples have been solved. The results of the case study and model validation tests approve that the main hybrid developed model (HCLP) is capable of providing better coverage percentage compared to conventional covering models and other hybrid variants.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Hybrid Set Covering and Dynamic Modular Covering Location Problem: Application to an Emergency Humanitarian Logistics Problem

Alizadeh

Nishi

2020

Applied Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

“…Yue and You 22 proposed an optimization approach for a multi-echelon supply chain in a Stackelberg game using a piecewise linear approximation to the nonconvex functions. Alizadeh and Nishi 23 addressed a dynamic p + q maximal hub location problem and an efficient decomposition method using the duality-based reformulation. Liu et al 24 studied a solution approach to a problem in the Stackelberg game.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Then, the unique equilibrium solution is obtained by (w s T , Q r T ) which satisfies both equations (23) and (26).…”

Section: Analysis Of Equilibrium For Supplier and Retailermentioning

confidence: 99%

Design of optimal quantity discounts for multi-period bilevel production planning under uncertain demands

Yoshida

Nishi

Zhang

et al. 2020

Advances in Mechanical Engineering

Self Cite

View full text Add to dashboard Cite

The analysis of the quantity discount of the decentralized supply chain has been studied only for single-period planning models. This article presents the design of an optimal quantity discounts for multi-period bilevel production planning for two-echelon supply chains under demand uncertainty. In order to derive an optimal contract for multi-period production planning, the cumulative order quantity and production quantity are introduced. From our proposed model, a Stackelberg equilibrium is analytically derived for the supply chain when the supplier is the leader and the retailer is the follower. An optimal discount contract is analytically designed through the optimal solution of the centralized problem. Computational results show the effectiveness of the proposed discount contract under demand uncertainty.

show abstract

“…Developing a model for each of the applications with the specific real situation, resulted in various extensions developed for the covering models since their introduction. The hierarchical MCLP [2,3], probabilistic MCLP [4,5] MCLP in competitive environments [6], large-scale dynamic MCLP [7], continuous MCLP for natural disasters [8], and maximal hub location problem [9] are some examples among the vast literature of the MCLP. The growing attention and interest in covering location problems are due to their applications.…”

Section: Introductionmentioning

confidence: 99%

Multi-Period Maximal Covering Location Problem with Capacitated Facilities and Modules for Natural Disaster Relief Services

et al. 2021

Self Cite

View full text Add to dashboard Cite

The paper aims to study a multi-period maximal covering location problem with the configuration of different types of facilities, as an extension of the classical maximal covering location problem (MCLP). The proposed model can have applications such as locating disaster relief facilities, hospitals, and chain supermarkets. The facilities are supposed to be comprised of various units, called the modules. The modules have different sizes and can transfer between facilities during the planning horizon according to demand variation. Both the facilities and modules are capacitated as a real-life fact. To solve the problem, two upper bounds—(LR1) and (LR2)—and Lagrangian decomposition (LD) are developed. Two lower bounds are computed from feasible solutions obtained from (LR1), (LR2), and (LD) and a novel heuristic algorithm. The results demonstrate that the LD method combined with the lower bound obtained from the developed heuristic method (LD-HLB) shows better performance and is preferred to solve both small- and large-scale problems in terms of bound tightness and efficiency especially for solving large-scale problems. The upper bounds and lower bounds generated by the solution procedures can be used as the profit approximation by the managerial executives in their decision-making process.

show abstract

Dynamic p+q maximal hub location problem for freight transportation planning with rational markets

Cited by 7 publications

References 27 publications

Hybrid Set Covering and Dynamic Modular Covering Location Problem: Application to an Emergency Humanitarian Logistics Problem

Hybrid Set Covering and Dynamic Modular Covering Location Problem: Application to an Emergency Humanitarian Logistics Problem

Design of optimal quantity discounts for multi-period bilevel production planning under uncertain demands

Multi-Period Maximal Covering Location Problem with Capacitated Facilities and Modules for Natural Disaster Relief Services

Contact Info

Product

Resources

About