The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
From MaRDI portal
(Redirected from Publication:320620)
Recommendations
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
- New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
- The fleet size and mix vehicle routing problem with time windows
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- Scatter search for the fleet size and mix vehicle routing problem with time windows
Cites work
- scientific article; zbMATH DE number 4051316 (Why is no real title available?)
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- A branch-and-cut algorithm for the plant-cycle location problem
- A compact model and tight bounds for a combined location-routing problem
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- A survey of recent research on location-routing problems
- A survey of variants and extensions of the location-routing problem
- A unified exact method for solving different classes of vehicle routing problems
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A unified solution framework for multi-attribute vehicle routing problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Combined location-routing problems: A synthesis and future research directions
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- Heuristic solutions to multi-depot location-routing problems
- Industrial aspects and literature survey: fleet composition and routing
- Integer Programming: Methods, Uses, Computations
- Location-routing: issues, models and methods
- New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- The fleet size and mix vehicle routing problem with time windows
Cited in
(25)- scientific article; zbMATH DE number 2114491 (Why is no real title available?)
- Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network
- The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads
- The fleet size and mix vehicle routing problem with time windows
- Flexible two-echelon location routing problem
- Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics
- Multiobjective location routing problem considering uncertain data after disasters
- A bi-level framework for heterogeneous fleet sizing of ride-hailing services considering an approximated mixed equilibrium between automated and non-automated traffic
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
- A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem
- New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
- Fleet sizing of reusable articles under uncertain demand and turnaround times
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
- Scatter search for the fleet size and mix vehicle routing problem with time windows
- Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem
- Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects
- A survey of adaptive large neighborhood search algorithms and applications
- An improved edge recombination algorithm for scheduling problems of drone package delivery
- The electric vehicle routing problem with shared charging stations
- Location‐routing problem: a classification of recent research
- A location-or-routing problem with partial and decaying coverage
- Electric vehicles fast charger location-routing problem under ambient temperature
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
This page was built for publication: The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320620)
