A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861): Difference between revisions

Latest revision as of 06:11, 12 July 2024

scientific article

Language	Label	Description	Also known as
English	A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem	scientific article

Statements

instance of

scholarly article

0 references

title

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

0 references

zbMATH Open document ID

1338.90054

0 references

DOI

10.1016/j.ejor.2014.04.024

0 references

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

23 June 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

facilities planning and design

0 references

routing

0 references

fleet management

0 references

mobile facility

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2014.04.024

0 references

OpenAlex ID

W2076241887

0 references

cites work

The multi-period incremental service facility location problem

0 references

Partitioning procedures for solving mixed-variables programming problems

0 references

A Priori Optimization

0 references

A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty

0 references

A multicut algorithm for two-stage stochastic linear programs

0 references

Introduction to Stochastic Programming

0 references

The orienteering problem with stochastic travel and service times

0 references

Multi-period international facilities location: An algorithm and application

0 references

The team orienteering problem

0 references

Efficient Algorithms for Solving the Shortest Covering Path Problem

0 references

The maximum covering/shortest path problem: A multiobjective network design and routing formulation

0 references

The Covering Salesman Problem

0 references

The median tour and maximal covering tour problems: Formulations and heuristics

0 references

Capacitated dynamic location problems with opening, closure and reopening of facilities

0 references

Q3987788

0 references

The orienteering problem with variable profits

0 references

A two-stage approach to the orienteering problem with stochastic weights

0 references

An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers

0 references

Stochastic vehicle routing

0 references

The Covering Tour Problem

0 references

Multicommodity Distribution System Design by Benders Decomposition

0 references

The orienteering problem

0 references

Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits

0 references

Heuristics for the multi-vehicle covering tour problem

0 references

An iterative three-component heuristic for the team orienteering problem with time windows

0 references

A Bayesian approach to a dynamic inventory model under an unknown demand distribution

0 references

The Sample Average Approximation Method for Stochastic Discrete Optimization

0 references

The team orienteering problem with time windows: an LP-based granular variable neighborhood search

0 references

The integer \(L\)-shaped method for stochastic integer programs with complete recourse

0 references

An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands

0 references

The selective travelling salesman problem

0 references

Computational solution of capacity planning models under uncertainty

0 references

An approximate dynamic programming approach for the vehicle routing problem with stochastic demands

0 references

A stochastic programming approach for supply chain network design under uncertainty

0 references

A decomposition approach for facility location and relocation problem with uncertain number of future facilities

0 references

AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES

0 references

Dynamic-demand capacitated facility location problems with and without relocation

0 references

The bi-objective stochastic covering tour problem

0 references

A Dual-Based Procedure for Dynamic Facility Location

0 references

<i>L</i>-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming

0 references

The orienteering problem: a survey

0 references

The Multiperiod Location-Allocation Problem with Relocation of Facilities

0 references

Two stage linear programming under uncertainty with 0–1 integer first stage variables

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:296861

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