Til hovedinnhold
Norsk English

The Mixed Capacitated General Routing Problem

Sammendrag

In the VRP literature, there is almost a dichotomy between arc and node routing. In real life, there are several applications where a pure node routing or a pure arc routing formulation is not adequate. This talk will motivate, define, and describe the Mixed Capacitated General Routing Problem (MCGRP), also called the Node, Edge, and Arc Routing Problem (NEARP) which is a generalization of the CARP and the CVRP. The relatively scarce literature on the MCGRP and variants will be summarized, with focus on recent results.

Kategori

Vitenskapelig foredrag

Oppdragsgiver

  • Research Council of Norway (RCN) / 205298
  • Research Council of Norway (RCN) / 217108

Språk

Engelsk

Forfatter(e)

Institusjon(er)

  • SINTEF Digital / Mathematics and Cybernetics

Presentert på

The International Colloquium on Graphs and Optimization 2014 (GO IX)

Sted

Sirmione

Dato

06.07.2014 - 10.07.2014

Arrangør

C. Archetti, L. Bertazzi, A. Hertz, B. Ries, S. Varone

År

2014

Vis denne publikasjonen hos Cristin