scholarly journals Solving a Location, Allocation, and Capacity Planning Problem with Dynamic Demand and Response Time Service Level

2014 ◽  
Vol 2014 ◽  
pp. 1-25 ◽  
Author(s):  
Carrie Ka Yuk Lin
Keyword(s):  
Response Time ◽  
Travel Time ◽  
Service Level ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
Planning Problem ◽  
Time Requirement ◽  
Time Service ◽  
Location Allocation ◽  
Total Capacity

Logistic systems with uncertain demand, travel time, and on-site processing time are studied here where sequential trip travel is allowed. The relationship between three levels of decisions: facility location, demand allocation, and resource capacity (number of service units), satisfying the response time requirement, is analysed. The problem is formulated as a stochastic mixed integer program. A simulation-based hybrid heuristic is developed to solve the dynamic problem under different response time service level. An initial solution is obtained from solving static location-allocation models, followed by iterative improvement of the three levels of decisions by ejection, reinsertion procedure with memory of feasible and infeasible service regions. Results indicate that a higher response time service level could be achieved by allocating a given resource under an appropriate decentralized policy. Given a response time requirement, the general trend is that the minimum total capacity initially decreases with more facilities. During this stage, variability in travel time has more impact on capacity than variability in demand arrivals. Thereafter, the total capacity remains stable and then gradually increases. When service level requirement is high, the dynamic dispatch based on first-come-first-serve rule requires smaller capacity than the one by nearest-neighbour rule.

A Note on a Conceptual Framework for Dynamic Location—Allocation Analysis

1976 ◽  
Vol 8 (4) ◽  
pp. 443-446
Author(s):  
W G Truscott
Keyword(s):  
Conceptual Framework ◽  
Integer Program ◽  
Original Version ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
Location Allocation ◽  
Dynamic Location

This note examines a previously published model for dynamic location—allocation analysis. The usefulness of this model is enhanced by reformulating the problem as an operational zero-one, mixed-integer program while retaining the intent of the original version.

Reducing the number of response time service level objective violations by a cloud-HPC convergence scheduler

2017 ◽  
Vol 30 (12) ◽  
pp. e4352 ◽  
Author(s):  
Alessandro Kraemer ◽  
Carlos Maziero ◽  
Olivier Richard ◽  
Denis Trystram
Keyword(s):  
Response Time ◽  
Service Level ◽  
Time Service

scholarly journals Dynamic Rebalancing Dockless Bike-Sharing System based on Station Community Discovery

2021 ◽  
Author(s):  
Jingjing Li ◽  
Qiang Wang ◽  
Wenqi Zhang ◽  
Donghai Shi ◽  
Zhiwei Qin
Keyword(s):  
Supply And Demand ◽  
Service Level ◽  
Integer Program ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
Real World Data ◽  
Community Discovery ◽  
Bike Sharing ◽  
Total Profit ◽  
Spatio Temporal

Influenced by the era of the sharing economy and mobile payment, Dockless Bike-Sharing System (Dockless BSS) is expanding in many major cities. The mobility of users constantly leads to supply and demand imbalance, which seriously affects the total profit and customer satisfaction. In this paper, we propose the Spatio-Temporal Mixed Integer Program (STMIP) with Flow-graphed Community Discovery (FCD) approach to rebalancing the system. Different from existing studies that ignore the route of trucks and adopt a centralized rebalancing, our approach considers the spatio-temporal information of trucks and discovers station communities for truck-based rebalancing. First, we propose the FCD algorithm to detect station communities. Significantly, rebalancing communities decomposes the centralized system into a distributed multi-communities system. Then, by considering the routing and velocity of trucks, we design the STMIP model with the objective of maximizing total profit, to find a repositioning policy for each station community. We design a simulator built on real-world data from DiDi Chuxing to test the algorithm performance. The extensive experimental results demonstrate that our approach outperforms in terms of service level, profit, and complexity compared with the state-of-the-art approach.

scholarly journals Application of Two-Phase Fuzzy Optimization Approach to Multiproduct Multistage Integrated Production Planning with Linguistic Preference under Uncertainty

2015 ◽  
Vol 2015 ◽  
pp. 1-20 ◽  
Author(s):  
Shan Lu ◽  
Hongye Su ◽  
Lian Xiao ◽  
Li Zhu
Keyword(s):  
Production Planning ◽  
Programming Model ◽  
Fuzzy Optimization ◽  
Service Level ◽  
Mixed Integer ◽  
Planning Problem ◽  
Optimization Approach ◽  
Two Phase ◽  
Steel Rolling ◽  
Solution Approach

This paper tackles the challenges for a production planning problem with linguistic preference on the objectives in an uncertain multiproduct multistage manufacturing environment. The uncertain sources are modelled by fuzzy sets and involve those induced by both the epistemic factors of process and external factors from customers and suppliers. A fuzzy multiobjective mixed integer programming model with different objective priorities is proposed to address the problem which attempts to simultaneously minimize the relevant operations cost and maximize the average safety stock holding level and the average service level. The epistemic and external uncertainty is simultaneously considered and formulated as flexible constraints. By defining the priority levels, a two-phase fuzzy optimization approach is used to manage the preference extent and convert the original model into an auxiliary crisp one. Then a novel interactive solution approach is proposed to solve this problem. An industrial case originating from a steel rolling plant is applied to implement the proposed approach. The numerical results demonstrate the efficiency and feasibility to handle the linguistic preference and provide a compromised solution in an uncertain environment.

scholarly journals Robust Train Scheduling Problem with Optimized Maintenance Planning on High-Speed Railway Corridors: The China Case

2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Chuntian Zhang ◽  
Yuan Gao ◽  
Wenjie Li ◽  
Lixing Yang ◽  
Ziyou Gao
Keyword(s):  
Travel Time ◽  
High Speed ◽  
Mode Selection ◽  
Optimal Solution ◽  
Mixed Integer ◽  
Planning Problem ◽  
Scheduling Problem ◽  
Maintenance Planning ◽  
State Variables ◽  
Train Scheduling

Simultaneously considering train scheduling problem and maintenance planning problem with uncertain travel time, we propose a two-stage integrated optimization model for the sunset-departure and sunrise-arrival trains (SDSA-trains). Specifically, in the first stage, we obtain an optimal solution of the SDSA-trains under each scenario, which leads to the minimum total travel time. In the second stage, a robust SDSA-train schedule is generated based on the optimal solutions of the first stage. The key is that we consider two operation modes to solve the conflict between the SDSA-trains and the maintenances. Some state variables are used to deal with train operation mode selection. Furthermore, some linearization techniques are used to formulate a mixed-integer linear programming (MILP) model. Finally, numerical experiments are implemented to prove the effectiveness of the proposed model and optimization method.

scholarly journals A Multi-Echelon Network Design in a Dual-Channel Reverse Supply Chain Considering Consumer Preference

2021 ◽  
Vol 18 (9) ◽  
pp. 4760
Author(s):  
Peng Li ◽  
Di Wu
Keyword(s):  
Supply Chain ◽  
Network Design ◽  
Environmental Sustainability ◽  
Rapid Development ◽  
Consumer Preference ◽  
Service Level ◽  
Mixed Integer ◽  
Reverse Supply Chain ◽  
Related Factors ◽  
Dual Channel

The rapid development of e-commerce technologies has encouraged collection centers to adopt online recycling channels in addition to their existing traditional (offline) recycling channels, such the idea of coexisting traditional and online recycling channels evolved a new concept of a dual-channel reverse supply chain (DRSC). The adoption of DRSC will make the system lose stability and fall into the trap of complexity. Further the consumer-related factors, such as consumer preference, service level, have also severely affected the system efficiency of DRSC. Therefore, it is necessary to help DRSCs to design their networks for maintaining competitiveness and profitability. This paper focuses on the issues of quantitative modelling for the network design of a general multi-echelon, dual-objective DRSC system. By incorporating consumer preference for the online recycling channel into the system, we investigate a mixed integer linear programming (MILP) model to design the DRSC network with uncertainty and the model is solved using the ε-constraint method to derive optimal Pareto solutions. Numerical results show that there exist positive correlations between consumer preference and total collective quantity, online recycling price and the system profits. The proposed model and solution method could assist recyclers in pricing and service decisions to achieve a balance solution for economic and environmental sustainability.

A stochastic mixed integer program to model spatial wildfire behavior and suppression placement decisions with uncertain weather

2016 ◽  
Vol 46 (2) ◽  
pp. 234-248 ◽  
Author(s):  
Erin J. Belval ◽  
Yu Wei ◽  
Michael Bevers
Keyword(s):  
Wildland Fire ◽  
Fire Behavior ◽  
Integer Program ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
Weather Forecasts ◽  
Placement Decisions ◽  
Weather Events ◽  
Weather Changes ◽  
Nonanticipativity Constraints

Wildfire behavior is a complex and stochastic phenomenon that can present unique tactical management challenges. This paper investigates a multistage stochastic mixed integer program with full recourse to model spatially explicit fire behavior and to select suppression locations for a wildland fire. Simplified suppression decisions take the form of “suppression nodes”, which are placed on a raster landscape for multiple decision stages. Weather scenarios are used to represent a distribution of probable changes in fire behavior in response to random weather changes, modeled using probabilistic weather trees. Multistage suppression decisions and fire behavior respond to these weather events and to each other. Nonanticipativity constraints ensure that suppression decisions account for uncertainty in weather forecasts. Test cases for this model provide examples of fire behavior interacting with suppression to achieve a minimum expected area impacted by fire and suppression.

Sign in / Sign up

Export Citation Format

Share Document