A multi-destination daily carpooling problem and an ant colony based resolution method
DOI10.1051/RO/2013049zbMATH Open1282.90034OpenAlexW2024289760MaRDI QIDQ5397709FDOQ5397709
Authors: Yuhan Guo, Gilles Goncalves, Tienté Hsu 
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
Recommendations
- scientific article; zbMATH DE number 2159390
- Tabu search for the real-world carpooling problem
- Common route planning for carpoolers -- model and exact algorithm
- An optimization model and a solution algorithm for the many-to-many car pooling problem
- A distributed geographic information system for the daily car pooling problem
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cited In (8)
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
- Title not available (Why is that?)
- Tabu search for the real-world carpooling problem
- A multi-agent based self-adaptive genetic algorithm for the long-term car pooling problem
- Optimizing carpool formation along high-occupancy vehicle lanes
- Environmental and social implications of incorporating carpooling service on a customized bus system
- An optimization model and a solution algorithm for the many-to-many car pooling problem
- A distributed geographic information system for the daily car pooling problem
This page was built for publication: A multi-destination daily carpooling problem and an ant colony based resolution method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5397709)
