Abstract: The Nelder-Mead simplex method is a well-known algorithm enabling the minimization of functions that are not available in closed-form and that need not be differentiable or convex.
Abstract: The Multi-depot Vehicle Routing Problem with Uncertain Demand (MD-VRPUD) can be modeled as a bi-level optimization problem (BLOP), because it requires both assigning customers to different ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results