Pages that link to "Item:Q2445841"
From MaRDI portal
The following pages link to Bike sharing systems: solving the static rebalancing problem (Q2445841):
Displayed 39 items.
- Two-choice regulation in heterogeneous closed networks (Q257069) (← links)
- Balancing bike sharing systems with constraint programming (Q272022) (← links)
- The static bicycle relocation problem with demand intervals (Q296779) (← links)
- An optimization framework for the development of efficient one-way car-sharing systems (Q300047) (← links)
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems (Q319656) (← links)
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
- Regulating vehicle sharing systems through parking reservation policies: analysis and performance bounds (Q322813) (← links)
- On the online min-wait relocation problem (Q324815) (← links)
- A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads (Q724007) (← 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)
- Shared mobility systems (Q904286) (← links)
- Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer (Q1634057) (← 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)
- 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)
- Inventory rebalancing through pricing in public bike sharing systems (Q1754731) (← links)
- A two-phase heuristic approach to the bike repositioning problem (Q1984982) (← links)
- Decisions of closed-loop supply chain based on recycling effort and differential game (Q2004201) (← links)
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (Q2029263) (← links)
- An optimal stopping policy for car rental businesses with purchasing customers (Q2095189) (← links)
- Measures of balance in combinatorial optimization (Q2168777) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245) (← links)
- A dual hesitant fuzzy rough pattern recognition approach based on deviation theories and its application in urban traffic modes recognition (Q2333450) (← links)
- Design of a public bicycle-sharing system with safety (Q2398146) (← 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)
- A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem (Q2675709) (← links)
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems (Q5058035) (← links)
- Empty-Car Routing in Ridesharing Systems (Q5129204) (← 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)
- A transient symmetry analysis for the \(M/M/1/k\) queue (Q6163554) (← links)
- Branch-and-cut for a 2-commodity flow relocation model with time constraints (Q6166886) (← links)
