Synchronized pickup and delivery problems with connecting FIFO stack

DOI10.1007/978-3-030-63072-0_19MaRDI QIDQ2056913zbMATH OpenOpenAlexFDO

Authors Michele Barbato, Alberto Ceselli, Nicolas Facchinetti

Publication date 8 December 2021

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

zbMATH Keywords

dynamic programmingFIFO loadingoptimization in manufacturingrouting

Mathematics Subject Classification ID

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

Recommendations

• A practical approach for the FIFO stack-up problem
• An Experimental Study of Algorithms for Controlling Palletizers
• On the complexity of the FIFO stack-up problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations

Cites work

• Introduction to algorithms
• Maximum matching and a polyhedron with 0,1-vertices
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• The Euclidean traveling salesman problem is NP-complete
• The traveling salesman problem. A computational study.
• Vehicle Routing

Cited in

(2)

• Synchronized routing of active and passive means of transport
• A review of synchronization problems in parts-to-picker warehouses

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

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