The freight allocation problem with lane cost balancing constraint

DOI10.1016/j.ejor.2011.08.028zbMath1244.90041OpenAlexW2055891117MaRDI QIDQ439318

Zhou Xu, Hu Qin, Andrew E. B. Lim

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.08.028

zbMATH Keywords

tabu searchcost balancefreight allocationminimum quantity commitment

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (5)

Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem ⋮ Leader-based diffusion optimization model in transportation service procurement under heterogeneous drivers' collaboration networks ⋮ A robust optimisation approach to the problem of supplier selection and allocation in outsourcing ⋮ Component allocation cost minimization for a multistate computer network subject to a reliability threshold using tabu search ⋮ An optimization approach for winner determination problem considering transportation cost discounts

Uses Software

• CPLEX
• Tabu search

Cites Work

• Unnamed Item
• Exact algorithms for procurement problems under a total quantity discount structure
• Analysis of supply contracts with quantity flexibility
• The practice of supply chain management: Where theory and application converge.
• \(k\)-center problems with minimum coverage
• Combinatorial Auctions: A Survey
• Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees
• The bottleneck problem with minimum quantity commitments
• The bidding selection and assignment problem with minimum quantity commitment
• Analysis of supply contracts with commitments and flexibility
• Analysis of supply contracts with minimum total order quantity commitments and non-stationary demands

This page was built for publication: The freight allocation problem with lane cost balancing constraint