Computational complexity and linear formulations for optimizing the location of shared mobility stations

DOI10.1111/ITOR.13411MaRDI QIDQ6495374

Clodoveu Davis, Vinícius Fernandes dos Santos, Cristiano Martins Monteiro

Publication date: 30 April 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

zbMATH Keywords

transportationmixed integer linear programmingtime complexitystation-based mobility

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum independent sets in 3- and 4-regular Hamiltonian graphs
• Induced matchings
• Charging station optimization for balanced electric car sharing
• Bipartite Domination and Simultaneous Matroid Covers
• An ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São Paulo
• Dynamic location problem under uncertainty with a regret‐based measure of robustness
• The location routing problem with facility sizing decisions
• A survey on emergent trends in the optimization of car‐sharing systems
• Trends in passenger transport optimisation
• Online stochastic weighted matching algorithm for real‐time shared parking

This page was built for publication: Computational complexity and linear formulations for optimizing the location of shared mobility stations