An adaptive routing approach for personal rapid transit

DOI10.1007/S00186-012-0403-8MaRDI QIDQ2392823zbMATH OpenOpenAlexFDO

Authors Kaspar Schüpbach, Rico Zenklusen

Publication date 2 August 2013

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/105196

zbMATH Keywords

online algorithmsadaptive routingdecision support modelspersonal rapid transit

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• Synchronous routing for personal rapid transit pods
• Minimising average passenger waiting time in personal rapid transit systems
• VNS as an upper bound for an exact method to solve a class of on-demand transit transportation systems
• scientific article; zbMATH DE number 1867329
• Round-Based Public Transit Routing

Cites work

• Approximation Algorithms for Conflict-Free Vehicle Routing
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial optimization. Theory and algorithms.
• Complexity and approximability of \(k\)-splittable flows
• Conflict-free shortest-time bidirectional AGV routeing
• Constructing maximal dynamic flows from static flows
• Dependent rounding and its applications to approximation algorithms
• Developing Conflict-Free Routes for Automated Guided Vehicles
• Online disjoint vehicle routing with application to AGV routing.

Cited in

(4)

• Minimising average passenger waiting time in personal rapid transit systems
• Round-Based Public Transit Routing
• Synchronous routing for personal rapid transit pods
• VNS as an upper bound for an exact method to solve a class of on-demand transit transportation systems

This page was built for publication: An adaptive routing approach for personal rapid transit

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