Pages that link to "Item:Q319656"
From MaRDI portal
The following pages link to An exact algorithm for the static rebalancing problem arising in bicycle sharing systems (Q319656):
Displaying 32 items.
- Balancing bike sharing systems with constraint programming (Q272022) (← links)
- The static bicycle relocation problem with demand intervals (Q296779) (← links)
- Regulating vehicle sharing systems through parking reservation policies: analysis and performance bounds (Q322813) (← links)
- Sustainable operations (Q323159) (← links)
- A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
- Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system (Q829193) (← links)
- Shared mobility systems (Q904286) (← links)
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem (Q1652142) (← links)
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
- The static bike relocation problem with multiple vehicles and visits (Q1681499) (← links)
- Stochastic optimization models for a bike-sharing problem with transshipment (Q1728505) (← links)
- Shared mobility systems: an updated survey (Q1730532) (← links)
- Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems (Q1734854) (← links)
- Inventory rebalancing and vehicle routing in bike sharing systems (Q1752898) (← links)
- A two-phase heuristic approach to the bike repositioning problem (Q1984982) (← links)
- The evolution of a clogging sidewalk caused by a dockless bicycle-sharing system: a stochastic particles model (Q1998130) (← links)
- Decisions of closed-loop supply chain based on recycling effort and differential game (Q2004201) (← links)
- The single-vehicle two-echelon one-commodity pickup and delivery problem (Q2027019) (← links)
- A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems (Q2076869) (← links)
- Optimizing large on-demand transportation systems through stochastic conic programming (Q2239886) (← links)
- A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245) (← links)
- Bike sharing systems: solving the static rebalancing problem (Q2445841) (← links)
- An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem (Q2664364) (← links)
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems (Q5058035) (← links)
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System (Q5085152) (← links)
- Data-Driven Rebalancing Methods for Bike-Share Systems (Q5154459) (← links)
- Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms (Q6047927) (← links)
- A mixed rebalancing strategy in bike sharing systems (Q6048177) (← links)
- A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)
- Branch-and-cut for a 2-commodity flow relocation model with time constraints (Q6166886) (← links)
- The wildfire suppression problem with multiple types of resources (Q6565388) (← links)
- A project and lift approach for a 2-commodity flow relocation model in a time expanded network (Q6585274) (← links)
