Local Search Heuristics for the Design of Freight Carrier Networks
Part of the
Lecture Notes in Economics and Mathematical Systems
book series (LNE, volume 460)
The design problem of freight carrier networks is an actual problem in Germany due to the changing transport market. Such a network consist of depots, each with a pick-up and delivery area, which are linked by direct relations or via hubs. The design problem involves the decisions on the number and locations of depots and hubs. The operations in a freight carrier network and the design problem are described, a planning model is formulated and a heuristic algorithm based on a Local Search Scheme is presented. Computational tests and a real life application are reported.
KeywordsBase Quantity Depot Link Neighbourhood Definition Convex Cost Function Minimum Cost Network Flow Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
: Lagrangean relaxation based approaches to capacitated hub-and-spoke network design problem. in: European Journal of Operational Research 79, 501 – 523CrossRefGoogle Scholar
: The hub location and routing problem. in: European Journal of Operational Research 83, 200 - 219CrossRefGoogle Scholar
Balakrishnan, A./Graves, P.C.
: A composite algorithm for a concave-cost network flow problem. in: Networks 19, 175 - 202CrossRefGoogle Scholar
Crainic, T.G./Delorme, L.
: Dual-ascent procedures for multicommodity location- allocation problems with balancing requirements. in: Transportation Science 27/2, 90 – 101CrossRefGoogle Scholar
Crainic, T.G./Gendreau, M./Soriano, P./Toulouse, M.
: A tabu search procedure for multicommodity location/allocation with balancing requirements. in: Annals of Operations Research 41, 359 – 383CrossRefGoogle Scholar
: Logistic System Analysis. (Springer Verlag) BerlinGoogle Scholar
Deutsche Gesellschaft fur Mittelstandsberatung mbH (Ed.)
: Transport- und Speditionswesen: Positionen. Perspektiven. Strategien. Neu-IsenburgGoogle Scholar
Domschke, W., Krispin, G.
: Location and layout planning — a survey. in: OR Spektrum 19/3, 181–194CrossRefGoogle Scholar
: New optimization heuristics: the great deluge algorithm and the record-to-record travel. in: Journal of Computational Physics 104, 86–92CrossRefGoogle Scholar
: Distributionsplanung. in: Proceedings in Operations Research 8, 293 – 308Google Scholar
: Design of freight traffic networks. in: Stähly, P. et al. (Eds): Advances in distribution logistics. (Springer Verlag) BerlinGoogle Scholar
: Nonlinear cost network models in transportation analysis. in: Mathematical Programming Study 26, 167 – 196CrossRefGoogle Scholar
Khang, D.B./Fujiwara, O.
: Approximate solutions of capacitated fixed-charge minimum cost network flow problems. in: Networks 21, 689 – 704CrossRefGoogle Scholar
: Heuristics for the p-hub location problem. in: European Journal of Operational Research 53, 25 – 37CrossRefGoogle Scholar
Larsson, T./Migdalas, A./Ronnqvist, M.
: A lagrangean heuristic for the capacitated concave minimum cost network flow problem. in: European Journal of Operational Research 78, 116 – 129CrossRefGoogle Scholar
Leung, J.M.Y./Magnanti, T.L./Singhal, V.
: Routing in point-to-point delivery systems: formulations and solution heuristics. in: Transportation Science 24/4, 245 – 260CrossRefGoogle Scholar
Skorin-Kapov, D./Skorin-Kapov, J.
: On tabu search for the location of interacting hub facilities. in: European Journal of Operational Research 73, 502 – 509CrossRefGoogle Scholar
: Vehicle routing and scheduling for trunk haulage. in: Stähly, P. et al. (Eds): Advances in distribution logistics, (Springer Verlag) BerlinGoogle Scholar
© Springer-Verlag Berlin Heidelberg 1998