An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem

DOI10.1016/j.cor.2020.105035zbMath1458.90156OpenAlexW3037493102MaRDI QIDQ2664364

Dezhi Zhang, Bin Ji, Shuangyan Li, Wei Xu, Ya-Jie Liu

Publication date: 20 April 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105035

zbMATH Keywords

bike-sharing systemadaptive tabu search algorithmbike repositioning and recycling problemBRRP solver

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Synchronized truck and drone routing under disastrous conditions (case study: urban thoroughfares disinfection) ⋮ Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms

Cites Work

• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
• A destroy and repair algorithm for the bike sharing rebalancing problem
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
• An iterated tabu search for the multi-compartment vehicle routing problem
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• The static bike relocation problem with multiple vehicles and visits
• Stochastic optimization models for a bike-sharing problem with transshipment
• Inventory rebalancing and vehicle routing in bike sharing systems
• A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
• Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
• Bike sharing systems: solving the static rebalancing problem
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• A survey of variants and extensions of the location-routing problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• An improved formulation for the multi-depot open vehicle routing problem

This page was built for publication: An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem