Carpooling: the 2 synchronization points shortest paths problem

DOI10.4230/OASICS.ATMOS.2013.150MaRDI QIDQ5397853zbMATH OpenOpenAlexFDO

Authors Arthur Bit-Monnot, Christian Artigues, Marie-José Huguet, Marc-Olivier Killijian

Publication date 24 February 2014

Full work available at URL https://hal.science/hal-00843628

zbMATH Keywords

dynamic carpoolingshortest path problemsynchronized paths

Mathematics Subject Classification ID

Applications of graph theory (05C90) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Programming involving graphs or networks (90C35)

Recommendations

• Common route planning for carpoolers -- model and exact algorithm
• Tabu search for the real-world carpooling problem
• A multi-destination daily carpooling problem and an ant colony based resolution method
• An optimization model and a solution algorithm for the many-to-many car pooling problem
• An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation

Cited in

(5)

• Modeling and solving the multimodal car- and ride-sharing problem
• A traffic restriction scheme for enhancing carpooling
• Common route planning for carpoolers -- model and exact algorithm
• The vehicle routing problem with floating targets: formulation and solution approaches
• Real-time ride-sharing substitution service in multi-modal public transport using buckets

This page was built for publication: Carpooling: the 2 synchronization points shortest paths problem

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