Particle Swarm Optimization for Split Delivery Vehicle Routing Problem (Q4642133)

From MaRDI portal

Revision as of 09:33, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 6870847

Language	Label	Description	Also known as
English	Particle Swarm Optimization for Split Delivery Vehicle Routing Problem	scientific article; zbMATH DE number 6870847

Statements

scholarly article

0 references

Particle Swarm Optimization for Split Delivery Vehicle Routing Problem (English)

0 references

0 references

0 references

0 references

0 references

Asia-Pacific Journal of Operational Research

0 references

publication date

22 May 2018

0 references

zbMATH Keywords

split delivery

0 references

VRP

0 references

particle swarm optimization

0 references

MaRDI profile type

MaRDI publication profile

0 references

A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery

0 references

A tabu search with vocabulary building approach for the vehicle routing problem with Split demands

0 references

Branch-and-cut algorithms for the split delivery vehicle routing problem

0 references

Vehicle routing problems with split deliveries

0 references

A Lower Bound for the Split Delivery Vehicle Routing Problem

0 references

Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

0 references

A randomized granular tabu search heuristic for the split delivery vehicle routing problem

0 references

The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results

0 references

Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

0 references

Vehicle routing with split deliveries

0 references

Savings by Split Delivery Routing

0 references

Split delivery routing

0 references

A tabu search heuristic for the vehicle routing problem with time windows and split deliveries

0 references

Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand - a case study on garbage collection system

0 references

A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem

0 references

A particle swarm optimization algorithm with path relinking for the location routing problem

0 references

Testing local search move operators on the vehicle routing problem with split deliveries and time windows

0 references

Improved lower bounds for the split delivery vehicle routing problem

0 references

An iterated local search heuristic for the split delivery vehicle routing problem

0 references

Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

0 references

An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot

0 references

full work available at URL

https://doi.org/10.1142/s0217595918400067

0 references

Identifiers

zbMATH Open document ID

0 references

10.1142/S0217595918400067

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4642133

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4642133&oldid=37099065"