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.

Metaheuristics for a VRP on Bipartite Graphs with Distance Constraints

NONATO, Maddalena
2005

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.
2005
Vehicle routing; Tabu Search; bipartite graph
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11392/1194786
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact