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

A learning tabu search for a truck allocation problem with linear and nonlinear cost components

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

DOI10.1002/nav.21612zbMath1411.90060OpenAlexW1876848560MaRDI QIDQ4632880

David Schindl, Nicolas Zufferey

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: http://hesso.tind.io/record/1812/files/Schindl_2015_learning_tabu_search.pdf


zbMATH Keywords

metaheuristicstabu searchtruck allocation problem


Mathematics Subject Classification ID

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


Related Items

Design of a quality control network for an international food company ⋮ Learning variable neighborhood search for a scheduling problem with time windows and rejections ⋮ Graph multi-coloring for a job scheduling application



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