Skip to main content
Article thumbnail
Location of Repository

Metaheuristics for a VRP on Bipartite Graphs with Distance Constraints

By R. ARINGHIERI, M. BRUGLIERI, F. MALUCELLI and NONATO M.

Abstract

We present a hyerarchical Metaheuristic nested on two levels, developped to tackle a special Vehicle Routing Problem with unit load. Drivers duties restrictions impose a maximum duration on routes. Routes are made of elementary tours, which must be packed into feasible routes. Thus we have a bin packing structure at the outer level, and several VRPs at the inner level. The solution approach alternates between the outer and the inner problem

Topics: Vehicle routing, Tabu Search, bipartite graph
Publisher: Technische Universitat Wien
Year: 2005
OAI identifier: oai:iris.unife.it:11392/1194786
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/11392/11... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.