Multiple Capacity Vehicle Routing on Paths

DOI10.1137/S0895480197319951MaRDI QIDQ4210225zbMATH OpenOpenAlexFDO

Authors D. J. Guan, Xuding Zhu

Publication date 21 September 1998

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480197319951

zbMATH Keywords

motion planning, graph algorithmsvehicle routing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Routing a vehicle of capacity greater than one
• Algorithms for capacitated vehicle routing
• scientific article; zbMATH DE number 1775420

Cited in

(8)

• Routing a vehicle of capacity greater than one
• Capacitated vehicle routing with nonuniform speeds
• Semi–preemptive routing on a line
• Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications
• Maximum Capacity Path Interdiction Problem with Fixed Costs
• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
• Semi-preemptive routing on a linear and circular track
• Combined route capacity and route length models for unit demand vehicle routing problems

This page was built for publication: Multiple Capacity Vehicle Routing on Paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210225)