Transportation Network Analysis and Decomposition Methods
U.S. Transportation Systems Center, 1978 - Decomposition method - 195 pages
Application to freight flow problems, multifleet routing problems and vehicle routing problems.
What people are saying - Write a review
We haven't found any reviews in the usual places.
MULTIFLEET ROUTING PROBLEMS
FREIGHT FLOW PROBLEMS
2 other sections not shown
aircraft applications arc costs arc i,j Benders algorithm Benders cut Benders decomposition Benders method bundle constraints Bundle Pricing Algorithm capacitated arcs Clarke-Wright column computational experience computational results convergence Dantzig-Wolfe decomposition defined demand at node depot dual variables extreme points feasible Figure fixed charge flow value formulation FTOT heuristic solutions implementation KILTER Lin-Kernighan linear program Magnanti master problem matrix MFRP Minimize mixed integer programs Multicommodity Flow Problem Multifleet Routing Problem NCOM network design problem Network Flows network structure node network number of commodities number of iterations number of nodes obtain OKFDATA optimal solution optimal value p-median problem pareto optimal procedure RHSD routing cost savings schedule map service arc SEXOP shortest chain shortest path shortest path problems strategy strong cuts subgradient subproblem subroutine supersource test problems total flow traveling salesman problem type C cut vector vehicle routing problem Weibull distribution Z>dy