Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery
From MaRDI portal
Publication:1983730
DOI10.3934/JIMO.2020045zbMath1476.90037OpenAlexW3012470152MaRDI QIDQ1983730
Haoxun Chen, Zheng Chang, Bo Dai, Farouk Yalaoui
Publication date: 10 September 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2020045
Related Items (1)
Cites Work
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
- Routing a mixed fleet of electric and conventional vehicles
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- A general heuristic for vehicle routing problems
- An adaptive large neighbourhood search for asset protection during escaped wildfires
- An iterative algorithm for periodic Sylvester matrix equations
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- Cyber-physical logistics system-based vehicle routing optimization
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Forty years of periodic vehicle routing
- The period routing problem
- A Heuristic for the Periodic Vehicle Routing Problem
- An asynchronous parallel metaheuristic for the period vehicle routing problem
- A guide to vehicle routing heuristics
- Networks and vehicle routing for municipal waste collection
- An improved heuristic for the period vehicle routing problem
- Efficient methods to schedule reentrant flowshop system
This page was built for publication: Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery
