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

DOI10.1111/ITOR.13411MaRDI QIDQ6495374zbMATH OpenFDO

Authors Cristiano Martins Monteiro, Vinícius F. dos Santos, Clodoveu A. jun. Davis

Publication date 30 April 2024

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

Full work available at URL https://doi.org/10.1111/ITOR.13411

zbMATH Keywords

mixed integer linear programmingstation-based mobilitytime complexitytransportation

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A survey on emergent trends in the optimization of car‐sharing systems
• An ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São Paulo
• Bipartite Domination and Simultaneous Matroid Covers
• Charging station optimization for balanced electric car sharing
• Dynamic location problem under uncertainty with a regret‐based measure of robustness
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Induced matchings
• Introduction to algorithms.
• Maximum independent sets in 3- and 4-regular Hamiltonian graphs
• Online stochastic weighted matching algorithm for real‐time shared parking
• The location routing problem with facility sizing decisions
• Trends in passenger transport optimisation

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

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