The quickest path problem with batch constraints

Authors:
Herminia I. Calvete;Lourdes Del Pozo
Affiliations:
Dpto. de Métodos Estadısticos, Universidad de Zaragoza, Pedro Cerbuna 12, 50009 Zaragoza, Spain;Dpto. de Métodos Estadısticos, Universidad de Zaragoza, Pedro Cerbuna 12, 50009 Zaragoza, Spain
Venue:
Operations Research Letters
Year:
2003

Citing 4
Cited 0

The quickest path problem

Computers and Operations Research
Algorithms for the quickest path problem and the enumeration of quickest paths

Computers and Operations Research
An algorithm for finding the k quickest paths in a network

Computers and Operations Research
Algorithms for the constrained quickest path problem and the enumeration of quickest paths

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The quickest path problem has been proposed to cope with flow problems through networks whose arcs are characterized by both travel times and flowrate constraints. Basically, it consists in finding a path in a network to transmit a given amount of items from a source node to a sink in as little time as possible, when the transmission time depends on both the traversal times of the arcs and the rates of flow along arcs. This paper is focused on the solution procedure when the items transmission must be partitioned into batches with size limits. For this problem we determine how many batches must be made and what the sizes should be.