Generating constrained length personalized bicycle tours

DOI10.1007/s10288-018-0371-9zbMath1441.05123OpenAlexW2787335594MaRDI QIDQ1728418

P. Stroobant, D. Colle, Mario Pickavet, Pieter Audenaert

Publication date: 22 February 2019

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://biblio.ugent.be/publication/8587717

zbMATH Keywords

branch-and-bound algorithmconstrained bicycle routingreach-based routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• A survey for the quadratic assignment problem
• A characterization of the minimum cycle mean in a digraph
• The quadratic shortest path problem: complexity, approximability, and solution methods
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Evolution and Evaluation of the Penalty Method for Alternative Graphs
• Improved Alternative Route Planning
• Branch-and-Bound Methods: A Survey

This page was built for publication: Generating constrained length personalized bicycle tours