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

On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)

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

DOI10.1057/jors.1990.119zbMath0711.90043OpenAlexW2088130396MaRDI QIDQ3496144

No author found.

Publication date: 1990

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

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


zbMATH Keywords

heuristicchain-exchange principleone-depot vehicle-routeing


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)


Related Items

Routing problems: A bibliography ⋮ Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling ⋮ A survey of very large-scale neighborhood search techniques ⋮ A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls



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