An adaptive large neighborhood search for relocating vehicles in electric carsharing services

DOI10.1016/J.DAM.2018.03.067zbMath1409.90031OpenAlexW2799460065WikidataQ129952633 ScholiaQ129952633MaRDI QIDQ1634774

Maurizio Bruglieri, Ornella Pisacane, Ferdinando Pezzella

Publication date: 18 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11311/1125638

zbMATH Keywords

tabu searchprofit optimizationone-way carsharingoperator-based relocationpick-up and delivery problemruin and recreate metaheuristic

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Search theory (90B40) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Heterogeneous fleet management for one-way electric carsharing system with optional orders, vehicle relocation and on-demand recharging ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ A survey on emergent trends in the optimization of car‐sharing systems ⋮ An adaptive large neighborhood search method for rebalancing free-floating electric vehicle sharing systems ⋮ A two-phase optimization method for a multiobjective vehicle relocation problem in electric carsharing systems ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search

Cites Work

• An optimization framework for the development of efficient one-way car-sharing systems
• On the online min-wait relocation problem
• An adaptive large neighborhood search heuristic for the share-a-ride problem
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• An asymmetric vehicle routing problem arising in the collection and disposal of special waste
• Vehicle routing in the 1-skip collection problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Approximation Algorithms for Orienteering and Discounted-Reward TSP

This page was built for publication: An adaptive large neighborhood search for relocating vehicles in electric carsharing services