Pages that link to "Item:Q1652142"
From MaRDI portal
The following pages link to A heuristic algorithm for a single vehicle static bike sharing rebalancing problem (Q1652142):
Displaying 25 items.
- The static bicycle relocation problem with demand intervals (Q296779) (← links)
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems (Q319656) (← 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)
- PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems (Q887207) (← links)
- Alternative evaluation functions for the cyclic bandwidth sum problem (Q1631512) (← 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)
- Inventory rebalancing and vehicle routing in bike sharing systems (Q1752898) (← links)
- A two-phase heuristic approach to the bike repositioning problem (Q1984982) (← links)
- The single-vehicle two-echelon one-commodity pickup and delivery problem (Q2027019) (← 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)
- Balancing the stations of a self service “bike hire” system (Q3016180) (← links)
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System (Q5085152) (← links)
- Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms (Q6047927) (← links)
- A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)
- Large neighborhood search for the bike request scheduling problem (Q6069919) (← links)
- Public transport for smart cities: recent innovations and future challenges (Q6106754) (← links)
- Risk‐averse two‐stage stochastic programming for the inventory rebalancing of bike‐sharing systems (Q6187239) (← links)
- Bike rebalancing: how to find a balanced matching in the k center problem? (Q6565428) (← links)
- A feature correlation reinforce clustering and evolutionary algorithm for the green bike-sharing reposition problem (Q6568416) (← links)
- The one-station bike repositioning problem (Q6611018) (← links)
