A multi-destination daily carpooling problem and an ant colony based resolution method

DOI10.1051/RO/2013049zbMath1282.90034OpenAlexW2024289760MaRDI QIDQ5397709

Tienté Hsu, Gilles Goncalves, Yuhan Guo

Publication date: 24 February 2014

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/48b9a9c77413f85a71720b64d43bb5f8ea3c9e20

zbMATH Keywords

transportationvehicle routingcarpooling problemant colony algorithm

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Tabu search for the real-world carpooling problem ⋮ Environmental and social implications of incorporating carpooling service on a customized bus system ⋮ Optimizing carpool formation along high-occupancy vehicle lanes

This page was built for publication: A multi-destination daily carpooling problem and an ant colony based resolution method