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

A heuristic algorithm for the multi-depot periodic vehicle routing problem

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

DOI10.1080/02522667.2000.10699457zbMath1018.90002OpenAlexW2008660757MaRDI QIDQ2764974

Lichuan Chu, Wei-Tzen Yang

Publication date: 15 September 2003

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2000.10699457


zbMATH Keywords

schedulingvehicle routingheuristic algorithms


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)


Related Items (1)

An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP




Cites Work

  • The period routing problem
  • Survey Paper—Time Window Constrained Routing and Scheduling Problems
  • The Simultaneous Origin-Destination Assignment and Vehicle Routing Problem
  • A Heuristic for the Periodic Vehicle Routing Problem
  • Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows




This page was built for publication: A heuristic algorithm for the multi-depot periodic vehicle routing problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2764974&oldid=15642190"
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:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki