A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
From MaRDI portal
Publication:853026
DOI10.1016/j.ejor.2004.07.077zbMath1113.90018OpenAlexW2152212781MaRDI QIDQ853026
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.07.077
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (34)
A survey of variants and extensions of the location-routing problem ⋮ Territorial design optimization for business sales plan ⋮ A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain ⋮ Thirty years of heterogeneous vehicle routing ⋮ The vehicle-routing problem with time windows and driver-specific times ⋮ A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution ⋮ The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation ⋮ Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm ⋮ Robust vehicle routing problem with hard time windows under demand and travel time uncertainty ⋮ A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows ⋮ A methodology to exploit profit allocation in logistics joint distribution network optimization ⋮ Holistic fleet optimization incorporating system design considerations ⋮ Scheduling complex observation requests for a constellation of satellites: large neighborhood search approaches ⋮ A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system ⋮ A Green Vehicle Routing Problem with Multi-Depot, Multi-Tour, Heterogeneous Fleet and Split Deliveries: a mathematical model and heuristic approach ⋮ High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows ⋮ How to choose ``last mile delivery modes for E-fulfillment ⋮ A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem ⋮ A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet ⋮ Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network ⋮ A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST ⋮ Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector ⋮ A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem ⋮ A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority ⋮ A particle swarm optimization algorithm with path relinking for the location routing problem ⋮ Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ Exact solutions for the collaborative pickup and delivery problem ⋮ Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem ⋮ Implicit depot assignments and rotations in vehicle routing heuristics ⋮ A computer-enabled solution procedure for food wholesalers' distribution decision in cities with a circular transportation infrastructure ⋮ A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem ⋮ A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets ⋮ Heuristic optimization for multi-depot vehicle routing problem in ATM network model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The vehicle routing problem: An overview of exact and approximate algorithms
- The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem
- Lagrangian duality applied to the vehicle routing problem with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Vehicle Routing with Time Windows
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Vehicle Routing with Time Windows: Two Optimization Algorithms
This page was built for publication: A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
