A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows
From MaRDI portal
Publication:2033323
DOI10.1007/s10100-019-00625-0OpenAlexW2945371976MaRDI QIDQ2033323
Publication date: 16 June 2021
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-019-00625-0
metaheuristicslocal searchtime windowsvehicle routing problemsynchronisationmatheuristicstransshipmentant colony optimisation
Related Items (2)
Multi-fleet feeder vehicle routing problem using hybrid metaheuristic ⋮ The rendezvous vehicle routing problem
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Thirty years of heterogeneous vehicle routing
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Large neighborhood search for multi-trip vehicle routing
- The linehaul-feeder vehicle routing problem with virtual depots and time windows
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A general heuristic for vehicle routing problems
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- The fleet size and mix vehicle routing problem
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches
- Greedy randomized adaptive search procedures
- A genetic algorithm for the vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- Synchronizing vans and cargo bikes in a city distribution network
- A survey on matheuristics for routing problems
- A memetic algorithm for the multi trip vehicle routing problem
- Ant colony optimization theory: a survey
- A variable neighborhood search algorithm for the vehicle routing problem with multiple trips
- A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The fleet size and mix vehicle routing problem with time windows
- Routing a Heterogeneous Fleet of Vehicles
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- Tabu Search—Part I
- Tabu Search—Part II
- A guide to vehicle routing heuristics
- Solution of a Large-Scale Traveling-Salesman Problem
- A Computational Study Of A New Heuristic For The Site-Dependent Vehicle Routing Problem
- A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows
- Vehicle routing problems with multiple trips
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
This page was built for publication: A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows