A Multi-commodity Pickup and Delivery Open-tour m-TSP Formulation for Bike Sharing Rebalancing Problem
Authors
Abstract:
Bike sharing systems (BSSs) offer a mobility service whereby public bikes, located at different stations across an urban area, are available for shared use. An important point is that the distribution of rides between stations is not uniformly distributed and certain stations fill up or empty over time. These empty and full stations lead to demand for bikes and return boxes that cannot be fulfilled leading to unsatisfied and possibly even lost customers. To avoid this situation, bikes in the systems are redistributed by the provider. In this paper, a mathematical modelling is proposed to rebalance the stations employing non-identical trucks based on Travelling Salesman Problem (TSP) formulation. This modelling is categorized as static repositioning where the demands of stations in one period is considered. In the modelling, several types of bikes have been considered in BSSs and it has assumed that there are two depots and trucks start from one and return to another one. Finally, a numerical example confirms the applicability of the proposed model. The result shows that the modelling would simultaneously obtain the minimum paths, the minimum implementing truck’s costs and the minimum of loading/unloading bikes program.
similar resources
Rebalancing Dockless Bike Sharing Systems
Bike sharing provides an environment-friendly way for traveling and is booming all over the world. Yet, due to the high similarity of user travel patterns, the bike imbalance problem constantly occurs, especially for dockless bike sharing systems, causing significant impact on service quality and company revenue. Thus, it has become a critical task for bike sharing systems to resolve such imbal...
full textBike sharing systems: Solving the static rebalancing problem
This paper deals with a new problem that is a generalization of the many to many pickup and delivery problem and which is motivated by operating self-service bike sharing systems. There is only one commodity, initially distributed among the vertices of a graph, and a capacitated single vehicle aims to redistribute the commodity in order to reach a target distribution. Each vertex can be visited...
full textThe fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery: Formulation and a heuristic algorithm
In this paper, the fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery (FMDVRP-SPD) is investigated. The FMDVRP-SPD is the problem of allocating customers to several depots, so that the optimal set of routes is determined simultaneously to serve the pickup and the delivery demands of each customer within scattered depots. In the problem, both pickup and delivery dema...
full textA hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
We address in this article the multi-commodity pickup-and-delivery traveling salesman problem, which is a routing problem for a capacitated vehicle that has to serve a set of customers that provide or require certain amounts of m different products. Each customer must be visited exactly once by the vehicle, and it is assumed that a unit of a product collected from a customer can be supplied to ...
full textA multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases
We explore dynamic programming solutions for a multi-commodity, capacitated pickup and delivery problem. Cargo flows are given by an origin/destination matrix which is not necessarily symmetric. This problem is a generalization of several known pickup and delivery problems, as regards both problem structure and objective function. Solution approaches are developed for the single-vehicle and two...
full textMy Resources
Journal title
volume 9 issue 3
pages 70- 81
publication date 2016-07-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023