Delivery itineraries and distribution capacity of a freight network with time slots

M. Caramia, P. Dell'Olmo, M. Gentili, Pitu Mirchandani

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

The paper focuses on the distribution problem of delivering goods to medium size stores in a Central Business District (CBD) having limited off-street parking which can accommodate only restricted space and time for parking, loading/unloading operations. In this scenario, freight distribution can be addressed from two perspectives: (i) from the viewpoint of delivery/pick-up firms, delivery itineraries need to be coordinated with consideration of the delivery capacities and times at store sites for parking, and loading/unloading operations; (ii) from the viewpoint of transportation and city planners, the "distribution capacity" in the CBD must be determined, including the average cost of distribution routes, the maximum number of routes that can be simultaneously coordinated, the total number of stores that can be served, etc., much in the way traffic engineers are interested in the "traffic capacity" of a transportation network under which the vehicles move efficiently. Both the above viewpoints are addressed in this paper by solving the following problem: what delivery itineraries are available so that parking loading/unloading capacities and associated time windows are respected and the itineraries are "balanced" in a way that costs and number of deliveries fall in given ranges. This problem is studied and a mathematical programming formulation is developed. To evaluate exactly the freight distribution capacity, a branch-and-bound approach is developed, where the relaxation of the formulation provides good bounds. Subsequently, a heuristic is presented that is useful from an operational point of view. In fact, the latter algorithm exploits the results provided by the exact approach and maximizes the efficiency of the system.

Original languageEnglish (US)
Pages (from-to)1585-1600
Number of pages16
JournalComputers and Operations Research
Volume34
Issue number6 SPEC. ISS.
DOIs
StatePublished - Jun 2007
Externally publishedYes

Fingerprint

Parking
Unloading
Traffic
traffic
district
Mathematical programming
Average Cost
Transportation Networks
Formulation
Time Windows
Costs
Branch-and-bound
Industry
costs
Mathematical Programming
engineer
heuristics
Engineers
programming
Maximise

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

Delivery itineraries and distribution capacity of a freight network with time slots. / Caramia, M.; Dell'Olmo, P.; Gentili, M.; Mirchandani, Pitu.

In: Computers and Operations Research, Vol. 34, No. 6 SPEC. ISS., 06.2007, p. 1585-1600.

Research output: Contribution to journalArticle

Caramia, M. ; Dell'Olmo, P. ; Gentili, M. ; Mirchandani, Pitu. / Delivery itineraries and distribution capacity of a freight network with time slots. In: Computers and Operations Research. 2007 ; Vol. 34, No. 6 SPEC. ISS. pp. 1585-1600.
@article{ad05287b2fd945739912d99cbf7f8b9f,
title = "Delivery itineraries and distribution capacity of a freight network with time slots",
abstract = "The paper focuses on the distribution problem of delivering goods to medium size stores in a Central Business District (CBD) having limited off-street parking which can accommodate only restricted space and time for parking, loading/unloading operations. In this scenario, freight distribution can be addressed from two perspectives: (i) from the viewpoint of delivery/pick-up firms, delivery itineraries need to be coordinated with consideration of the delivery capacities and times at store sites for parking, and loading/unloading operations; (ii) from the viewpoint of transportation and city planners, the {"}distribution capacity{"} in the CBD must be determined, including the average cost of distribution routes, the maximum number of routes that can be simultaneously coordinated, the total number of stores that can be served, etc., much in the way traffic engineers are interested in the {"}traffic capacity{"} of a transportation network under which the vehicles move efficiently. Both the above viewpoints are addressed in this paper by solving the following problem: what delivery itineraries are available so that parking loading/unloading capacities and associated time windows are respected and the itineraries are {"}balanced{"} in a way that costs and number of deliveries fall in given ranges. This problem is studied and a mathematical programming formulation is developed. To evaluate exactly the freight distribution capacity, a branch-and-bound approach is developed, where the relaxation of the formulation provides good bounds. Subsequently, a heuristic is presented that is useful from an operational point of view. In fact, the latter algorithm exploits the results provided by the exact approach and maximizes the efficiency of the system.",
author = "M. Caramia and P. Dell'Olmo and M. Gentili and Pitu Mirchandani",
year = "2007",
month = "6",
doi = "10.1016/j.cor.2005.07.013",
language = "English (US)",
volume = "34",
pages = "1585--1600",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "6 SPEC. ISS.",

}

TY - JOUR

T1 - Delivery itineraries and distribution capacity of a freight network with time slots

AU - Caramia, M.

AU - Dell'Olmo, P.

AU - Gentili, M.

AU - Mirchandani, Pitu

PY - 2007/6

Y1 - 2007/6

N2 - The paper focuses on the distribution problem of delivering goods to medium size stores in a Central Business District (CBD) having limited off-street parking which can accommodate only restricted space and time for parking, loading/unloading operations. In this scenario, freight distribution can be addressed from two perspectives: (i) from the viewpoint of delivery/pick-up firms, delivery itineraries need to be coordinated with consideration of the delivery capacities and times at store sites for parking, and loading/unloading operations; (ii) from the viewpoint of transportation and city planners, the "distribution capacity" in the CBD must be determined, including the average cost of distribution routes, the maximum number of routes that can be simultaneously coordinated, the total number of stores that can be served, etc., much in the way traffic engineers are interested in the "traffic capacity" of a transportation network under which the vehicles move efficiently. Both the above viewpoints are addressed in this paper by solving the following problem: what delivery itineraries are available so that parking loading/unloading capacities and associated time windows are respected and the itineraries are "balanced" in a way that costs and number of deliveries fall in given ranges. This problem is studied and a mathematical programming formulation is developed. To evaluate exactly the freight distribution capacity, a branch-and-bound approach is developed, where the relaxation of the formulation provides good bounds. Subsequently, a heuristic is presented that is useful from an operational point of view. In fact, the latter algorithm exploits the results provided by the exact approach and maximizes the efficiency of the system.

AB - The paper focuses on the distribution problem of delivering goods to medium size stores in a Central Business District (CBD) having limited off-street parking which can accommodate only restricted space and time for parking, loading/unloading operations. In this scenario, freight distribution can be addressed from two perspectives: (i) from the viewpoint of delivery/pick-up firms, delivery itineraries need to be coordinated with consideration of the delivery capacities and times at store sites for parking, and loading/unloading operations; (ii) from the viewpoint of transportation and city planners, the "distribution capacity" in the CBD must be determined, including the average cost of distribution routes, the maximum number of routes that can be simultaneously coordinated, the total number of stores that can be served, etc., much in the way traffic engineers are interested in the "traffic capacity" of a transportation network under which the vehicles move efficiently. Both the above viewpoints are addressed in this paper by solving the following problem: what delivery itineraries are available so that parking loading/unloading capacities and associated time windows are respected and the itineraries are "balanced" in a way that costs and number of deliveries fall in given ranges. This problem is studied and a mathematical programming formulation is developed. To evaluate exactly the freight distribution capacity, a branch-and-bound approach is developed, where the relaxation of the formulation provides good bounds. Subsequently, a heuristic is presented that is useful from an operational point of view. In fact, the latter algorithm exploits the results provided by the exact approach and maximizes the efficiency of the system.

UR - http://www.scopus.com/inward/record.url?scp=33749671278&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749671278&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2005.07.013

DO - 10.1016/j.cor.2005.07.013

M3 - Article

VL - 34

SP - 1585

EP - 1600

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 6 SPEC. ISS.

ER -