A VNS-Based Matheuristic to Solve the Districting Problem in Bicycle-Sharing Systems
نویسندگان
چکیده
A matheuristic approach that combines a reduced variable neighbourhood search (rVNS) algorithm and mathematical programming (MP) solver to solve novel model for the districting problem in public bicycle-sharing system is presented. The modelled as an integer problem. While rVNS aims find high-quality set of centres repositioning zones, MP computes optimal allocation network stations zones. We use predefined grid reduce space needs explore. proposed obtains promising results small medium-sized instances, also able handle large-sized models.
منابع مشابه
Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations
Public bike sharing systems are important alternatives to motorized individual traffic and are gaining popularity in larger cities worldwide. In order to maintain user satisfaction, operators need to actively rebalance the systems so that there are enough bikes available for rental as well as sufficient free slots for returning them at each station. This is done by a vehicle fleet that moves bi...
متن کاملPILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
We consider a transportation problem arising in public bicycle sharing systems: To avoid rental stations to run entirely empty or full, a fleet of vehicles continuously performs tours moving bikes among stations. In the static problem variant considered in this paper, we are given initial and target fill levels for all stations, and the goal is primarily to find vehicle tours including correspo...
متن کاملA matheuristic approach to solve the multiobjective beam angle optimization problem in intensity-modulated radiation therapy
Selecting a suitable set of beam angles is an important but difficult task in intensity modulated radiation therapy (IMRT) for cancer treatment. From a single objective point of view this problem, known as beam angle optimisation (BAO) problem, is solved by finding a beam angle configuration (BAC) that leads to the best dose distribution, according to some objective function. Because there exis...
متن کاملNew Approaches in Metaheuristics to Solve the Truck Scheduling Problem in a Cross-docking Center
Nowadays, cross-docking is one of the main concepts in supply chain management in which products received to a distribution center by inbound trucks which are directly to lead into outbound trucks with a minimum handling and storage costs as the main cost of a cross-docking system. According to the literature, several metaheuristics and heuristics are attempted to solve this optimization model....
متن کاملA Lagrangian Relaxation-based Algorithm to Solve a Home Health Care Routing Problem
Nowadays, a rapid growth in the rate of life expectancy can be seen especially in the developed countries. Accordingly, the population of elderlies has been increased. By another point of view, the number of hospitals, retirement homes along with medical staffs has not been grown with a same rate. Hence, Home Health Care (HHC) operations including a set of nurses and patients have been develope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10224175