Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2741611
Jump to:navigation, search

zbMath0976.90017MaRDI QIDQ2741611

Olli Bräysy

Publication date: 20 September 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

time windowsvehicle routing problemmetaheuristic algorithmdeterministic local search algorithms


Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)


Related Items (8)

Routing relatively few customers per route ⋮ A multi-start local search algorithm for the vehicle routing problem with time windows ⋮ A hybrid search method for the vehicle routing problem with time windows ⋮ Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics ⋮ A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows ⋮ A memetic algorithm for the vehicle routing problem with time windows ⋮ Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance ⋮ Tabu search heuristics for the vehicle routing problem with time windows.




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2741611&oldid=15605940"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki