Synchronized pickup and delivery problems with connecting FIFO stack

DOI10.1007/978-3-030-63072-0_19zbMath1479.90023OpenAlexW3135573241MaRDI QIDQ2056913

Nicolas Facchinetti, Michele Barbato, Alberto Ceselli

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-63072-0_19

zbMATH Keywords

dynamic programmingroutingFIFO loadingoptimization in manufacturing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• The Euclidean traveling salesman problem is NP-complete
• Vehicle Routing
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Synchronized pickup and delivery problems with connecting FIFO stack