A distributed geographic information system for the daily car pooling problem

DOI10.1016/S0305-0548(03)00186-2zbMath1067.68784OpenAlexW2011397885WikidataQ59195750 ScholiaQ59195750MaRDI QIDQ1886004

Palle Haastrup, Fabio de Luigi, Vittorio Maniezzo, Roberto Wolfler Calvo

Publication date: 12 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00186-2

zbMATH Keywords

GISCarpoolICT technologiesRouting and scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items (9)

Environmental and social implications of incorporating carpooling service on a customized bus system ⋮ Minimizing \(\mathrm{CO}_2\) emissions in a practical daily carpooling problem ⋮ Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems ⋮ A new <scp>ride‐sharing</scp> model incorporating the passengers' efforts ⋮ Optimization for dynamic ride-sharing: a review ⋮ Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration ⋮ Optimizing carpool formation along high-occupancy vehicle lanes ⋮ Efficient algorithms for ridesharing of personal vehicles ⋮ An optimization model and a solution algorithm for the many-to-many car pooling problem

Uses Software

• VRP

Cites Work

• Solving capacitated clustering problems
• An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A distributed geographic information system for the daily car pooling problem