Positioning empty containers among multiple ports with leasing and purchasing considerations

DOI10.1007/S00291-010-0197-0zbMath1201.90032OpenAlexW2109436748MaRDI QIDQ989622

Il-Kyeong Moon, Anh-Dung Do Ngoc, Yun-Su Hur

Publication date: 23 August 2010

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-010-0197-0

zbMATH Keywords

mixed integer programminghybrid genetic algorithmempty container positioning

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

The sample average approximation method for empty container repositioning with uncertainties ⋮ Encroachment and canvassing strategy in a sea-cargo service chain with empty container repositioning ⋮ Tank container operators' profit maximization through dynamic operations planning integrated with the quotation-booking process under multiple uncertainties ⋮ A network flow model for the optimal allocation of both foldable and standard containers

Cites Work

• Unnamed Item
• Unnamed Item
• Allocation of empty containers between multi-ports
• Models for multimode multicommodity location problems with interdepot balancing requirements
• A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
• A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
• Empty container management in a port with long-run average criterion
• A tabu search procedure for multicommodity location/allocation with balancing requirements
• A genetic algorithm for facility layout design in flexible manufacturing systems
• Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements

This page was built for publication: Positioning empty containers among multiple ports with leasing and purchasing considerations