Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy

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

DOI10.1057/PALGRAVE.JORS.2600521zbMath1140.90351OpenAlexW2150231175MaRDI QIDQ3157719

J. Ben Atkinson

Publication date: 19 January 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600521


zbMATH Keywords

heuristicsGRASPtime windowsvehicle schedulinglearning strategy


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22)


Related Items (4)

A nonmonotone GRASP ⋮ A GRASP-based approach for technicians and interventions scheduling for telecommunications ⋮ Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications ⋮ Genetic algorithms in logic tree decision modeling







This page was built for publication: A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy

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