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.024zbMath1338.90054OpenAlexW2076241887MaRDI QIDQ296861

Lixin Miao, Chao Lei, Wei-Hua Lin

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

routingfacilities planning and designfleet managementmobile facility

Mathematics Subject Classification ID

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

Related Items (7)

A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty ⋮ 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 ⋮ 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 ⋮ 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

Cites Work

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

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