Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem

DOI10.1111/itor.12264zbMath1366.90016MaRDI QIDQ5278228

Dražen Popović, Branislava Ratković, Gordana Radivojević, Milorad Vidovic

Publication date: 13 July 2017

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12264

zbMATH Keywords

vehicle routingtime windowsvariable neighborhood searchpickup and deliveryMILPmultisize container drayage

Mathematics Subject Classification ID

90C11: Mixed integer programming

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS, Combined strip and discharge delivery of containers in heterogeneous fleets with time windows, A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem, An integral LP relaxation for a drayage problem, A multiperiod drayage problem with customer-dependent service periods

Cites Work

• A tabu search heuristic for the inland container transportation problem
• Heuristic-based truck scheduling for inland container transportation
• A local search heuristic for the pre- and end-haulage of intermodal container terminals
• Variable neighborhood search
• Opportunities for OR in intermodal freight transport research: A review.
• Integrated planning of loaded and empty container movements
• A truck scheduling problem arising in intermodal container transportation
• A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
• A Heuristic Algorithm for the Vehicle-Dispatch Problem