A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem

DOI10.1016/J.EJOR.2014.04.024MaRDI QIDQ296861zbMATH OpenOpenAlexFDO

Authors Chao Lei, Wei-Hua Lin, Lixin Miao

Publication date 23 June 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2014.04.024

zbMATH Keywords

facilities planning and designfleet managementmobile facilityrouting

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic scheduling theory in operations research (90B36) Stochastic programming (90C15)

Recommendations

• A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• A survey on stochastic location and routing problems

Cites work

• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• A Bayesian approach to a dynamic inventory model under an unknown demand distribution
• A decomposition approach for facility location and relocation problem with uncertain number of future facilities
• A Dual-Based Procedure for Dynamic Facility Location
• A multicut algorithm for two-stage stochastic linear programs
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• A Priori Optimization
• A stochastic programming approach for supply chain network design under uncertainty
• A two-stage approach to the orienteering problem with stochastic weights
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
• An iterative three-component heuristic for the team orienteering problem with time windows
• Capacitated dynamic location problems with opening, closure and reopening of facilities
• Computational solution of capacity planning models under uncertainty
• Dynamic-demand capacitated facility location problems with and without relocation
• Efficient Algorithms for Solving the Shortest Covering Path Problem
• Heuristics for the multi-vehicle covering tour problem
• scientific article; zbMATH DE number 31720 (Why is no real title available?)
• Introduction to Stochastic Programming
• Multi-period international facilities location: An algorithm and application
• Multicommodity Distribution System Design by Benders Decomposition
• Partitioning procedures for solving mixed-variables programming problems
• Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits
• Stochastic vehicle routing
• The bi-objective stochastic covering tour problem
• The Covering Salesman Problem
• The Covering Tour Problem
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• The median tour and maximal covering tour problems: Formulations and heuristics
• The multi-period incremental service facility location problem
• The Multiperiod Location-Allocation Problem with Relocation of Facilities
• The orienteering problem
• The orienteering problem with stochastic travel and service times
• The orienteering problem with variable profits
• The orienteering problem: a survey
• The sample average approximation method for stochastic discrete optimization
• The selective travelling salesman problem
• The team orienteering problem
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Two stage linear programming under uncertainty with 0–1 integer first stage variables

Cited in

(10)

• An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming
• An improved L-shaped method for solving process flexibility design problems
• Robust strategic planning for mobile medical units with steerable and unsteerable demands
• Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm
• Liner ship bunkering and sailing speed planning with uncertain demand
• Distributionally robust facility location with bimodal random demand
• A novel multi-objective green vehicle routing and scheduling model with stochastic demand, supply, and variable travel times
• A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty
• A two-stage stochastic programming for the integrated emergency mobility facility allocation and road network design under uncertainty
• Integrated mobile facility production and distribution scheduling planning; a synchronized solution framework

This page was built for publication: A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296861)