Transportation Science · 1991 · 137 citations · 20 references
Mathematical ProgrammingRoute SelectionEngineeringNetwork OperationNetwork PlanningNetwork AnalysisDiscrete OptimizationOperations ResearchStochastic NetworkSystems EngineeringCombinatorial OptimizationNetwork OptimizationTransportation EngineeringNetwork DesignComputer EngineeringComputer ScienceInteger ProgrammingAssignment MethodsNetwork Routing AlgorithmNetwork ScienceNetwork Traffic ControlBusinessNetwork Design ProblemsVehicle Routing ProblemNetwork Design AlgorithmBranch And Bound
In this paper, a branch and bound algorithm is presented for solving network design problems (NDP). Route selection for the NDP is based on a stochastic incremental traffic assignment approach. Experiments are performed to compare the behaviors of three assignment methods. Numerical examples are presented to illustrate the algorithm for solving the NDP.
20