A Heuristic Algorithm for the Auto-Carrier Transportation Problem
From MaRDI portal
Publication:4411210
DOI10.1287/trsc.36.1.55.567zbMath1065.90504OpenAlexW2010760121WikidataQ58644547 ScholiaQ58644547MaRDI QIDQ4411210
Roberto Tadei, Guido Perboli, Frederico Della Croce
Publication date: 7 July 2003
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.36.1.55.567
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
Integrated shipment dispatching and packing problems: a case study ⋮ Mode selection for automotive distribution with quantity discounts ⋮ Optimized load planning for motorail transportation ⋮ Routing problems with loading constraints ⋮ Downward compatible loading optimization with inter-set cost in automobile outbound logistics ⋮ A multi-start local search heuristic for the multi-period auto-carrier loading and transportation problem in Brazil ⋮ The stochastic generalized bin packing problem ⋮ A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico ⋮ Order acceptance for motorail transportation with uncertain parameters ⋮ The multi-Handler knapsack problem under uncertainty ⋮ The stochastic \(p\)-median problem with unknown cost probability distribution
This page was built for publication: A Heuristic Algorithm for the Auto-Carrier Transportation Problem
