A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST
From MaRDI portal
Publication:3013562
DOI10.1142/S0217595911003260zbMath1217.90041OpenAlexW1966679541MaRDI QIDQ3013562
Jiafu Tang, Jun Zhang, Richard Ying Kit Fung
Publication date: 18 July 2011
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595911003260
Related Items (5)
The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation ⋮ A heuristic algorithm for a supply chain's production-distribution planning ⋮ A way to optimally solve a green time-dependent vehicle routing problem with time windows ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
Cites Work
- A branch and bound algorithm for the capacitated vehicle routing problem
- The multi-depot vehicle routing problem with inter-depot routes
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
- A general heuristic for vehicle routing problems
- The vehicle routing problem with backhauls
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- Vehicle routing with split deliveries
- On symplectic classification of effective 3-forms and Monge-Ampère equations.
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A tabu search heuristic for the multi-depot vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- Sequential search and its application to vehicle-routing problems
- Scatter search --- wellsprings and challenges
- Principles of scatter search
- A scatter search for the periodic capacitated arc routing problem
- Scatter search for the vehicle routing problem with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The period routing problem
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem
This page was built for publication: A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST
