Formalization of pickup and delivery problem

DOI10.14529/MMPH170102zbMATH Open1395.90027OpenAlexW2613761005MaRDI QIDQ5374531FDOQ5374531

Authors: Efim M. Bronshteĭn, Èl'Vina Vilevna Gindullina, Ramiz Vilevich Gindullin 

Publication date: 14 September 2018

Published in: Bulletin of the South Ural State University series "Mathematics. Mechanics. Physics" (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14529/mmph170102

Recommendations

• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• Recent models and algorithms for one-to-one pickup and delivery problems
• Pickup and delivery problem with time windows: a new compact two-index formulation
• scientific article; zbMATH DE number 1953194
• The pickup and delivery problem: Faces and branch-and-cut algorithm

zbMATH Keywords

optimizationroutingpickup and delivery problem

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Boolean programming (90C09)

Uses Software

• CPLEX

This page was built for publication: Formalization of pickup and delivery problem

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