An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot
From MaRDI portal
Publication:324308
DOI10.1007/s10479-015-1792-xzbMath1350.90014OpenAlexW2010659373MaRDI QIDQ324308
Publication date: 11 October 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1792-x
local searchparticle swarm optimizationcartonheterogeneous vehicle routing problem with a collection depotself-adaptive inertia weight
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Block-matrix-based approach for the vehicle routing problem with transportation type selection under an uncertain environment, Evolutionary algorithms for supply chain management, Random orthocenter strategy in interior search algorithm and its engineering application, Improved particle swarm optimization and neighborhood field optimization by introducing the re-sampling step of particle filter, How managerial perspectives affect the optimal fleet size and mix model: a multi-objective approach, Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem, A Green Vehicle Routing Problem with Multi-Depot, Multi-Tour, Heterogeneous Fleet and Split Deliveries: a mathematical model and heuristic approach, A hybrid ant colony optimization for dynamic multidepot vehicle routing problem, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, Optimization of competitive facility location for chain stores, A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands, Scheduling quay cranes and yard trucks for unloading operations in container ports, Particle Swarm Optimization for Split Delivery Vehicle Routing Problem, Multi-objective optimization algorithm based on improved particle swarm in cloud computing environment
Cites Work
- Finding reliable shortest paths in road networks under uncertainty
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
- Disrupted capacitated vehicle routing problem with order release delay
- An improved decomposition-based heuristic to design a water distribution network for an irrigation system
- The multi-depot vehicle routing problem with inter-depot routes
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- Shuffled complex evolution approach for effective and efficient global minimization
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
- A tabu search heuristic for the multi-depot vehicle routing problem
- An improved ant colony optimization for vehicle routing problem
- A Birnbaum-importance based genetic local search algorithm for component assignment problems
- A support vector machine with the tabu search algorithm for freeway incident detection
- Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization
- 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
- A Simplex Method for Function Minimization
