Optimal solution of a total time distribution problem

Let G = ( F, E, A) be a connected graph representing a distribution network k items. The elements of D ⊆ V represent demand centers, while Q ⊆ V contains the suppliers. Every node q i ϵ Q can supply the p qi 1 , p qi 2 , … items. To each node q i , is associated a weight c( q i ), which represents i...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production economics 1996-08, Vol.45 (1), p.473-478
Main Authors: Tsouros, C, Satratzemi, M
Format: Article
Language:English
Subjects:
Algorithm
Algorithms
Distribution costs
Distribution network
Distribution planning
Facilities planning
Facility location
Graphs
Inventory management
Logistics
Optimization
Site selection
Studies
Suppliers
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Let G = ( F, E, A) be a connected graph representing a distribution network k items. The elements of D ⊆ V represent demand centers, while Q ⊆ V contains the suppliers. Every node q i ϵ Q can supply the p qi 1 , p qi 2 , … items. To each node q i , is associated a weight c( q i ), which represents its installation cost. Every node d j ϵ D requires the p′ d j 1 , p′ d j n2 h. items. Each item p j claims a delivery time at most t j . A weight a( x, y) is associated with every arc ( x, y) ϵ E, which denotes the needed time to reach node y directly from node x. In this paper a method is developed which detects a subset Q ∗ ⊆ Q in order to minimize the total delivery time under a given budget restriction.
ISSN:0925-5273
1873-7579
DOI:10.1016/0925-5273(95)00148-4