Related papers: A Matheuristic Multi-Start Algorithm for a Novel S…
Bike sharing systems have been widely deployed around the world in recent years. A core problem in such systems is to reposition the bikes so that the distribution of bike supply is reshaped to better match the dynamic bike demand. When the…
This work studies rearrangement problems involving the sorting of robots or objects in stack-like containers, which can be accessed only from one side. Two scenarios are considered: one where every robot or object needs to reach a…
Vehicle (bike or car) sharing represents an emerging transportation scheme which may comprise an important link in the green mobility chain of smart city environments. This chapter offers a comprehensive review of algorithmic approaches for…
This paper introduces an integrated lot sizing and scheduling problem inspired from a real-world application in off-the-road tire industry. This problem considers the assignment of different items on parallel machines with complex…
In bicycle share networks, the balance between demand and supply is disrupted. As a result, shared resources are wasted and management costs for operators increase. Therefore, in this paper, we analyze the cycle relocation problem from the…
The ultimate goal of ridesharing systems is to matchtravelers who do not have a vehicle with those travelers whowant to share their vehicle. A good match can be found amongthose who have similar itineraries and time schedules. In thisway…
This paper considers a combination of intelligent repositioning decisions and dynamic pricing for the improved operation of shared mobility systems. The approach is applied to London's Barclays Cycle Hire scheme, which the authors have…
We introduce an improved algorithm for the dynamic taxi sharing problem, i.e. a dispatcher that schedules a fleet of shared taxis as it is used by services like UberXShare and Lyft Shared. We speed up the basic online algorithm that looks…
This paper addresses an Electric Vehicle Relocation Problem (E-VReP), in one-way carsharing systems, based on operators who move through folding bicycles between a delivery request and one of pickup. In order to deal with its economical…
In this paper, we study the Multi-Start Team Orienteering Problem (MSTOP), a mission re-planning problem where vehicles are initially located away from the depot and have different amounts of fuel. We consider/assume the goal of multiple…
Bike sharing is a vital component of a modern multi-modal transportation system. However, its implementation can lead to bike supply-demand imbalance due to fluctuating spatial and temporal demands. This study proposes a comprehensive…
Various operational optimization problems arise in cross-dock synchronization. The combination of the truck scheduling with other decision problems in cross-docking has been targeted by researchers in the recent years. In most of the truck…
This paper addresses the two-stocking locations single item non-stationary stochastic lot-sizing problem. The inventory level at each location is reviewed periodically. Items can be reordered and received from a common central warehouse and…
The unrestricted block relocation problem is an important optimization problem encountered at terminals, where containers are stored in stacks. It consists in determining the minimum number of container moves so as to empty the considered…
As a favorite urban public transport mode, the bike sharing system is a large-scale and complicated system, and there exists a key requirement that a user and a bike should be matched sufficiently in time. Such matched behavior makes…
Bike-sharing transportation systems have been well studied from a top-down viewpoint, either for an optimal conception of the system, or for a better statistical understanding of their working mechanisms in the aim of the optimization of…
One of the main operational challenges faced by the operators of one-way car-sharing systems is to ensure vehicle availability across the regions of the service areas with uneven patterns of rental requests. Fleet balancing strategies are…
To enhance the service quality of bikesharing programs, bike fleet relocation is widely applied to redistribute bikes from bike sufficient areas to bike shortage areas thereby making a better bike-rider balance across different areas. In…
In this paper, an original heuristic algorithm of empty vehicles management in personal rapid transit network is presented. The algorithm is used for the delivery of empty vehicles for waiting passengers, for balancing the distribution of…
We develop a novel mathematical programming approximation framework to tackle the stochastic knapsack problem. In this problem, the decision maker considers items for which either weights or values, or both, are random. The aim is to select…