Theory and methodologyDesigning distribution systems with transport economies of scale
References (28)
Facility location models for distributions planning
European Journal of Operational Research
(1985)- et al.
Primal transportation and transshipment algorithms
Zeitschrift für Operations Research
(1980) - et al.
Transportation type problems with quantity discounts
Naval Research Logistics Quarterly
(1976) - et al.
A decision support program for planning locations and allocations with the aid of linear programming
- et al.
A property of assignment type mixed integer linear programming problems
Modellierung Verkehrsbetrieblicher Transporte in Computergestützten Distributionssystemen
(1984)Ein Branch-and-Bound Verfahren für Distributionsprobleme mit nichtkonkaver, degressiver Zielfunktion
Operations Research Verfahren
(1979)Computergestützte Planung kostenoptimaler logistischer Systeme für Unternehmen ohne eigenen Furhpark
Kritische Betrachtungen über die Liberalisierung des Verkehrsmarktes und Einschätzung der Kooperationsmöglichkeiten
Distributionsplanung
A guide to computer-assisted methods for distribution systems planning
Sloan Management Review
Multicommodity distribution system design by Benders' decomposition
Management Science
Strategic distribution planning: A status report
Capacitated warehouse location with concave costs
Journal of the Operational Research Society
Cited by (37)
A Physarum-inspired algorithm for logistics optimization: From the perspective of effective distance
2021, Swarm and Evolutionary ComputationCitation Excerpt :In other logistics optimization problems (such as the effect of logistics alliance [19], the districting problem [20] and the location problem [21,22]), many attempts have also been made to improve them on the basis of parameter distance. However, since some transportation modes will lead to fixed cost for each shift regardless of delivery distance [23] and the relationship between cost and transportation volume should be taken into consideration [24], distribution cost minization should no be based solely on the shortest topological distance or geographical distance. Researches have explored the use of heuristic algorithms to address the problems related to distribution logistics.
Greenhouse gas reduction in transport: Analyzing the carbon dioxide performance of different freight forwarder networks
2015, Journal of Cleaner ProductionCitation Excerpt :The simultaneous consideration of shipment attributes (i.e., weight and volume) may result in significant savings if heterogeneous packages can be transported together (Hall, 1991). Fleischmann (1993) presents a multi-product distribution planning model using different types of distribution networks with multiple transport stages and nonlinear transportation costs and discusses distribution systems in Germany and Western Europe. Network design problems involve the network structure, the number, location, and capacity of distribution centers and TSPs, the replenishment frequency, the distribution paths from factories to customers, and the transportation modes.
Demand dispersion and logistics costs in one-to-many distribution systems
2012, European Journal of Operational ResearchCitation Excerpt :In this paper, we consider one-to-many distribution systems without transshipment warehouses where multiple demand locations receive their products from a single facility. The motivation for using such systems is that if warehouse operations are centralized, economies of scale in production and in warehousing are achieved; see Fleischmann (1993). A one-to-many distribution model can be appropriate for perishable goods; see for example Federgruen et al. (1986).
Supply chain design considering economies of scale and transport frequencies
2012, European Journal of Operational ResearchCitation Excerpt :Paraschis (1989) included inventory cost in his model but assumed that replenishment frequencies are exogenously given. Fleischmann (1993) expanded this model to a stochastic environment with safety stock. Both, Paraschis (1989) and Fleischmann (1993), used flow models and solved the problem heuristically.
Facility location models for distribution system design
2005, European Journal of Operational ResearchCitation Excerpt :Approximation algorithms for the CFLP are considered in Shmoys et al. (1997), Guha and Khuller (1998), Korupolu et al. (1998), Chudak and Williamson (1999) and Chudak and Shmoys (1999); Delmaire et al. (1999) employ a GRASP as well as a tabu search procedure for the CFLPSS; Scaparra (2002) proposes local search procedures based on exponentially sized “cyclic transfer” neighborhoods for this problem, and a number of metaheuristic approaches (evolutive algorithm, simulated annealing, GRASP, tabu search) to the CFLPSS are discussed in Dı́az (2001). Applications of facility location models are not restricted to the primary application area of this article, that is, the design of distribution systems (for applications of facility location models to practical problem solving in the area of logistics network design see, e.g., Geoffrion and Graves, 1974; Geoffrion et al., 1982; Gelders et al., 1987; Robinson Jr. et al., 1993; Fleischmann, 1993; Geoffrion and Powers, 1995; Köksalan et al., 1995; Tüshaus and Wittmann, 1998; Engeler et al., 1999; Bruns et al., 2000; Galvão et al., 2002; Boffey et al., 2003; Vasko et al., 2003). By contrast many other problems where location and allocation decisions are interdependent are covered also.
An integrated multi-depot hub-location vehicle routing model for network planning of parcel service
2004, International Journal of Production EconomicsCitation Excerpt :First there is an approximation of the length of the route, as suggested in Eilon et al. (1971), Daganzo (1984) and Chien (1992). These route lengths enable derivation of the delivery costs (Fleischmann, 1993). Approximation approaches collectively assume that route planning is undertaken within a combined location and route-planning problem solely to better estimate delivery costs.