Models for multimode multicommodity location problems with interdepot balancing requirements

DOI10.1007/BF02097809zbMath0707.90064OpenAlexW2069701305MaRDI QIDQ920012

Pierre Dejax, Teodor Gabriel Crainic, Louis Delorme

Publication date: 1989

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02097809

zbMATH Keywords

intercity freight transportation systemlocating vehicle depotstwo- echelon multimode multicommodity location

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia, A tabu search procedure for multicommodity location/allocation with balancing requirements, A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements, A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points, Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements, A parallel branch-and-bound algorithm for multicommodity location with balancing requirements, Location and layout planning. A survey, Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements, Liner Shipping Cargo Allocation with Repositioning of Empty Containers, Unnamed Item, Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions, NAFTA supply chains: facilities location and logistics, Positioning empty containers among multiple ports with leasing and purchasing considerations, A branch-and-bound method for multicommodity location with balancing requirements, Lower and upper bounds for a capacitated plant location problem with multicommodity flow, Planning models for freight transportation

Cites Work

• Facility location models for distribution planning
• The simple plant location problem: Survey and synthesis
• A unified framework for primal-dual methods in minimum cost network flow problems
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• A Dual-Based Procedure for Uncapacitated Facility Location
• Implicit representation of generalized variable upper bounds in linear programming
• Non-Linear Programming Via Penalty Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item