Full‐load route planning for balancing bike sharing systems by logic‐based benders decomposition

DOI10.1002/net.21736zbMath1386.90017OpenAlexW2605002313MaRDI QIDQ4638583

Christian Kloimüllner, Günther R. Raidl

Publication date: 27 April 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21736

zbMATH Keywords

vehicle routingtraveling salesman problembranch-and-checklogic-based benders decompositionbalancing bike-sharing systemspickup-delivery

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06)

Related Items (5)

Assembly planning by disjunctive programming and geometrical reasoning ⋮ Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut ⋮ The stochastic pseudo-star degree centrality problem ⋮ Stochastic optimization models for a bike-sharing problem with transshipment ⋮ Shared mobility systems: an updated survey

This page was built for publication: Full‐load route planning for balancing bike sharing systems by logic‐based benders decomposition