Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks
From MaRDI portal
Publication:2668623
Recommendations
- Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking
- A modified variable neighborhood search hybridized with genetic algorithm for vehicle routing problems with cross-docking
- A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem
- An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
Cites work
- A general heuristic for vehicle routing problems
- A heuristic column generation method for the heterogeneous fleet VRP
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
- A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: passenger pickup algorithm
- A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
- A simulated annealing heuristic for the open location-routing problem
- A simulated annealing heuristic for the team orienteering problem with time windows
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- A unified exact method for solving different classes of vehicle routing problems
- Adaptive memory programming: a unified view of metaheuristics
- Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking
- Adaptive temperature control for simulated annealing: a comparative study
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
- Equation of state calculations by fast computing machines
- Optimization by simulated annealing
- Routing a heterogeneous fleet of vehicles
- Scheduling of inbound and outbound trucks in cross docking systems with temporary storage
- The fleet size and mix vehicle routing problem
- The General Pickup and Delivery Problem
- The pickup and delivery problem with cross-docking
- Vehicle routing with cross-dock selection
- Vehicle routing with cross-docking
Cited in
(11)- A modified variable neighborhood search hybridized with genetic algorithm for vehicle routing problems with cross-docking
- A hybrid genetic algorithm for the multiple crossdocks problem
- An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments
- Multi-fleet feeder vehicle routing problem using hybrid metaheuristic
- Balancing and scheduling assembly lines with human-robot collaboration tasks
- Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking
- A hub-and-spoke architecture for a parcel delivery system using the cross-docking distribution strategy
- Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints
- An improved sequential insertion algorithm and tabu search to vehicle routing problem with time windows
- Production and distribution planning with direct shipment and multi-trips
- A novel mathematical modeling approach for integrating a periodic vehicle routing problem and cross-docking system
This page was built for publication: Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668623)
