Corpus ID: 237532136

Vehicle Fleet Sizing, Positioning and Routing Problem with Stochastic Customers

@inproceedings{CorredorMontenegro2021VehicleFS,
  title={Vehicle Fleet Sizing, Positioning and Routing Problem with Stochastic Customers},
  author={David Corredor-Montenegro and Maria Jose Consuegra-Laino and Alfaima L. Solano‐Blanco and Camilo G'omez},
  year={2021}
}
The Vehicle Fleet Sizing, Positioning and Routing Problem with Stochastic Customers (VFSPRP-SC) consists on pairing strategic decisions of depot positioning and fleet sizing with operational vehicle routing decisions while taking into account the inherent uncertainty of demand. We successfully solve the VFSPRP-SC with a methodology comprised of two main blocks: i) a scenario generation phase and ii) a two–stage stochastic program. For the first block, a set of scenarios is selected with a… Expand

References

SHOWING 1-10 OF 36 REFERENCES
On an exact method for the constrained shortest path problem
TLDR
This work proposes an exact solution method for the constrained shortest path capable of handling large-scale networks in a reasonable amount of time and obtained significant speedups against alternative column generation schemes that solve the auxiliary problem with state-of-the-art commercial (linear) optimizers. Expand
An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints
TLDR
This work embedded their algorithm within a column generation to solve the linear relaxation root node of the vehicle routing problem with time windows VRPTW and found that the proposed algorithm performs well when compared against state-of-the-art algorithms for the ESPPRC on the well-known Solomon's test bed for theVRPTW. Expand
Acceleration strategies for the weight constrained shortest path problem with replenishment
TLDR
This work presents an exact algorithm based on a recursive depth-first search that combines and extends ideas proposed in state-of-the-art algorithms for the CSP and the WCSPP-R, and finds a set of acceleration strategies that significantly improves the algorithm’s performance. Expand
Revised Pulse Algorithm for Elementary Shortest Path Problem with Resource Constraints
  • Jiaxin Li, Xin Han
  • Computer Science
  • 2019 Seventh International Symposium on Computing and Networking (CANDAR)
  • 2019
TLDR
An algorithm to solve elementary shortest path problem (ESPPRC) is described that improves the method proposed in [Lozano et al., Transportation Science, 2015], and has a shorter average running time in 51 of the 56 instances. Expand
delivery problem with uncertainty. Transportation science
  • 2019
2016) An exact algorithm for the elementary shortest path
  • 2016
The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm
TLDR
The HESA successfully combines several metaheuristics and offers a number of new advanced efficient procedures tailored to handle heterogeneous fleet dimensioning and location decisions and a powerful hybrid evolutionary search algorithm (HESA) to solve the FSMLRPTW problem. Expand
An enhanced KSP algorithm with pruning strategies to solve the constrained shortest path problem
  • Applied Mathematics and Computation
  • 2015
...
1
2
3
4
...