Tag: Branch and bound
Probabilistic branch-and-bound can approximate Pareto-optimal sets
—
in AlgorithmWhat the study found The study presents Multiple Objective Probabilistic Branch and Bound with Single Observation (MOPBnB(so)), an algorithm for approximating the Pareto optimal set and the associated efficient frontier in stochastic multi-objective optimization problems. Why the authors say this matters The authors indicate that the algorithm is intended to handle noisy objective evaluations more…
Hybrid scheduling methods improve bus driver assignment results
What the study found The study found that a tightly integrated mix of exact optimization and heuristic search produced state-of-the-art results for the bus driver scheduling problem, which is the task of designing driver shifts to cover planned bus tours under legal and contract rules. The authors report exact solutions for small instances and low…
